Data Structures and Algorithms

(4 Credits)

This course presents an overview of fundamental data structures, which are commonplace in programming, as well as associated basic algorithms. Complexity analysis, linked lists, stacks, queues, trees, hashing, sorting, and basic graphs algorithms are covered. Core topics such as Floyd's algorithm, minimum spanning tree algorithms, and branch and bound techniques are also covered. Practical lab exercises complement the lectures. The students further specialize and consolidate their knowledge through lab projects to demonstrate the operation and applications of various data structures.