API tools faq
paste
icuongpv

Stanford Open Classrooms - Design and Analysis of Algorithms

icuongpv
Aug 19th, 2012
256
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 9.15 KB | None | 0 0
raw download clone embed print report
  1. Stanford Open Classrooms - Design and Analysis of Algorithms 2011
  2. http://i.imgur.com/eyPBy.jpg
  3.  
  4. ******************************************************************
  5.  
  6. »| ********* »| Visit & Download this Album: |» ******* »|
  7.  
  8. http://LosslessAlbum.net
  9. http://downexpress.net
  10. http://ebookez.me
  11.  
  12. ********* »| Well Come |» *******
  13.  
  14. ******************************************************************
  15. Stanford Open Classrooms - Design and Analysis of Algorithms 2011
  16. 2011 | English | 12.85 GB | DVD
  17. Download ID: TNBU00362
  18. Genre: E-Learning
  19. Free Download - Single Extraction - No Password
  20.  
  21. Course Overview: Introduction to basic techniques for design and analysis of algorithms, including asymptotic analysis, divide and conquer algorithms and recurrences, greedy algorithms, data structures, dynamic programming, graph algorithms and randomized algorithms.
  22.  
  23. REQUIRED TEXTBOOK: Kleinberg and Tardos, Algorithm Design, 2005. We will cover most of Chapters 4-6, parts of Chapter 13, and a couple of topics that had not the book.
  24.  
  25. Prerequisites: Introduction to evidence and discrete mathematics and probability (eg, CS 103 and Stat116). If you have not taken a course in probability, you should expect to do independent reading during the race on topics such as random variables, expectation, conditioning, and basic combinatorics.
  26.  
  27. 1. INTRODUCTION (1/4/2011)
  28. Why are you here
  29. Example: Internet Routing
  30. Shortest-Path Algorithms
  31. Example: Sequence Alignment (Part 1)
  32. Example: Sequence Alignment (Part 2)
  33. Beating Brute Force Search
  34. Administrivia
  35. Recursive Algorithms for Integer Multiplication
  36. Gauss's Trick
  37.  
  38. 2. BASIC DIVIDE, and CONQUER (1/6/2011)
  39. Merge Sort: Motivation
  40. Merge Sort: Formal Definition
  41. Running Time of Merge
  42. Running Time of Merge Sort (Part 1)
  43. Running Time of Merge Sort (Part 2)
  44. Guiding Principles of CS161 (Part 1)
  45. Guiding Principles of CS161 (Part 2)
  46. Review of Asymptotic Notation
  47. Asymptotic Notation: Example #1
  48. Asymptotic Notation: Example #2
  49. Big-Omega, and Big-Theta
  50.  
  51. 3. THE MASTER METHOD (1/11/2011)
  52. Integer Multiplication Revisited
  53. Master Method: Formal Statement (Part 1)
  54. Master Method: Formal Statement (Part 2)
  55. Master Method: Examples
  56. Proof of Master Method (Part 1)
  57. Proof of Master Method (Part 2)
  58. Master Method: Interpretation of the Three Cases
  59. Proof of Master Method (Part 3)
  60.  
  61. 4. LINEAR-TIME MEDIAN (1/13/2011) - We apologize for the poor audio quality in this video.
  62. The Selection Problem
  63. Partitioning Around a Pivot
  64. A Generic Selection Algorithm
  65. Median of Medians
  66. Recap
  67. Rough Recurrence
  68. Key Lemma (Part 1)
  69. Key Lemma (Part 2)
  70. The Substitution Method
  71. Analysis of Rough Recurrence
  72.  
  73. 5. GRAPH SEARCH, and DIJKSTRA'S ALGORITHM (1/18/2011)
  74. Graph Primitives
  75. Representing Graphs: Adjacency Matrices, and Lists
  76. Breadth-First, and Depth-First Search
  77. Dijkstra's Algorithm (Part 1)
  78. Dijkstra's Algorithm (Part 2)
  79. Dijkstra's Algorithm: Example
  80. Dijkstra's Algorithm: Proof of Correctness (Part 1)
  81. Dijkstra's Algorithm: Proof of Correctness (Part 2)
  82. Undirected Connectivity
  83.  
  84. 6. CONNECTIVITY IN DIRECTED GRAPHS (1/20/2011)
  85. Strongly Connected Components
  86. SCCs: A Two-Pass Algorithm
  87. Depth-First Search Revisited
  88. Example (Part 1)
  89. Example (Part 2)
  90. Two-Tier Structure of Directed Graphs
  91. Correctness of Algorithm
  92. Correctness Intuition
  93. Proof of Key Lemma
  94. Structure of the Web, Small World Property, and PageRank
  95.  
  96. 7. INTRODUCTION TO GREEDY ALGORITHMS (1/25/2011)
  97. Course Roadmap
  98. Application, and Final Exam Info
  99. A Scheduling Problem
  100. Two Greedy Algorithms
  101. Correctness Proof
  102. Cost-Benefit Analysis
  103.  
  104. 8. MINIMUM SPANNING TREES (1/27/2011)
  105. Introduction
  106. Prim's Algorithm
  107. Graph Theory Preliminaries
  108. Feasibility of Prim's Algorithm
  109. The Cut Property
  110. Proof of Cut Property
  111. Key Exchange Argument
  112. Naive Running Time, and Heap Review
  113. Implementing Prim with Heaps (Part 1)
  114. Implementing Prim with Heaps (Part 2)
  115. New Running Time Analysis
  116.  
  117. 9. KRUSKAL'S ALGORITHM AND UNION-FIND (2/1/2011)
  118. Kruskal's Algorithm
  119. Proof of Correctness (Part 1)
  120. Proof of Correctness (Part 2)
  121. Naive Running Time
  122. Union-Find Data Structure
  123. Union by Rank
  124. Rank, and Size of Subtrees
  125. Open Research Question
  126. Path Compression
  127. Path Compression, and the Ackermann Function
  128.  
  129. 10. PATH COMPRESSION AND CLUSTERING (2/3/2011)
  130. Union-Find Review
  131. Path Compression
  132. Rank Blocks
  133. Counting Pointer Updates
  134. Clustering
  135. A Greedy Algorithm
  136. Correctness of Greedy Algorithm (Part 1)
  137. Correctness of Greedy Algorithm (Part 2)
  138.  
  139. 11. INTRODUCTION TO RANDOMIZED ALGORITHMS (2/8/2011)
  140. The Min Cut Problem
  141. The Contraction Algorithm
  142. Probability Review
  143. Analysis of Contraction Algorithm
  144. Success Through Independent Trials
  145. Final Comments
  146.  
  147. 12. QUICKSORT (2/10/2011)
  148. The QuickSort Algorithm
  149. Best-Case, and Worst-Case Pivots
  150. Running Time of Randomized QuickSort
  151. Probability Review Part 2
  152. Linearity of Expectation
  153. Counting Comparisons
  154. Crux of Proof
  155. Final Calculations
  156. Lower Bound of Comaprison-Based Sorting
  157.  
  158. 13. HASHING (2/15/2011)
  159. Hashing: Introduction
  160. Hashing: High-Level Idea
  161. Running Time
  162. How to Analyze Hashing
  163. Universal Hashing
  164. Proof of O(1) Running Time
  165. A Universal Family
  166. Universality: Proof Idea
  167. Bloom Filters
  168.  
  169. 14. BALANCED SEARCH TREES AND SKIP LISTS (2/17/2011)
  170. Review of Binary Search Trees
  171. Deleting from a BST
  172. Red-Black Trees
  173. Height of Red-Black Trees
  174. Rotations
  175. Insertion to a Red-Black Tree
  176. Skip Lists: High-Level Idea
  177. Skip Lists: Intuition for Analysis
  178.  
  179. 15. INTRODUCTION TO DYNAMIC PROGRAMMING (2/22/2011)
  180. Dynamic Programming: A First Example
  181. Structure of Optimal Solution
  182. A Recursive Algorithm
  183. Bottom-Up Formulation
  184. Reconstruction Algorithm
  185. The Knapsack Problem
  186. Dynamic Programming Solution
  187.  
  188. 16. SEQUENCE ALIGNMENT (2/24/2011)
  189. Sequence Alignment
  190. Optimal Substructure
  191. Dynamic Programming Solution
  192. Dynamic Programming Algorithm
  193. Shortest Paths with Negative Edge Lengths
  194. On Negative Cycles
  195. Optimal Substructure (Part 1)
  196. Optimal Substructure (Part 2)
  197.  
  198. 17. SHORTEST PATHS: BELLMAN-FORD AND FLOYD-WARSHALL (3/1/2011)
  199. Single-Source Shortest Paths Revisited
  200. The Bellman-Ford Algorithm
  201. Negative Cycle Checking
  202. Space Optimization
  203. The Floyd-Warshall Algorithm (Part 1)
  204. The Floyd-Warshall Algorithm (Part 2)
  205. Dynamic Programming Algorithm
  206.  
  207. 18. NP-COMPLETE PROBLEMS (3/3/2011)
  208. Polynomial Time Algorithms, and P
  209. The Traveling Salesman Problem
  210. Reductions
  211. Completeness
  212. NP-Completeness
  213. Many Problems are NP-Complete
  214. Does P=NP
  215. Coping with NP-Completeness
  216. The Vertex Cover Problem
  217. Smarter Brute-Force Search
  218.  
  219. 19. APPROXIMATION ALGORITHMS (3/8/2011)
  220. Performance Guarantees for Heuristics
  221. A Greedy Knapsack Algorithm
  222. Proof of Performance Guarantee
  223. Final Exam Info
  224. Better Performance via Dynamic Programming
  225. Accuracy Analysis
  226. Running Time Analysis
  227.  
  228. 20. THE WIDER WORLD OF ALGORITHMS (3/10/2011)
  229. Bipartite Matching
  230. Stable Matching
  231. Gale-Shapley Proposal Algorithm
  232. Maximum Flow
  233. Selfish Flow, and Braess's Paradox
  234. Linear Programming
  235. Computational Geometry
  236. Approximation, and Randomized Algorithms
  237. Complexity, and Epilogue
  238.  
  239.  
  240. RyuShare.to Links:
  241. http://ryushare.com/54ac886e15b9/Design.and.Analysis.of.Algorithms.part01.rar
  242. http://ryushare.com/444d94d319fd/Design.and.Analysis.of.Algorithms.part02.rar
  243. http://ryushare.com/29ed7e20d8f9/Design.and.Analysis.of.Algorithms.part03.rar
  244. http://ryushare.com/567e31b83635/Design.and.Analysis.of.Algorithms.part04.rar
  245. http://ryushare.com/54ac886e15b5/Design.and.Analysis.of.Algorithms.part05.rar
  246. http://ryushare.com/54ac886e15b4/Design.and.Analysis.of.Algorithms.part06.rar
  247. http://ryushare.com/453669782ae2/Design.and.Analysis.of.Algorithms.part07.rar
  248. http://ryushare.com/55955d1325ab/Design.and.Analysis.of.Algorithms.part08.rar
  249. http://ryushare.com/27330031a7f6/Design.and.Analysis.of.Algorithms.part09.rar
  250. http://ryushare.com/427beb88fab4/Design.and.Analysis.of.Algorithms.part10.rar
  251. http://ryushare.com/2904a97bc9c9/Design.and.Analysis.of.Algorithms.part11.rar
  252. http://ryushare.com/4364c02e09a1/Design.and.Analysis.of.Algorithms.part12.rar
  253. http://ryushare.com/4364c02e099f/Design.and.Analysis.of.Algorithms.part13.rar
  254. http://ryushare.com/54ac886e15b1/Design.and.Analysis.of.Algorithms.part14.rar
  255. http://ryushare.com/4364c02e099c/Design.and.Analysis.of.Algorithms.part15.rar
  256. http://ryushare.com/29ed7e20d8d6/Design.and.Analysis.of.Algorithms.part16.rar
  257. http://ryushare.com/567e31b83632/Design.and.Analysis.of.Algorithms.part17.rar
  258. http://ryushare.com/2904a97bc9c1/Design.and.Analysis.of.Algorithms.part18.rar
  259. http://ryushare.com/54ac886e15ae/Design.and.Analysis.of.Algorithms.part19.rar
  260. http://ryushare.com/5767065d45dc/Design.and.Analysis.of.Algorithms.part20.rar
  261. http://ryushare.com/2904a97bc9a7/Design.and.Analysis.of.Algorithms.part21.rar
  262. http://ryushare.com/4364c02e0999/Design.and.Analysis.of.Algorithms.part22.rar
  263. http://ryushare.com/5767065d45e3/Design.and.Analysis.of.Algorithms.part23.rar
  264. http://ryushare.com/444d94d319f0/Design.and.Analysis.of.Algorithms.part24.rar
  265. http://ryushare.com/5767065d45e4/Design.and.Analysis.of.Algorithms.part25.rar
  266. http://ryushare.com/53c3b3c90438/Design.and.Analysis.of.Algorithms.part26.rar
  267. http://ryushare.com/256156e78a28/Design.and.Analysis.of.Algorithms.part27.rar
  268. http://ryushare.com/40aa423ed9db/Design.and.Analysis.of.Algorithms.part28.rar
Advertisement
Add Comment
Please, Sign In to add comment
Public Pastes
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!