PDF versions of the lecture notes will be made available here. For course material in an alternative format, please ask the Co-ordinator.
Java Refresh (Covered in 1st Week.)
- Overview Slides; 1.1.1, 1.2-1.5, (1.6 Recommended). (Optional: Enum Types, Bitwise Ops)
- 1.9, (1.7-1.8 Recommended).
Object-Oriented Programming (Book Chapters 2.1, 2.2, 2.4)
Data Structures ('!' used to denote 'not')
- Lists and ADTs (Chapters 3.2, 3.3)
- Running Time Evaluation (4.2, !4.2.5, !4.2.6, !recursion)
- Array Lists (Chapters 6.1.1, 6.1.3)
- Stacks (Chapter 5.1)
- Queues (Chapter 5.2)
Searching and Sorting ('!' used to denote 'not')
- Insertion Sort(Chapters 3.1.2) and QuickSort (11.2, !11.2.1)
- Mergesort(pp502-506) and (another view of) QuickSort (pp515-519) Only a 'high-level' understanding of mergesort and quicksort is required.
- Sequential Search, and Binary Search
Decision Support Systems (No text)
