This section contains recitation videos and notes. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos 2013-01-22T12:37:16+05:00 MIT OpenCourseWare http://ocw.mit.edu en-US Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation covers asymptotic complexity, recurrences, and peak finding.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: asymptotic complexity, recurrence, peak finding<br><br>Thumbnail - <a href= http://img.youtube.com/vi/P7frcB_-g4w/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec01_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-1-asymptotic-complexity/id585700718?i=126255372>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/P7frcB_-g4w>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-1-asymptotic-complexity-peak-finding Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US asymptotic complexity recurrence peak finding MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation covers the Python cost model and looks at the code for document distance, including main and most functions except count_frequency.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: Python cost model, document distance<br><br>Thumbnail - <a href= http://img.youtube.com/vi/QFcyt8fgQMU/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec02_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-2-python-cost-model/id585700718?i=126255371>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/QFcyt8fgQMU>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-2-python-cost-model-document-distance Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US Python cost model document distance MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation continues to look at versions of the document distance code, and briefly discusses insertion and merge sort.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: document distance, insertion sort, merge sort<br><br>Thumbnail - <a href= http://img.youtube.com/vi/4iXLnF3hExw/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec03_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-3-document-distance/id585700718?i=126255373>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/4iXLnF3hExw>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-3-document-distance-insertion-and-merge-sort Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US document distance insertion sort merge sort MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation starts with a review of recursion trees and recurrences, and then discusses binary search trees.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: merge sort, recursion tree, recurrence, binary search tree, representation invariant, insert, delete<br><br>Thumbnail - <a href= http://img.youtube.com/vi/r5pXu1PAUkI/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec05_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-5-recursion-trees/id585700718?i=126257093>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/r5pXu1PAUkI>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-5-recursion-trees-binary-search-trees Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US merge sort recursion tree recurrence binary search tree representation invariant insert delete MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation covers insertion, deletion, and rebalancing of AVL trees.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: binary search tree, AVL tree, height, rotation, rebalance<br><br>Thumbnail - <a href= http://img.youtube.com/vi/IWzYoXKaRIc/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec06_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-6-avl-trees/id585700718?i=126257028>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/IWzYoXKaRIc>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-6-avl-trees Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US binary search tree AVL tree height rotation rebalance MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation starts with a review of comparison sorting methods, and then discusses counting sort and radix sort.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: sorting methods, comparison sort, counting sort, radix sort, stable sort<br><br>Thumbnail - <a href= http://img.youtube.com/vi/9bkvws_vqLU/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec07_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-7-comparison-sort/id585700718?i=126257091>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/9bkvws_vqLU>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-7-comparison-sort-counting-and-radix-sort Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US sorting methods comparison sort counting sort radix sort stable sort MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation discusses the first problem from Problem Set 3, covering sweep-line algorithms and range queries.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: sweep-line algorithm, range index, comparison model, range queries, binary search tree, LCA, lowest common ancestor<br><br>Thumbnail - <a href= http://img.youtube.com/vi/eGSXsaJ-BlY/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec08_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-8-simulation-algorithms/id585700718?i=126257094>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/eGSXsaJ-BlY>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-8-simulation-algorithms Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US sweep-line algorithm range index comparison model range queries binary search tree LCA lowest common ancestor MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation mostly covers rolling hashes, with a short discussion of amortized analysis at the end.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: rolling hash, amortized analysis, pre-hashing, good hash function, bad hash function<br><br>Thumbnail - <a href= http://img.youtube.com/vi/w6nuXg0BISo/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec09_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-9-rolling-hashes/id585700718?i=126257090>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/w6nuXg0BISo>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-9-rolling-hashes-amortized-analysis Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US rolling hash amortized analysis pre-hashing good hash function bad hash function MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation starts with a short discussion of hashing, and then discusses problem set code for most of the hour. Amortized analysis is also discussed briefly.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: DNA sequence, sequence matching, Python iterator, Python generator, aggregate analysis, cost method<br><br>Thumbnail - <a href= http://img.youtube.com/vi/-DwGrJ8JxDc/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec09b_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-9b-dna-sequence/id585700718?i=126257095>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/-DwGrJ8JxDc>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-9b-dna-sequence-matching Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US DNA sequence sequence matching Python iterator Python generator aggregate analysis cost method MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation covers several practice problems for Quiz 1, taken from previous semesters of 6.006.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: recurrence, recursion tree, decision tree, Rabin-Karp, divide and conquer, asymptotic complexity, order of growth<br><br>Thumbnail - <a href= http://img.youtube.com/vi/-FElVPKykgw/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec10_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-10-quiz-1-review/id585700718?i=126257092>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/-FElVPKykgw>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-10-quiz-1-review Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US recurrence recursion tree decision tree Rabin-Karp divide and conquer asymptotic complexity order of growth MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation discusses principles of algorithm design, using example problems from previous final exams.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: data structure, recursion, runtime, median, rotated array, min heap, kth smallest element, partial maxima<br><br>Thumbnail - <a href= http://img.youtube.com/vi/a_otxyu0mSQ/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec11_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-11-principles-algorithm/id585700718?i=126257029>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/a_otxyu0mSQ>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-11-principles-of-algorithm-design Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US data structure recursion runtime median rotated array min heap kth smallest element partial maxima MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation briefly discusses Karatsuba multiplication, then covers Newton's method.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: numerics, Karatsuba multiplication, partial products, Newton's method, successive approximation<br><br>Thumbnail - <a href= http://img.youtube.com/vi/JRgIXyEPnbA/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec12_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-12-karatsuba-multiplication/id585700718?i=126258170>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/JRgIXyEPnbA>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-12-karatsuba-multiplication-newtons-method Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US numerics Karatsuba multiplication partial products Newton's method successive approximation MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation starts with a discussion of Problem Set 5, and then covers graph representations and breadth-first search.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: graph, handshaking lemma, graph representation, adjacency matrix, adjacency list, breadth first search, BFS, queue<br><br>Thumbnail - <a href= http://img.youtube.com/vi/5JxShDZ_ylo/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec13_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-13-breadth-first/id585700718?i=126258172>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/5JxShDZ_ylo>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-13-breadth-first-search-bfs Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US graph handshaking lemma graph representation adjacency matrix adjacency list breadth first search BFS queue MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation covers depth-first search and DFS edge classification.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: depth first search, DFS, edge classification, directed acyclic graph, topological sort<br><br>Thumbnail - <a href= http://img.youtube.com/vi/C5SPsY72_CM/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec14_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-14-depth-first/id585700718?i=126258171>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/C5SPsY72_CM>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-14-depth-first-search-dfs Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US depth first search DFS edge classification directed acyclic graph topological sort MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation covers breadth-first search for shortest paths.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: shortest path, breadth first search, BFS, graph transformation<br><br>Thumbnail - <a href= http://img.youtube.com/vi/mQSp6VmfakA/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec15_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-15-shortest-paths/id585700718?i=126258149>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/mQSp6VmfakA>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-15-shortest-paths Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US shortest path breadth first search BFS graph transformation MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation discusses the Rubik's cube problem from Problem Set 6, and then uses a graph model to find an optimal build order for a simplified version of the StarCraft game.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: Rubik's cube, permutations, implicit graph representation, StarCraft Zero, graph model, Dijkstra<br><br>Thumbnail - <a href= http://img.youtube.com/vi/oRpERQA4Vik/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec16_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-16-rubiks-cube/id585700718?i=126258173>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/oRpERQA4Vik>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-16-rubiks-cube-starcraft-zero Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US Rubik's cube permutations implicit graph representation StarCraft Zero graph model Dijkstra MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation reviews numerics and graphs in preparation for Quiz 2.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: numerics, Newton's method, BFS, DFS, topological sort, shortest paths, Dijkstra<br><br>Thumbnail - <a href= http://img.youtube.com/vi/sPuazUPiV1k/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec18_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-18-quiz-2-review/id585700718?i=126258661>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/sPuazUPiV1k>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-18-quiz-2-review Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US numerics Newton's method BFS DFS topological sort shortest paths Dijkstra MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation uses dynamic programming to find subsequences in the card game Crazy Eights, and to find the shortest path in a graph.</p> <p><strong>Instructor:</strong> Victor Costan</p>Thumbnail - <a href= http://img.youtube.com/vi/IFrvgSvZA0I/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec19_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-19-dynamic-programming/id585700718?i=126258658>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/IFrvgSvZA0I>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-19-dynamic-programming-crazy-eights-shortest-path Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation revisits the perfect-information blackjack problem that was covered in lecture.</p> <p><strong>Instructor:</strong> Victor Costan</p>Thumbnail - <a href= http://img.youtube.com/vi/jZbkToeNK2g/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec20_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-20-dynamic-programming/id585700718?i=126258662>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/jZbkToeNK2g>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-20-dynamic-programming-blackjack Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation discusses the knapsack problem and polynomial time vs. pseudo-polynomial time.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: dynamic programming, knapsack problem, polynomial time, pseudo-polynomial time, Dijkstra, computation model<br><br>Thumbnail - <a href= http://img.youtube.com/vi/wFP5VHGHFdk/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec21_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-21-dynamic-programming/id585700718?i=126258660>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/wFP5VHGHFdk>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-21-dynamic-programming-knapsack-problem Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US dynamic programming knapsack problem polynomial time pseudo-polynomial time Dijkstra computation model MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation looks at player positions in the Dance Dance Revolution game, along the lines of the guitar fingering example shown in lecture.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: dynamic programming, DDR, dance dance revolution, DAG, shortest path<br><br>Thumbnail - <a href= http://img.youtube.com/vi/PptQgy89cN8/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec22_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-22-dynamic-programming/id585700718?i=126258663>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/PptQgy89cN8>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-22-dynamic-programming-dance-dance-revolution Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US dynamic programming DDR dance dance revolution DAG shortest path MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation reviews the computational complexity concepts presented in lecture.</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: computational complexity, polynomial, P, NP, NP complete, reduction, SAT, satisfiability, verifier<br><br>Thumbnail - <a href= http://img.youtube.com/vi/t5Wxk96QjUk/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec23_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-23-computational/id585700718?i=126258659>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/t5Wxk96QjUk>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-23-computational-complexity Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US computational complexity polynomial P NP NP complete reduction SAT satisfiability verifier MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm <p><strong>Description:</strong> This recitation covers the wood-cutting problem (dynamic programming) and Bloom filters (hashing, probability).</p> <p><strong>Instructor:</strong> Victor Costan</p>Keywords: wood cutting problem, dynamic programming, hashing, hash function, probability, Bloom filter<br><br>Thumbnail - <a href= http://img.youtube.com/vi/hkAONP0aC9w/default.jpg>JPG (YouTube)</a><br>Video - download: <a href= http://www.archive.org/download/MIT6.006F11/MIT6_006F11_rec24_300k.mp4>Internet Archive (MP4)</a><br>Video - download: <a href= https://itunes.apple.com/us/itunes-u/recitation-24-final-exam-review/id585700718?i=126258657>iTunes U (MP4)</a><br>Video - stream: <a href= http://www.youtube.com/v/hkAONP0aC9w>YouTube </a><br><br><a href= 'http://ocw.mit.edu/terms/'>(CC BY-NC-SA)</a><br><br> http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/recitation-videos/recitation-24-final-exam-review Demaine, Erik Devadas, Srinivas 2013-01-14T15:18:27+05:00 en-US wood cutting problem dynamic programming hashing hash function probability Bloom filter MIT OpenCourseWare http://ocw.mit.edu Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htm