CSE1306

Data structures

(IT)

Not offered in 2000

6 points + Three 1-hour lectures per week, one 1-hour tutorial and one 2-hour laboratory class per week + Second semester + Clayton + Prerequisites: CSC1011 or CSC1021 or CSE1301 + Prohibitions: CFR1404, CSC1030, CSE1203, CSE1303, DGS1301, DGS2131, GCO1812, RDT1301, RDT2131, SFT1102

Synopsis: Topics (with particular reference to the C programming language) include problem-solving techniques, algorithm design, data structures, arrays, stacks, queues, lists, linked lists, trees, files, sequential and random access, searching, sorting, analysis of algorithms, and applications such as directories and data structures for hypermedia.

Assessment: Examination (2 hours): 70% + Mid-semester test (1 hour): 10% + Assignments: 10% + Practical examination: 10%