course
CSC 215: Procedural Programming
Course Objective
The objective of this course is to develop the students' ability to use basics of procedural programming. The students learn the main features of procedural programming: control structures, functions, arrays, c-style strings, pointers and structures, FileI/O, and LinkedLists.
Grading Policy
- (10) Labs: 10% (1% each)
- (3) Lab Exams: 30% (10% each)
- Midterm: 20%
- Final Exam: 40%
Important Reminder:
- Students will be denied final exams if they exceed 25% absence rate
- The absence rate is counted for both lectures and labs.
- Excuses of absence are accepted no later than one week of the absence.
- You must bring a pen and a notebook to each class.
- Cheating is not tolerated, students who cheat in exams, labs, quizzes will fail the course.
Textbook
The C Programming language. Second Edition. Brian W. Kernighan, Dennis M. Ritchie.
Tentative Course Schedule (slides to be added as the course progresses)
Lecture | Assignments | Reading | |
Week 1 | Introduction and Course Logistics | Lab 1 | Ch. 1.1, 1.2, 2.1, 2.2 |
Week 2 | Types, Operators, and Expressions | Lab 2 | Ch. 2 |
Week 3 | Control Flow | Lab 3 | Ch. 3 |
Week 4 | Functions and Program Structure | Lab 4 | Ch. 4. Example |
Week 5 | Pointers and Arrays | Lab Test 1 | Ch. 5.1 to 5.11 |
Week 6 | Memory Management | Lab 5 | Ch. 7.8 realloc example |
Week 7 | Structures | Lab 6 | Ch. 6 |
Week 8 | Review: R1 | Lab 7 | Ch 1-6 |
Midterm Exam: Thursday March 24th, 2016 6:30pm | |||
Week 9 | Input and Output | Lab 8 | Ch. 7 |
Week 10 |
|
Ch. 7.8 |
|
Week 11 | Math Operations | Lab Test 2 | |
Week 12 | Linked Lists |
Lab 10 |
Ch. 3.5, 5.6 |
Week 13 | Sorting and Searching |
Lab 11 |
|
Week 14 | Review | Lab Test 3 | |
Final Exam: Sunday May 8th at 1pm |
TA
Visit the TAs webpage: Muhammed Zakariah