COL100: Introduction to Computer Science (4 Credits)
Organization of Computing Systems. Concept of an algorithm; termination and correctness. Algorithms to programs: specification, top-down development and stepwise refinement. Problem solving using a functional style; Correctness issues in programming; Efficiency issues in programming; Time and space measures. Procedures, functions. Data types, representational invariants. Encapsulation, abstractions, interaction and modularity. Identifying and exploiting inherent concurrency. Structured style of imperative programming. Introduction to numerical methods. At least one example of large program development
Programming language is up to the profs, but it's the algorithms that are important, you can take up the problems from here and solve them in whichever language is being covered in your course.
Usually cutoff for 10 is around 80. (Sem. II was an exception due to the grading, the cutoff was 99+)
Typically considered a "fighter" course (although students with a background in CS or math may find it slightly easier). Try to be consistent from the beginning.
Prof. Suban's notes are extremely useful (see sem 1- extra reading)