McMaster University
Principles of Programming

SFWR ENG 2S03 - Fall 2006

Instructor

Dr. Wolfram Kahl
ITB-245, kahl@mcmaster.ca
Office hour: Wednesday, 12:30-13:20

News

• Extra Tutorial on Tuesday, December 5: HH-109, 11:00
• Questions and Answers concerning the Final

  Q: I'm just wondering if your site has anything on what chapters that's on
     the exam for the textbook. If not, could you help me what chapters
     that's on it.
  
  A: Essentially start from the lecture slides: We covered most of
     chapters 1-7, 10, and 12, with a quick glance at chapter 8 (basic
     knowledge of printf and scanf, discussed in chapter 9, and preprocessor
     directives, discussed in chapter 13.1-3, is assumed)
     and 14.4, 14.5.
  
  Q: Coverage of the final?
  
  A: Of course includes material covered after the last midterm.
     Coverage is comprehensive, with emphasis on pointer-linked data
     structures like lists and trees.
  

• November 3: Midterm 3 moved to November 20!
• October 18: Midterm 2 moved to Wednesday!
• September 21: New rooms for all tutorial groups!

Tests

• Midterm Test 1: Monday, Oct. 2, 8:30-9:20 a.m., T29-101
• Midterm Test 2: Wednesday, Oct. 23, 8:30-9:20 a.m., T29-101
• Midterm Test 3: Monday, Nov. 20, 8:30-9:20 a.m., T29-101

Teaching Assistants

Lab office hour: Wednesday, 12:30-14:20, ITB-235

Outline

The course outline is available as PostScript  and as PDF .

Lecture Slides

Slides are formatted 4-up on Letter paper - printing on A4 paper will cut off a part.

Slides that contains copies of textbook programs are not included.

All code files are generated from the slide source as byproduct of slide formatting - code formatting is therefore not optimised for direct viewing.

• Introduction (September 8-15) ,   -   Q2005_1.c, Q2005_1_assert.c,
• Control Structures (September 15-25) ,   -   Fig. 2.13, message.c, addAssoc.c, empty.c, Fig. 3.8
• Functions (September 27-) ,   -   incrX.c, squares.c, squares2.c, squares3.c, series1.c, series2.c, series3.c, factorial1.c, factorial2.c, factorial3.c, factorial4.c, squares4.c, myproc.c, fib1.c, ackermann.c
• Arrays (updated Oct. 10) ,   -   ArrayArgs1.c, ArrayArgs2.c, StructArrayTest.c, VarArray.c, TwoDimTest.c, TwoDimInitTest.c, linearSearch.c
• Pointers ,   -   pointers1.c, pointers2.c, pointers3.c, pointers4.c, suits.c, argv.c, argvS.c, flip.c, constAddr.c, voidp.c, locstring.c, strrev.c, fpointers1.c, strings.c, strtod.c
• Types (typedef, enum, struct) ,   -   months.c, point1.c, pointAdd.c, addToPoint.c, line.c, structaddr.c, bitwise.c, locvar.c, newPoint.c
• Linked Lists (November 1-17) ,   -   CharList.c, CharList.h, CharListTest.c
• Further Datatypes (November 22 - December 1, treeSize and treeMember added December 1) ,   -   queue.h, queue.c, Tree.h, Tree.c, stack.h

Exercises

• Sheet 1 (13 September): ,   -   Solution hints: ,
• Sheet 2 (20 September): ,   -   Solution hints: ,
• Sheet 3 (27 September): ,   -   Solution hints: ,
• Sheet 4 (4 October): ,   -   fib1.c   -   Solution hints: ,
• Sheet 5 (11 October): ,   -   Solution hints: ,
• Sheet 6 (18 October): ,   -   Solution hints: ,
• Sheet 7 (27 October): ,   -   Solution hints: ,
• Sheet 8 (1 November): ,   -   Solution hints: ,
• Sheet 9 (8 November): ,
• Sheet 10 (15 November): ,   -   Solution hints: ,
• Sheet 11 (24 November): ,

Schedule

	Monday	Tuesday	Wednesday	Thursday	Friday
8:30-9:20	Lecture: MGDA-AB102		Lecture: MGDA-AB102
9:30-10:20
10:30-11:20					Lecture: MGDA-AB102
11:30-12:20					Group 4 in BSB-B142
12:30-13:20	Group 1 in BSB-135 Group 2 in BSB-B142		TA lab hour ITB-235
13:30-14:20		Group 5 in BSB-B142	TA lab hour ITB-235
14:30-15:20			Group 3 in JHE-A101 Group 6 in BSB-135
15:30-16:20			(Group 3 in JHE-A101)

Tutorials begin in the week of September 18.

Textbook

Harvey M. Deitel, Paul J. Deitel: C How to Program, 4th Edition Prentice Hall, 2003, ISBN: 0-13-142644-3

(This book should be in stock in the textbook section of Titles.)

The book's companion website provides, among other resources, interactive quizzes. (There is also a companion website for the third edition.)

Links

• Dictionary of Algorithms and Data Structures
• Imperative programming using C from Bordeaux University, with a nicely structured presentation of various list datatypes

Academic Dishonesty

Academic dishonesty consists of misrepresentation by deception or by other fraudulent means and can result in serious consequences, e.g. the grade of zero on an assignment, loss of credit with a notation on the transcript (notation reads: ``Grade of F assigned for academic dishonesty''), and/or suspension or expulsion from the university.

It is your responsibility to understand what constitutes academic dishonesty. For information on the various kinds of academic dishonesty please refer to the Academic Integrity Policy, specifically Appendix 3, located at http://www.mcmaster.ca/senate/academic/ac_integrity.htm

The following illustrates only three forms of academic dishonesty:

1. Plagiarism, e.g. the submission of work that is not one's own or for which other credit has been obtained.
2. Improper collaboration in group work.
3. Copying or using unauthorized aids in tests and examinations.

Discrimination

The Faculty of Engineering is concerned with ensuring an environment that is free of all adverse discrimination. If there is a problem that cannot be resolved by discussion among the persons concerned, individuals are reminded that they should contact the Department Chair, the Sexual Harassment Office or the Human Rights Consultant, as soon as possible.

 (-Viewer)               (-Viewer)