17-615 Data Structures and Algorithms
6 units, Carnegie Mellon University
I will, in fact, claim that the difference between a bad programmer and a good one is whether he considers his code or his data structures more important. Bad programmers worry about the code. Good programmers worry about data structures and their relationships. Linus Torvalds The aim of this course is to provide students with a solid foundation in the concepts in the practical application of data structures and algorithms. This course emphasizes the practical application of techniques for writing and analyzing programs data abstraction, algorithm verification, and analysis. This course will teach the students how to select and design data structures and algorithmic approaches that are appropriate for a given problem that they might encounter in practice. Students will learn practical techniques for reasoning about algorithmic correctness, computational complexities, performance, and various other properties and analyze tradeoffs among various algorithmic strategies. This course provides students a broad mixture of theoretical knowledge complemented with numerous opportunities for practical handson experience to apply course concepts.
Prerequisites: none listed
Courseweave needs JavaScript to show sections, workloads and planning tools.