Introduction to problem solving, a brief review of Von-Neumann architecture, Introduction to programming, role of compiler and linker, introduction to algorithms, basic data types and variables, input/output constructs, arithmetic, comparison and logical operators, conditional statements and execution flow for conditional statements, repetitive statements and execution flow for repetitive statements, lists and their memory organization, multi-dimensional lists, introduction to modular programming, function definition and calling, stack rolling and unrolling, string and string operations, pointers/references, static and dynamic memory allocation, File I/O operations.
- The student must prepare themselves for the class lecture and discussion by going through, in advance, the relevant chapter from the text book, reference, reading material etc. and be ready for a quiz in the class from the chapter / chapters already discussed / due for the discussion in class.
- The student must ensure a minimum 75% attendance. If a student accumulates more than allowed number of absences he/she will be awarded ‘F’.
- If a student wishes to withdraw from the course he/she must do so before 2nd Midterm or “F” will be given automatically.
| GRADING BREAKUP | EXAMINATION POLICY | ||
|---|---|---|---|
| Midterm Exam | 20% | Midterm Exam | 2 Hours (9th Session) |
| Final Exam | 50% | Final Exam | 3 Hours (18th Session) |
| Quizzes, Class Participation/ Attendance, Assignments etc. | 30% | Attendance | 75% |