Textbook

The text is Deshpande and Kakde, C & Data Structures, Charles River Media, 2004.

The Course

Topics

• Structure of a C program
• Preprocessor directives
• Basic data types
• Pointers
• Arrays
• String handling
• Sorting
• More pointers
• Dynamic memory allocation
• Recursion
• Bitwise operators and operations
• Still more pointers
• Low-level programming ideas
• Linked lists

If time permits we may discuss pointers some more.

Programs

There will be several programming assignments. Programming assignments will be posted on the course website

You may discuss the programming projects with other students (this is encouraged) but you must do and submit your own work. No joint work will be accepted. Read the CS Department honor code: http://cs.gmu.edu/wiki/pmwiki.php/HonorCode/CSHonorCodePolicies, and the University honor code: http://honorcode.gmu.edu . You are bound by these honor codes. Any submitted work which shows too much commonality with others' work to be completely original, or any plagiarized work, will receive a grade of 0. Any code which is presented in class or provided to you as part of the project may be included in your programs.

You can only turn in a program once. No revisions or additions can be made to your program after it has been submitted. Late programs will be accepted with a 10 points per day late penalty. You are responsible for keeping backups of your work ("my disk crashed" and "my roommate ate my program" are not reasons for late submissions).

Grading

There will be a midterm exam and a final. There will be no makeups on exams except under exceptional circumstances (as judged by me), and any such makeup must be arranged in advanced. Grades will computed from a weighted average computed with the following weights:

• programs: 35%
• midterm exam: 30%
• final exam: 35%