CS 3343 Analysis of Algorithms>
Fall 07

[ Home | Syllabus | Schedule | Slides, pictures | Homework | Resources ]

Slides, pictures

  • Tuesday 9/18/07: Master theorem slides
    mergesort, theta, Omega, divideAndConquer, factorial, solveRecurrence, induction, recTree,
  • Thursday 9/20/07: mergeSortRecTree, mergeSortRecTree2, mergeSortProof, mergeSortProof2, anotherRecTree, anotherRecTree2, summations,
  • Tuesday 9/25/07: Matrix multiplication slides,
    6-1-induction1, 6-1-induction2, 6-1-induction3, 6-1-recTreeEx1, 6-1-recTreeEx2, 6-1-recSquaring, 6-1-recSquaring2, 6-1-matrixMult,
  • Thursday 9/27/07: Quicksort slides,
    6-2-bestcaseRuntime, 6-2-logFormula, 6-2-test1, 6-2-expectedRuntime,
  • Tuesday 10/2/07: 7-1-priorityQueueADT, 7-1-implementations, 7-1-heap, 7-1-heightLemma, 7-1-heightLemma2, 7-1-heapExample, 7-1-storeHeapInArray, 7-1-insert, 7-1-heapExampleInsert, 7-1-extractMax, 7-1-heapExampleExtractMax, 7-1-heapsortInPlace,
  • Tuesday 10/9/07: Sorting slides,
    8-1-test1, 8-1-multRecursiveSlow, 8-1-decisionTree, 8-1-inserstionSort, 8-1-StirlingsFormulaAndCountingsort, 8-1-simplerCountingsort,
  • Thursday 10/11/07: RedBlackTrees slides,
    8-2-deleteFromBST, 8-2-RBTreesHeight, 8-2-rightRotation,
  • Tuesday 10/16/07: 9-1-23tree, 9-1-height, 9-1-insertion, 9-1-insertionExample, 9-1-delete1, 9-1-delete2,
  • Thursday 10/18/07: Dynamic programming slides, 9-2-binomialCoefficient, 9-2-lcsRecursiveCases,
  • Tuesday 10/23/07: 10-1-LCS_with_arrows, 10-1-LCS_recurrence, 10-1-LCS_traceback, 10-1-knapsackDP, 10-1-knapsackRecurrence, 10-1-recurrenceProof, 10-1-knapsackDPExample,
  • Thursday 10/25/07: 10-2-test2, 10-2-greedyVsDP, 10-2-fractionalKnapsackGreedy, 10-2-fractionalKnapsackExample, 10-2-correctnessProof, 10-2-greedyMakingChange, 10-2-makingChangeDPExample, 10-2-greedyCounterexample, 10-2-makingChangeDP,
  • Tuesday 10/30/07: Graphs slides (corrected)
    11-1-graphDef, 11-1-edgeSetSize, 11-1-graphRepresentations, 11-1-DFS_example, 11-1-BFS_example,
  • Thursday 11/1/07: Topological sort slides
    11-2-BFS-example, 11-2-paths, 11-2-heap, 11-2-topSortExample,
  • Tuesday 11/6/07: MST slides
    12-1-MST1, 12-1-MST2,
  • Tuesday 11/13/07: Dijkstra slides
    13-1-test2, 13-1-negativeCycle,
  • Thursday 11/15/07: P and NP slides
    13-2-completeGraphs, 13-2-P-example, 13-2-NP-example, 13-2-subset, 13-2-P_equal_NP,
  • Tuesday 11/20/07: 14-1-P-NP-diagram, 14-1-cliqueIS, 14-1-cliqueISReduction, 14-1-cliqueISInputs, 14-1-fact1, 14-1-booleanFormula, 14-1-vertexCover, 14-1-VC-NPComplete1, 14-1-VC-NPComplete2,
  • Tuesday 11/27/07: 15-1-NP-complete, 15-1-NP-complete2, 15-1-TSPandHC, 15-1-show_TSP_NPcomplete,
  • Thursday 11/29/07: 15-2-final, 15-2-hw10a, 15-2-hw10b,


    Last modified by Carola Wenk,   carola at cs.utsa.edu ,