This course aims to provide students an appreciation to the fundamentals of computer science.  Models and applications of data structures including heaps, search trees, hash tables and disjoint sets are introduced and evaluated.  Mathematical tools for analysis of algorithms and data structures are discussed and applied.  Students are given the opportunity to develop and implement applications of the data structures and their derivatives.

For a student to pass the course, at least 40% of the maximum mark for the continuous assessment and 30% of the maximum mark for the examination must be obtained.