Course Description

This course provides a comprehensive understanding of fundamental and advanced data structures and algorithms using C++. It is designed to equip students with strong problem-solving skills and the ability to write efficient and optimized code. The course begins with foundational concepts such as complexity analysis and basic data structures, followed by arrays, searching, and sorting techniques. It then progresses to linked lists, stacks, queues, trees, recursion, heaps, hashing, and graph algorithms. A strong emphasis is placed on practical implementation through C++ programming. Students will develop hands-on experience by implementing real-world problems such as expression evaluation, tree traversals, shortest path algorithms, and hashing techniques. By the end of the course, students will be capable of designing efficient algorithms, analyzing their performance, and applying data structures effectively in real-world applications and competitive programming. Analyze time and space complexity of algorithms using asymptotic notations (Big-O, Theta, Omega). Implement and manipulate core data structures such as arrays, linked lists, stacks, and queues using C++. Apply sorting and searching techniques to solve computational problems efficiently. Design and implement tree-based structures including binary trees and binary search trees with traversal techniques. Use recursion and divide-and-conquer strategies such as merge sort and quick sort. Apply advanced concepts like heaps, hashing, and graph algorithms (BFS, DFS, shortest path) to solve real-world problems.