(3 units). The concept of abstract data types. Simple methods of complexity analysis. Trees. The search problem: balanced trees, binary-trees, hashing. Sorting. Graphs and simple graph algorithms: traversal, minimum spanning tree. Strings and pattern matching. Course Component: Laboratory, Lecture, Tutorial Prerequisites: ITI 1121, MAT 1348.
(3 units). The concept of abstract data types. Simple methods of complexity analysis. Trees. The search problem: balanced trees, binary-trees, hashing. Sorting. Graphs and simple graph algorithms: traversal, minimum spanning tree. Strings and pattern matching. Course Component: Laboratory, Lecture, Tutorial Prerequisites: ITI 1121, MAT 1348.
