Algorihms and Data Structure (COMP211)
Complexity measure. Asymptotic notation. Time-space trade-off. A study of fundamental strategies used in design of algorithm classes including divide and concur, recursion, search and traversal. Backtracking. Branch and bound techniques. Analysis tools and techniques for algorithms. NP-complete problems. Approximation algorithms. Introduction to parallel and fast algorithms. Primitive data structures Linear data structures: stacks, queues, deques and their application. Concept of linking, linked lists. Non-linear data structures: trees, graphs. Algorithmic implementation of data structures.