Data Structures CCOM 3034, Fall 2024

Assistant Professor. ~30 students enrolled.

Abstract data types, their efficient implementation, and application to problem-solving. Introduction to the asymptotic analysis of algorithms. Fundamental data structures such as queues, stacks, lists, and trees, their efficient implementation, and applications. Introduction to hash-tables, priority queues, and graphs. Basic sorting and searching methods. Introduction to concurrent data structures. The course has three hours of lecture per week and includes a workshop of one and a half hours per week. In the workshop, students will implement the concepts learned in class.