Introduction to Algorithms
Course Highlights
Course Description
Technical Requirements
Special software is required to use some of the files in this course: .tex, .py, .rb, and .zip.
Important Notes : -
It is a collection of lectures notes not ours. Our subjective is to help students to find all engineering notes with different lectures PowerPoint slides in ppt ,pdf or html file at one place. Because we always face that we lose much time by searching in google or yahoo like search engines to find or downloading a good lecture notes in our subject area with free. Also it is difficult to find popular authoress or books slides with free of cost. If you find any copyrighted slides or notes then please inform me immediately by comments or email as following address .I will take actions to remove it. Please Click bellow to download ppt slides/ pdf notes. If you face any problem in downloading or if you find any link not correctly work or if you have any idea to improve this blog/site or if you find any written mistake or you think some subjects notes should be include then give your suggestion as comment by clicking on comment link bellow the post (bottom of page) or email us in this address engineeringppt.blogspot@gmail.com?subject=comments on engineeringppt.blogspot.com. I will must consider your comments only within 1-2 days. if you have any good class notes/lecture slides in ppt or pdf or html format then please you upload these files to rapidshare.come and send us links or all files by our email address engineeringppt.blogspot@gmail.com?subject=comments on engineeringppt.blogspot.com.
To find your notes quickly please see the contents on the right hand side of this page which is alfabeticaly arranged and right click on it. After clicking immediately you find all the notes ppt/pdf/html/video of your searching subjects.
It is better to serch your subject notes by clicking on search button which is present at middle of right side of this web page.Then enter your subject and press enter key then you can find all of your lectures notes and click on it.
Thank you for visiting our site.........
Click Below to Download the files :-
Lecture Notes
Special software is required to use some of the files in this section: .py and .zip.
The lecture notes in this section were transcribed from the professors' handwritten notes by graduate student Pavitra Krishnaswamy. The handwritten notes can be found on the Lectures and Recitations page of the original 6.006 Web site.
| LEC # | TOPICS | SUPPORTING FILES |
|---|---|---|
| Introduction and document distance | ||
| L1 | Introduction and document distance (PDF) | Document distance(docdist{1,2,3,4}.py) |
| L2 | More document distance, mergesort (PDF) | Document distance (docdist{5,6}.py) |
| Binary search trees | ||
| L3 | Airplane scheduling, binary search trees (PDF - 1.4 MB) | Binary search trees (including code) |
| L4 | Balanced binary search trees (PDF - 1.2 MB) | See binary search trees for AVL code |
| Hashing | ||
| L5 | Hashing I: chaining, hash functions (PDF) | Document distance (docdist-dict.py) |
| L6 | Hashing II: table doubling, Karp-Rabin (PDF) | |
| L7 | Hashing III: open addressing (PDF - 1.1 MB) | |
| Sorting | ||
| L8 | Sorting I: heaps (PDF - 1.0 MB) | |
| L9 | Sorting II: heaps (PDF) | |
| L10 | Sorting III: lower bounds, linear-time sorting (PDF) | |
| L11 | Sorting IV: stable sorting, radix sort (PDF - 1.0 MB) | |
| Searching | ||
| L12 | Searching I: graph search, representations, and applications (PDF - 1.6 MB) | Simple Python code for graphs (PY) |
| L13 | Searching II: breadth-first search and depth-first search (PDF - 1.3 MB) | |
| L14 | Searching III: topological sort and NP-completeness (PDF) | |
| Shortest paths | ||
| L15 | Shortest paths I: intro (PDF - 1.0 MB) | |
| L16 | Shortest paths II: Bellman-Ford (PDF - 1.1 MB) | |
| L17 | Shortest paths III: Dijkstra (PDF) | |
| L18 | Shortest paths IV: Dijkstra speedups (PDF - 1.2 MB) | |
| Dynamic programming | ||
| L19 | Dynamic programming I: memoization, Fibonacci, Crazy Eights, guessing (PDF) | |
| L20 | Dynamic programming II: longest common subsequence, parent pointers (PDF) | |
| L21 | Dynamic programming III: text justification, parenthesization, knapsack, pseudopolynomial time, Tetris training (PDF) | |
| L22 | Dynamic programming IV: piano fingering, structural DP (trees), vertex cover, dominating set, and beyond (PDF) | |
| Numerics | ||
| L23 | Numerics I (PDF) | Demos: square root of 2, chord length Source code (ZIP) (This zip file includes: 14 .js files, 2 .html files, 1 .css file, and 1 .project file.) |
| L24 | Numerics II (PDF) | |
No comments:
Post a Comment