Data Structures Algorithms

This course aims to (i) introduce fundamental concepts, implementations, and applications of essential data structures such as arrays, linked lists, stacks, queues, and trees, which are critical for developing efficient algorithms (ii) provide a foundational understanding of algorithm analysis, including topics like time and space complexity; and (iii) teach the implementation of searching algorithms such as sequential and binary search, hash tables with collision resolution methods, and string search using Tries. These skills are crucial for further studies in computer science and engineering, supporting advanced problem-solving and computational theory in future courses.