91.404 Analysis of Algorithms

Analysis of Algorithms

Course Details
Min Credits 3
Max Credits 3
Course ID 8095
Status Active

Development of more sophisticated ideas in data type and structure, with an introduction to the connection between data structures and the algorithms they support. Data abstraction. Controlled access structures. Trees, lists, graphs, arrays; algorithms design strategies; backtracking, greedy storage, divide and conquer, branch and bound. Elementary techniques for analysis; recursion equations, estimations methods, elementary combinatorial arguments. Examination of problem areas such as searching, sorting, shortest path, matrix and polynomial operations, and the indicated representations and algorithms. The student will use the techniques learned in this course and in previous courses to solve a number of logically complex programming problems.

Pre/Co-Requisites: Pre-Reqs: 91.102 Computing II, 92.322 Discrete Structures and 92.386 Probability & Statistics I.