n1. Introductory matter. Problem solving stages.
2. Brief introduction to algorithm descriptions in pseudo-code.
3. Programming style. Digital representions.
4. Variables. Functions
5. Preprocessing in C. Standard I/O. Expressions
6. Statements. Pointers and pointer operations. Memory allocation/deallocation Introductory matter

n7. Midterm. Pointers and functions
8. Pointers and functions
9. Recursivity
10. Data types: structure, union, enumeration
11. Files
12. Numeric algorithms sample design and implementation
13. More program samples
14. Wrap-up and review

Syllabus

Recommended Reading