Authorised by Academic Registrar, April 1996
Objectives On completion of the subject students should be able to write and debug small (<= 1000 line) C programs to solve realistic problems using realistic data structures and algorithms.
Synopsis This subject discusses 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