CS 3343 Analysis of Algorithms>
Fall 10
[ Home | Policies | Schedule | Slides, pictures | Homework | Resources ]

Slides, pictures

  • Tuesday 8/26/10: analysisOfAlgorithms, describeAlgorithm, insertionSortExProblemDef, insertionSortExDescription, insertionSortExPseudoCode, insertionSortExCorrectnesProof1, insertionSortExCorrectnesProof2,
  • Tuesday 8/31/10: announcement, insertionSortRuntime, insertionSortBestCaseRuntime, insertionSortWorstCaseRuntime, asymptoticNotation, runtimesAsFunctions, bigOhDef, bigOhEx1, bigOhEx2, OhOmegaThetaDefinitions, OhOmegaLemma,
  • Thursday 9/2/10: proofsBackwardReasoning, proofsForwardReasoning, wrongProof, wrongProof2, OmegaEx, ThetaEx, limitTheorem, Oh_Omega_Theta_o_definitions, limitTheoremEx1, limitTheoremEx2, logs, codeSnippets,
  • Tuesday 9/7/10: codeSnippet, codeSnippet2, summations, heapExample, heaps, heaps2, heapOperations, heightLemmas, insert, insertEx, insertCorrectness, extractMax, extractMaxEx, heapifyDown, heapsort,
  • Thursday 9/9/10: Mergesort slides
    extractMaxCorrectness, buildHeap, buildHeapRuntime, buildHeapRuntime2, buildHeapRuntime3, mergesortSubstitutionMethod, mergesortSubstitutionMethod2, mergesortSubstitutionMethod3, mergesortSubstitutionMethod4,
  • Tuesday 9/14/10: factorialRecursiveCode, factorialRuntimeRecurrence, factorialRuntimeRecurrenceExpansionMethod, factorialRecurrenceInduction, divideAndConquer, binarySearch, binarySearchRecursionTree, binarySearchBigOhInduction, binarySearchBigOhInduction2, binarySearchBigOhInduction3, recurrence, recursionTree, totalRuntime,
  • Thursday 9/16/10: Master Theorem slides, More Divide and Conquer slides
    masterTheorem-WhatToCompare, case3Ex, case2Ex, case2Ex-2, case2Ex-binarySearch, case1Ex, case1Ex-2, case3Ex-2, case3Ex-2-continued, repeatedSquaring, recursiveSquaringBadImplementation,
  • Tuesday 9/21/10: announcements, matrixMultEx, matrixMultFormula, recursiveMatrixMultEx, recursiveMatrixMultEx2, recursiveMatrixMultEx3, pseudoCodeDraft,
  • Thursday 9/23/10: rollTwoDice, event, rollTwoDiceEvent, uniformProbability, lawsOfProbability, randomVariable, randomVariableEx, expectedValue1, expectedValue2, expectedValue3, linearityOfExpectation1, linearityOfExpectation2, linearityOfExpectation3,
  • Tuesday 9/28/10: Midterm Review, Study problems for midterm 1
    deterministicAlgorithms, randomizedAlgorithms, hireAssistant, runtime, runtimeWorstCaseBestCase, runtimeExample, randomizingHireAssistant, inputs, sampleSpace, randomVariable, expectedValue, def_Xi, expectedValue_Xi, expectedTotalRuntime,
  • Thursday 9/30/10: Quicksort slides, quicksort slides with annotations
    quicksort, treeHeight,
  • Thursday 10/7/10: Sorting slides
    factorial, integerBitRepresentation,
  • Tuesday 10/12/10: Order statistics slides
    luckySplit, recurrenceAndSuproblemSizes,
  • Thursday 10/14/10: Red-black tree slides, Red-black tree slides with annotations
    heap, completeBinaryTrees,
  • Tuesday 10/19/10: B-tree slides, B-tree slides with annotations
    3arySearchTree, numberOfChildren, numberOfChildren2, totalNumberOfKeys, BTreeExternalMemory, BTreeInternalMemory,
  • Thursday 10/21/10: DP slides,
    programmingProjectDueDate, StrassenExample, fibMemoization, fibMemoization2, fibBottomUpDP, subsequencesAsBitstrings, prefixes, LCS_recurrences_case2,
  • Tuesday 10/26/10: DP slides with annotations,
    LCS-memoization1, LCS-memoization2, LCS-memoization3, LCS_length, printLCS, knapsack, knapsackEx, knapsackRecurrence, knapsack_DP_table,
  • Thursday 10/28/10: knapsack, knapsack_DP_Recurrence, recurrenceProof, knapsack_DP_example, fractionalKnapsack_greedy, greedyStrategy, makingChange, makingChangeCounterExample, makingChange_DP_recurrence, makingChange_DP_example,
  • Tuesday 11/2/10: Study problems for midterm 2, midterm 2 review,
    graphsEx1, graphsEx2,
  • Thursday 11/4/10: Graph slides
    pathsCyclesEx, DFS_tree_Ex, tree, DAG, connectedGraphEx, multipleConnectedComponentsEx, stronglyConnectedEx, topSort_DFS_ProofEx,
  • Tuesday 11/9/10: MST slides
    (Optional supplementary material: Union/Find slides)
    extraOfficeHours, weightedGraph_adjLists, MST_greedyTheorem_example, minHeapDecreaseKey,
  • Tuesday 11/16/10: Dijkstra slides
    test2Statistics,
  • Thursday 11/18/10: All pairs shortest paths slides
    relaxationStep,
  • Tuesday 11/23/10: teachingEvalsAnnouncement, searchProblem, reduction_Clique_to_IS, P-NP-classDiagram,
  • Tuesday 11/30/10: Final Review
    finalExamAnnouncement, P-NP-classDiagram, TSP_and_HC, HC_TSP_reduction, reductionFacts, showNPcompleteness,
  • Thursday 12/2/10: proveProblemIsInNP, independentSet_NPproof, vertexCover_NPproof, SAT, SAT_NPproof,

    This Syllabus is provided for informational purposes regarding the anticipated course content and schedule of this course. It is based upon the most recent information available on the date of its issuance and is as accurate and complete as possible. I reserve the right to make any changes I deem necessary and/or appropriate. I will make my best efforts to communicate any changes in the syllabus in a timely manner. Students are responsible for being aware of these changes.
    Last modified by Carola Wenk,   carola at cs.utsa.edu ,