This subject focuses on the design and analysis of algorithms and the organization of data. Students explore common data structures like arrays, lists, stacks, queues, and trees, learning how to choose the appropriate structure based on the problem. The course also emphasizes algorithm efficiency, introducing Big O notation to analyze time and space complexity.

Lecture Notes