The purpose of this site is to help you out with the CS120N/CS120# course, which is a core course at IIT Delhi.
Syllabus The Courses of Study booklet has this to say: CS 120N: Introduction to Computer Science Credits: 3-0-2 (3 Lectures and two hours of practical in a week) Design of algorithms: Iterative versus recursive style; problem solving using Scheme; correctness issues in programming; assertions and loop invariants; efficiency issues in programming; time and space measures; programming in Pascal using special features: procedures, functions, list handling using pointers, file handling; overview of computer architecture, operating systems and system software. The following page has important information about the course. Please note that some details may change depending upon the course coordinator. The Official CS120 page The following pages provide important course material. Examples on Mathematical Induction Some examples from Number Theory Proving correctness by induction Introduction to Asymptotic Notation Finding time complexity Finding Loop Invariants Writing Recursive Algorithms Some Excercises on recurrence relations The following page provides examples in Standard Mathematical Language.