CST-201: Algorithms and Data Structures

The curriculum covers essential concepts in classical algorithms and data structures, with an emphasis on implementation and application in solving real-world computational problems. The course focuses on algorithms for sorting, searching, string processing, and graphs. Students learn basic strategies to evaluate divide-and-conquer, recursive backtracking, and algorithm efficiency. Hands-on activities focus on writing code that implements concepts and algorithm implementation techniques.

• Asymptotic time and space complexity analysis (Big-O, Big-Omega) applied to operations in CST-201
• Linear and non-linear data structures: balanced search trees (AVL, Red-Black), heaps, and hash map collision resolution
• Graph representations (adjacency list/matrix) and traversals: BFS, DFS, and shortest path algorithms in Algorithms and Data Structures
• Advanced data structure design: union-find disjoint sets, tries, and priority queue implementations