Introduction to Data Structures and Algorithms covers essential data structures like arrays, lists, stacks, queues, sets, maps, and binary trees. In addition, this course covers fundamental algorithms for searching and sorting, and algorithms that use recursive, greedy, backtracking, and dynamic programing techniques. Analysis of basic operations on each structure are discussed and analyzed based on their space and time efficiencies. Writing assignments, as appropriate to the discipline, are part of the course.