Data Structures and Algorithms 1

Catalog description

E- This computer science course introduces students to the design and analysis of data structures and algorithms. Students will learn to perform formal asymptotic analysis and to evaluate the efficiency of algorithms. They will compare and contrast multiple implementations of the list, deque, set, map, and priority queue interfaces, including those based on arrays, linked lists, trees, hashing, and heaps. The course also covers fundamental searching and sorting algorithms.