Leader: Ann Nicholson
Not offered in 2006.
Synopsis: This unit introduces students to problem solving concepts and techniques fundamental to the science of programming. In doing this it covers problem specification, algorithmic design, analysis and implementation. Detailed topics include analysis of best-, average- and worst-case time- and space-complexity; introduction to numerical algorithms; recursion; advanced data structures such as heaps and B-trees; hashing; sorting algorithms; searching algorithms; graph algorithms; and numerical computing.
Assessment: Tutorials and practicals: 30%; Examination (3 hours): 70%.
Contact Hours: One x 2 hr lecture/week, One x 1 hr tutorial/week, One x 1.5 hr lab/week
Prohibitions: CSC2040, CSE2304, DGS2131, RDT2131