Free online courseIntroduction to algorithms

Conteúdo do Curso

• Video class: 1. Algorithms and Computation

  0h45m

• Exercise: _What is the usual way of defining a computational problem?

• Video class: 2. Data Structures and Dynamic Arrays

  0h50m

• Video class: Introduction to Algorithms - Problem Session 1: Asymptotic Behavior of Functions and Double-ended...

  1h26m

• Exercise: _What is the purpose of the 6.006 problem sessions?

• Exercise: _Which of the following functions grows asymptotically slower than any polynomial function?

• Video class: 3. Sets and Sorting

  0h52m

• Video class: 4. Hashing

  0h52m

• Exercise: _What is the set interface used for in the context of the lecture?

• Exercise: _What is the model of computation used in this lecture to prove the lower bound on search algorithms?

• Video class: Problem Session 2 (MIT 6.006 Introduction to Algorithms, Spring 2020)

  1h27m

• Video class: 5. Linear Sorting

  0h51m

• Exercise: _What is the problem with the direct access array?

• Exercise: _What is the advantage of using a direct access array?

• Video class: Problem Session 3

  1h26m

• Video class: 6. Binary Trees, Part 1

  0h50m

• Exercise: _What is the data structure that is almost superior to all data structures mentioned in the lecture?

• Exercise: _What is the data structure that is almost superior to all other data structures and can do almost anything really fast?

• Video class: 7. Binary Trees, Part 2: AVL

  0h54m

• Video class: Problem Session 4

  1h29m

• Exercise: _What data structure performs well on dictionary operations but poorly on order operations?

• Video class: 8. Binary Heaps

  0h50m

• Video class: 9. Breadth-First Search

  0h52m

• Exercise: _What is the difference between the set notation and the notation on the screen/board in the context of undirected and directed graphs?

• Video class: Quiz 1 review

  1h25m

• Video class: 10. Depth-First Search

  0h52m

• Exercise: _What is the definition of a graph?

• Exercise: _What are the two algorithms that are almost always seen together in graph theory?

• Video class: 11. Weighted Shortest Paths

  0h57m

• Video class: Problem Session 5

  1h28m

• Exercise: _What is the definition of the radius of a graph in the context of the problem discussed in the lecture?

• Exercise: _What is the eccentricity of a point in a circle?

• Video class: 12. Bellman-Ford

  0h57m

• Video class: Problem Session 6

  1h26m

• Exercise: _What is the purpose of Dijkstra's algorithm?

• Exercise: _What is the purpose of Dijkstra's algorithm?

• Video class: 13. Dijkstra

  0h57m