CPSC 101 Computing and Algorithms I

SYLLABUS



Total class meetings: (3 times a week for 11 weeks) = 33 classes.
 

1. Introduction to Computers and Computing; Introduction to various models of Computation.

2. Programming Language concepts; Compilers, Interpreters, Loaders; Components of a high level language; First Program in Java

3. Primitive Data types: char, int, double, float, boolean;

4. Constants and variables; Data representation; Escape Sequences;

5. Assignment statement and type casting;

6. Input/Output of primitive types; Initialization.

7. Arithmetic, boolean, increment and decrement operators;

8. Logical Operators, precedence

9. Branching statements: if-then-else, switch;

10. Looping Statements: while, for, do.

11. Methods, writing and calling methods.

12. More on methods. Parameter passing mechanisms.

13. Creating classes; member variables and member methods;

14. Instantiation of a class; Using the methods in a class;

15. Constructors.

16. Using a class from JDK: The String class.

17. Passing objects as parameter to methods.

18. Scope and visibility modifiers;

19. Scope and visibility of member methods and variables.

20. Creating packages.

21. Static and final modifier;

22. Arrays and array manipulation.

23. Writing programs using array of objects. Two dimensional arrays

24. Subclasses and inheritance.

25. Protected Modifier.

26. Sorting and searching

Note: The actual coverage may vary from the above syllabus, depending on students' performance, pace and other unforseen circumstances. There is no guarantee that I will follow the above syllabus word-to-word and in that order. The above syllabus is only a guideline.