Data Structures and Algorithms
This is a rigorous course on the design and analysis of efficient algorithms and their associated data structures. Algorithm design methods, graph algorithms, approximation algorithms, and randomized algorithms are covered. The recorded lectures are from the Harvard School of Engineering and Applied Sciences course Computer Science 124. Prerequisites: CSCI E-119, or the equivalent and sound knowledge of discrete mathematics (CSCI E-120, or the equivalent). (4 credits)
There are no frequently asked questions yet. If you have any more questions or need help, contact our customer service.
This is a rigorous course on the design and analysis of efficient algorithms and their associated data structures. Algorithm design methods, graph algorithms, approximation algorithms, and randomized algorithms are covered. The recorded lectures are from the Harvard School of Engineering and Applied Sciences course Computer Science 124. Prerequisites: CSCI E-119, or the equivalent and sound knowledge of discrete mathematics (CSCI E-120, or the equivalent). (4 credits)
There are no frequently asked questions yet. If you have any more questions or need help, contact our customer service.
