Course Catalog
Data Structures and Algorithms for Information Processing
95-771
Units: 12
Description
95-771 Data Structures and Algorithms for Information Processing
95-771 is a one-semester, 12-unit course covering the fundamental data structures and algorithms used in information processing. The course uses Python to illustrate algorithmic and data structure concepts, and students complete programming assignments in Python. Emphasis is placed on the design, implementation, analysis, and application of data structures and algorithms, including asymptotic analysis and algorithmic problem solving. Students are often required to implement data structures themselves rather than rely on Python's built-in implementations. Prior programming experience is required; prior experience with Python is helpful but not required. This course is not intended as an introduction to programming or to the Python language.
Learning Outcomes
At the completion of this course the student will be able to:
1. Design or select an appropriate algorithm for a particular problem.
2. Design or select an appropriate data structures for a particular problem.
3. Write programs that make good use of stacks, queues, linked lists, trees, graphs, and hash tables.
4. Analyze the runtime performance of algorithms in terms of Big O, Big Omega, and Big Theta notation.
5. Understand worse case, best case, average case and amortized analysis.
6. Understand the distinction between algorithm correctness and performance.
7. Understand the theory of NP-completeness.
8. Differentiate between problems that are computable and those that are not.
Prerequisites Description
95-896, 95-895, or permission of the Instructor.