Check assignment 3 marks assignment 3 marks

Week	Topic	Reading	Notes
1	Unix quick demo; Review of COMP125 .
2	Correctness (loop invariants); Performance (complexity analysis).	Complexity and correctness	Trees covered in week 2.
3	Programming binary trees . Assignment 1 notes and dynamic programming .		Binary tree class. Binary search tree class. Maximal contiguous subsequence sum Computing a winning strategy.
4	Dynamic Programming, and longest common subsequence Sorting
5	Bucket sort
6	More sorting including bucket, radixsort. Hints for Assignment 2, and the Eight Queens Problem.
7	Priority Queues, Heaps and HeapSort
8	Advanced ADT Table IMplementations
9	Graphs
10	More on graphs (and text processing)
11	External Storage (and balanced search trees)
12	An introduction to computational complexity classes (and revision)
13	Revision. Sample paper 1. Sample paper 2.

Copyright & Site information

• Copyright Macquarie University
• Privacy statement

• CRICOS Provider No 00002J, ABN 90 952 801 237
• Authorised by: HOD