Science of programming
K Marriott
4 points * Two 1-hour lectures per week and one 3-hour laboratory per fortnight * First semester * Clayton * Prerequisites: As for CSC2010 * Prohibitions: RDT2131
This subject covers concepts and techniques which are fundamental to the science of programming. Topics include analysis of best, average and worst case time and space complexity; program correctness; recursion; advanced data structures such as heaps and B-trees; sorting algorithms; searching algorithms; and graph algorithms.
Assessment
Examination (2 hours): 75% * Laboratory work: 25% * Compulsory laboratory class attendance
Prescribed texts
Sedgewick R Algorithms in C Addison-Wesley, 1990