Skip to main content

Internet Archive's in-browser video "theater" requires JavaScript to be enabled. It appears your browser does not have it turned on. Please see your browser settings for this feature.

play8?>>

MIT 6.006 Introduction to Algorithms, Spring 2020

by: MIT OpenCourseWare

Publication date: 2020

Usage: Attribution-NonCommercial-ShareAlike 4.0 International

Topics: 6.006, data structure, sorting, hashing, binary trees, breadth-first search, depth-first search, weighted shortest path, Bellman-Ford, Dijkstra, dynamic programming, recursion, complexity, algorithms, computational programs, analysis, proofs, Algorithms and Data Structures, Theory of Computation

Language: English

Instructor: Prof. Erik Demaine, Dr. Jason Ku, Prof. Justin Solomon

View the complete course: https://ocw.mit.edu/6-006S20

YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY

This course is an introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems. It emphasizes the relationship between algorithms and programming and introduces basic performance measures and analysis techniques for these problems.

License: Creative Commons BY-NC-SA

More information at https://ocw.mit.edu/terms

More courses at https://ocw.mit.edu

Support OCW at http://ow.ly/a1If50zVRlQ

We encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at https://ocw.mit.edu/comments.

Addeddate: 2021-07-20 14:22:04

Color: color

Identifier: MIT6.006S20

Scanner: Internet Archive HTML5 Uploader 1.6.4

Sound: sound

Year: 2020

plus-circle Add Review

comment
Reviews

There are no reviews yet. Be the first one to write a review.

20,173 Views

21 Favorites

DOWNLOAD OPTIONS

ITEM TILE

MPEG4

102.4M

Lecture 1: Algorithms and Computation

112.5M

Lecture 2: Data Structures and Dynamic Arrays

192.2M

Problem Session 1

118.6M

Lecture 3: Sets and Sorting

117.7M

Lecture 4: Hashing

195.7M

Problem Session 2

114.8M

Lecture 5: Linear Sorting

192.0M

Problem Session 3

113.7M

Lecture 6: Binary Trees, Part 1

120.8M

Lecture 7: Binary Trees, Part 2: AVL

199.3M

Problem Session 4

112.1M

Lecture 8: Binary Heaps

118.4M

Lecture 9: Breadth-First Search

191.0M

117.6M

Lecture 10: Depth-First Search

128.6M

Lecture 11: Weighted Shortest Paths

196.7M

Problem Session 5

128.2M

Lecture 12: Bellman-Ford

192.4M

Problem Session 6

128.2M

Lecture 13: Dijkstra

207.2M

Problem Session 7

126.1M

Lecture 14: APSP and Johnson

181.6M

128.3M

Lecture 15: Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling

131.8M

Lecture 16: Dynamic Programming, Part 2: LCS, LIS, Coins

188.7M

Problem Session 8

141.2M

Lecture 17: Dynamic Programming, Part 3: APSP, Parens, Piano

141.8M

Lecture 18: Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial

131.9M

Lecture 19: Complexity

184.2M

124.4M

Lecture 20: Course Review

132.0M

Lecture 21: Algorithms—Next Steps

SUBRIP

59.2K

Lecture 1: Algorithms and Computation

71.0K

Lecture 2: Data Structures and Dynamic Arrays

125.9K

Problem Session 1

89.4K

Lecture 3: Sets and Sorting

72.3K

Lecture 4: Hashing

152.8K

Problem Session 2

65.7K

Lecture 5: Linear Sorting

129.9K

Problem Session 3

68.0K

Lecture 6: Binary Trees, Part 1

76.2K

Lecture 7: Binary Trees, Part 2: AVL

133.8K

Problem Session 4

71.4K

Lecture 8: Binary Heaps

90.9K

Lecture 9: Breadth-First Search

139.5K

88.2K

Lecture 10: Depth-First Search

66.8K

Lecture 11: Weighted Shortest Paths

138.3K

Problem Session 5

63.1K

Lecture 12: Bellman-Ford

134.3K

Problem Session 6

64.9K

Lecture 13: Dijkstra

152.0K

Problem Session 7

58.5K

Lecture 14: APSP and Johnson

112.3K

83.7K

Lecture 15: Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling

85.3K

Lecture 16: Dynamic Programming, Part 2: LCS, LIS, Coins

130.1K

Problem Session 8

95.3K

Lecture 17: Dynamic Programming, Part 3: APSP, Parens, Piano

93.1K

Lecture 18: Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial

87.0K

Lecture 19: Complexity

106.2K

70.9K

Lecture 20: Course Review

100.8K

Lecture 21: Algorithms—Next Steps

TORRENT

357 Files
69 Original

SHOW ALL

IN COLLECTIONS

MIT OpenCourseWare

Cultural & Academic Films

Uploaded by MIT-OCW on July 20, 2021

SIMILAR ITEMS (based on metadata)

Terms of Service (last updated 12/31/2014)