{{courses:cs241-201301:cook.pdf|Cook's Theorem -- CNF-SAT in NP-Complete}}

{{courses:cs241-201301:turingmachine.pdf|The Turing Machine}}  {{courses:cs241-201301:np-complete.pdf|Introduction to NP-Complete}}  

{{courses:cs241-201301:maxflow.pdf|Network Flow (part 1)}}   {{courses:cs241-201301:networkflow2.pdf|Network Flow (part 2)}}

{{courses:cs241-201301:rnafolding.pdf|RNA Folding Algorithm}}  {{courses:cs241-201301:editdistance.pdf|Edit Distance}}
  
{{courses:cs241-201301:dynamicprogramming1.pdf|Dynamic Programming}}  {{courses:cs241-201301:lcslecture.pdf|Longest Common Subsequence}}

{{courses:cs241-201301:prim.pdf|Prim's and Dijkstra's Algorithm}}

{{courses:cs241-201301:greedy.pdf|Greedy Algorithms}}  {{courses:cs241-201301:binaryheap.pdf|Binary Heap}}

{{courses:cs241-201301:graphs.pdf|Graphs}}  ------   {{courses:cs241-201301:graphalgorithms2.pdf|Graphs part 2}}

{{courses:cs241-201301:closest_points.pdf|Examples of Divide and Conquer}}

{{courses:cs241-201301:radixsort.pdf|Radix Sort}}

{{courses:cs241-201301:searchingandsorting.ppt|Searching and Sorting ppt}}

{{courses:cs241-201301:l4sorting.pdf|Analysis of Quicksort}}

{{courses:cs241-201301:mastermethod.pdf|Solving recurrence relations-the master method}}

{{courses:cs241-201301:l1bigo.pdf|Big-Oh Notation}}

{{courses:cs241-201301:thestablemarriageproblem.pdf|Stable Marriage}}