APP 4040 Data Structures and Algorithms
Introduction to design and analysis of algorithms. Design techniques: divide-and-conquer, greedy method, dynamic programming; selection of prototypical algorithms; choice of data structures and representations; complexity measures: time, space, upper, lower bounds, asymptotic complexity; NP-completeness. Algorithms and their performance. Data abstraction, queues, linked lists, stacks, trees, graphs, and associated algorithms. Sorting and searching. Implementation of algorithms and data structures in the C++ programming language.
Prerequisites: IST 2020, IST 4070
Credit: 3 units