WF1 SFE MIT 6 046J 18 410J Introduction to Algorithms (SMA 5503)

  • Download 5x Faster
  • Download torrent
  • Direct Download
  • Rate this torrent +  |  -

Torrent info

Name:WF1 SFE MIT 6 046J 18 410J Introduction to Algorithms (SMA 5503)

Total Size: 2.81 GB

Magnet: Magnet Link

Seeds: 0

Leechers: 0

Stream: Watch Full Movie @ Movie4u

Last Updated: 0000-00-00 00:00:00 (Update Now)

Torrent added: 2008-08-16 15:52:55

CyberGhost VPN For Torrents

Torrent Files List

6-046JFall-2005--Lecture Notes--Quizzes.zip (Size: 2.81 GB) (Files: 26)

 6-046JFall-2005--Lecture Notes--Quizzes.zip

8.17 MB

 Text Cover.jpg

59.71 KB

 [10] Red-black Trees, Rotations, Insertions, Deletions--ocw-6.046-19oct2005-220k.rm

134.14 MB

 [11] Augmenting Data Structures, Dynamic Order Statistics, Interval Trees--ocw-6.046-24oct2005-220k(1).rm

134.00 MB

 [12] Skip Lists -- ocw-6.046-26oct2005-220k.rm

136.77 MB

 [13] Amortized Algorithms, Table Doubling, Potential Method -- ocw-6.046-31oct2005-220k.rm

126.58 MB

 [14] Competitive Analysis Self-organizing Lists --ocw-6.046-02nov2005-220k(1).rm

119.32 MB

 [15] Dynamic Programming, Longest Common Subsequence -- ocw-6.046-07nov2005-220k.rm

113.63 MB

 [16] Greedy Algorithms, Minimum Spanning Trees --ocw-6.046-09nov2005-220k(1).rm

134.75 MB

 [17] Shortest Paths I Properties, Dijkstra's Algorithm, Breadth-first Search--ocw-6.046-14nov2005-220k(1).rm

135.42 MB

 [18] Shortest Paths II Bellman-Ford, Linear Programming, Difference Constraints --ocw-6.046-16nov2005-220k(1).rm

123.95 MB

 [19] Shortest Paths III All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson --ocw-6.046-21nov2005-220k(1).rm

119.94 MB

 [1] Analysis of Algorithms, Insertion Sort, Mergesort--ocw-6.046-07sep2005-220k(1).rm

129.06 MB

 [20] Advanced Topics I -- ocw-6.046-05dec2005-220k.rm

120.12 MB

 [21] Advanced Topics II -- ocw-6.046-07dec2005-220k.rm

122.42 MB

 [22] Advanced Topics III--ocw-6.046-12dec2005-220k(1).rm

136.51 MB

 [23] Advanced Topics IV -- Discussion of Follow-on Classes -- ocw-6.046-14dec2005-220k.rm

136.51 MB

 [2] Asymptotic Notation, Recurrences, Master Method, substitution-- ocw-6.046-12sep2005-220k(1).rm

113.60 MB

 [3] Divide-and-Conquer Strassen, Fibonacci, Polynomial Multiplication --ocw-6.046-14sep2005-220k(1).rm

109.99 MB

 [4] Quicksort, Randomized Algorithms --ocw-6.046-21sep2005-220k(1).rm

109.68 MB

 [5] Linear-time Sorting Lower Bounds, Counting Sort, Radix Sort --ocw-6.046-26sep2005-220k(1).rm

122.88 MB

 [6] Order Statistics, Median --ocw-6.046-28sep2005-220k(1).rm

110.15 MB

 [7] Hashing, Hash Functions--ocw-6.046-03oct2005-220k(1).rm

124.53 MB

 [8] Universal Hashing, Perfect Hashing--ocw-6.046-05oct2005-220k(1).rm

127.11 MB

 [9] Relation of BSTs to Quicksort--Analysis of Random BST--ocw-6.046-17oct2005-220k(1).rm

130.19 MB

 [wf1] 100% CLEAN.txt

5.54 KB

Announce URL:

Torrent description

Course Highlights

This course features a complete set of lecture notes and videos in the lecture notes section. Homework assignments with solutions are also available in the assignments section. In addition, an extensive bibliography of assigned and recommended readings is provided in the readings section. The course textbook was co-written by Prof. Leiserson.

Previous versions of this course are also available: Fall 2004, Fall 2001.

Course Description
This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.

This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5503 (Analysis and Design of Algorithms).

related torrents

Torrent name

health leech seeds Size

comments (0)

Main Menu