Washington University in St. Louis
CSE 247 covers foundational data structures, algorithm design, and performance analysis. The course focuses on selecting and implementing efficient data structures to solve computational problems at scale. A major emphasis is placed on worst-case asymptotic analysis to evaluate algorithmic efficiency and scalability.
- Algorithm analysis (Big-O, Big-Theta, Big-Omega)
- Recursion and recurrence relations
- Linked lists, stacks, queues
- Trees, heaps, and priority queues
- Hashing and hash table design
- Graph algorithms (search, shortest paths, spanning trees)
- Sorting algorithms and their complexity
- Balanced search trees and advanced structures
- Bi-weekly programming assignments
- Ability to analyze and reason about algorithmic performance
- Understanding trade-offs between data structures
- Implementing efficient solutions in real-world scenarios
- Designing scalable systems through informed data-structure choice