DATA STRUCTURES AND ALGORITHMS
2010/2011, Semester 1
School of Computing (Computer Science)
Modular Credits: 5
This module is the second part of a two-part series on introductory programming from an object-oriented perspective.
It continues the introduction to object-oriented programming begun in CS1101, with an emphasis on data structures and algorithms.
Topics covered include: abstraction and encapsulation for data structures, basic data structures such as lists, stacks, queues,
and their algorithmic designs, various forms of sorting methods, trees, binary search tree, hash tables, order property,
heap and priority queues, graphs representation and basic graph search algorithms (breadth-first search, depth-first search),
and basic algorithmic analysis.
CS1101 (or with relevant equivalent or exemption)
Lectures : Wed 1000-1200 LT19
Fri 1000-1100 LT15
Tutorials: 1 hour per week
Lab sessions: 2 hours per week
Extra help sessions to be conducted, where necessary.
Exam : 22 NOV 2010 Morning
Labs and continuous assessment will play an important part of the course.
Regular attendance of the tutorials is crucial to doing well in the course.
The midterm test and final exam will be closed book while lab assignments and
PE will be open book.
Tutorial Participation 5%
Laboratory Assignments 20%
Mid-Term Tests 20% (2 Quizes)
Practical Exams 15% (2 sittings)
Final Exam 40%
CG1102, CG1103, CS1020, CS1020E, CS1102C, CS1102S. EEE & CPE students are not allowed to take this module