CMPS 2200 Introduction to Algorithms
Fall 12

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

Slides, pictures

  • Tuesday 9/4/12: officeHours, algorithm, describeAlgorithm, insertionSort1, insertionSort2, best_and_worst_case, compareRuntimes_asymptoticGrowth, runtimeFunction, definition-bigOh, bigOhExamples,
  • Wednesday 9/5/12: bigOhExample-a, bigOhExample-b, OmegaExample, bigOh-Omega-Lemma, definitions-bigOh_Omega_Theta_littleOh, limitTheorem, littleOhExample, OmegaExample2, OmegaExample2_logBases, logs_and_exponentials, codeSnippets, 2nsquaredExample,
  • Monday 9/10/12: Divide-and-conquer slides,
    log-codeSnippet, nlogn-codeSnippet, summationFormulas, height_mergesortRecursionTree, nlogn-induction1, nlogn-induction2, binarySearchRecursionTree, logn-induction, recursionTreeEx1, recursionTreeEx2, logRules,
  • Wednesday 9/12/12: Divide-and-conquer slides II,
    convexHull_tangent, poweringNumber_slow1, poweringNumber_slow2, poweringNumber_slow3, poweringNumber_fast1, poweringNumber_fast2, halvingDecimalNumber, multiplyingIntegerSlow1, multiplyingIntegerSlow2, matrixMultiplication, subdividingMatrix,
  • Monday 9/17/12: Divide-and-conquer slides III, Randomized algorithms slides I,
    logs_epsilon, MasterTheoremCounterEx, mergesortEx, case1Ex, regularityConditionEx, MasterTheoremCounterEx2, StrassenEx, permutations,
  • Wednesday 9/19/12: functions_not_bigOh, sampleSpace_probability, loadedDie, sampleSpace_probabilityEx, probabilityProperties, randomVariable, randomVariableEx, expectedValue, linearityOfExpectation, linearityOfExpectation2, randomizedAlgorithms, deterministicRuntime, randomization, expectedRuntime, expectedRuntime2, expectedRuntime3,
  • Monday 9/24/12: Randomized algorithms slides II,
    quicksortEx, quicksortRecTreeEx, recTreeHeight, Zij, Xij, EXij, zi_zj_comparisons1, zi_zj_comparisons2, probability_zi_zj_compared, EX,
  • Monday 10/1/12: Sorting slides , Order statistics slides ,
    completeBinaryTrees, nFactorial, masterTheorem1, masterTheorem2,
  • Wednesday 10/3/12: Review for test 1 , Graph slides ,
    undirectedGraph, directedGraph, graphExamples, arrayOfArrays, BFS-tree, DFS-tree,
  • Monday 10/8/12: Dijkstra slides
    trees, DFS-tree, DAG, dijkstra_S,
  • Monday 10/15/12: StrassenProject, priorityQueue, priorityQueueImplementations, heapDef, heapExample,
  • Wednesday 10/17/12: juggling, completeBinaryTree1, completeBinaryTree2, heapExample, heapExInsert, heapExExtracMin, heapExDecreaseKey, heapsort, heapifyDown, extractMin_decreaseKey, heapInDijkstra, insert_heapifyUp,
  • Monday 10/22/12: More shortest path slides,
    vertexImplementation, heap,
  • Wednesday 10/24/12: MST slides, annotations,
    MST-Prim, UnionFind,
  • Monday 10/29/12: Amortization slides, Union-Find slides,
    treeTraversal, nodeObject,
  • Wednesday 10/31/12: Review for test 2 , Red-black tree slides,
    binarySearchTree, BST-delete,
  • Monday 11/5/12: B-tree slides
    Additional material: B-trees, different implementations of B-trees,

    numberOfChildren, Btree_height,
  • Monday 11/12/12: Dynamic Programming slides
    recursiveFibonacci, coordinateCSMajor, fibMemoization, LCS_example, LCS_example2,
  • Wednesday 11/14/12: LCS_example, LCS_bottomUp_Code, LCS_recursionTree, makingChange, greedyAlgorithm,
  • Monday 11/19/12: makingChange, makingChangeGreedy, makingChangeOptSubstructure, makingChangeLemma, greedyCorrectness, makingChangeDP, bottomUpDP, knapsack, knapsackGreedy, knapsackDP, knapsackDP2,
  • Monday 11/26/12: All pairs shortest paths slides, P and NP slides,
    project2-fileFormat, boolean_CNF_Formula,
  • Wednesday 11/28/12: transitivity, booleanFormula_classDiagramNP, proveNPcompleteness, HC_TSP, HC_TSP2,
  • Monday 12/3/12: Approximation algorithms notes I, notes II (courtesy of Sariel Har-Peled; relevant sections for Vertex Cover and Set Cover are 6.1 and 7.1; relevant chapter in the book is 5.4)
    dealWithHardProblems, approximationRatio, project2Due, VC-greedyApprox, VC-greedyApproxEx, VC-approx, VC-approxEx, VC-approxTheorem, VC-approxTheorem2, VC-approxTheorem3, TSP_with_triangleInequality, TSP_approx, Euclidean_TSP_Ex,
  • Wednesday 12/5/12: Computational geometry slides, Review for the final exam,
    TSP_2approx-theorem, TSP_2approxEx, TSP_2approxEx2, TSP_2approxEx3, lineSegmentIntersection, officeHours,


    Last modified by Carola Wenk,   cwenk  -at-   tulane  -dot-   edu,