CS 5633 Analysis of
Algorithms
Spring 10
http://www.cs.utsa.edu/~carola/teaching/cs5633/spring10
Slides, pictures
Tuesday 1/12/10:
analysisOf Algorithms,
algorithm,
describeAlgo,
exInsertionSort,
insertionSortDescription,
insertionSortPseudoCode,
loopInvariant1,
loopInvariant2,
loopInvariant3,
pseudocodeWithRuntimes,
runtime,
bestCaseRuntime,
worstCaseRuntime,
Thursday 1/14/10:
Oh-setOfFunctions,
largeN,
largeN2,
bigOh,
bigOhEx,
bigOhEx2,
thetaEx,
Oh-Omega-Theta,
OhOmegaLemma,
limitTheorem,
limitTheoremEx,
logBases,
codeSnippets,
codeSnippets2,
Tuesday 1/19/10:
Divide and conquer slides,
Carola-officeHours,
summations,
mergeSortRecursiveCalls,
treeHeight_and_expansionMethod,
substitutionMethod1,
substitutionMethod2,
substitutionMethod3,
recursionTree1,
recursionTree2,
Thursday 1/21/10:
More divide and conquer slides,
badBigOhInductionEx1,
badBigOhInductionEx2,
badBigOhInductionEx3,
logs,
masterTheoremNotes,
matrixMult,
Tuesday 1/26/10:
hw2-polynomials,
uniformProbability,
uniformProbabilityEx,
probabilityProperties,
randomVariable,
coinFlipEx,
gameEx,
expectedValue,
randomVariableEvents,
linearityOfExpectation,
sumOfRandomVariables,
sumOfRandomVariablesEx,
hireAssistant,
randomizingHireAssistant,
sampleSpace_and_randomVariable,
expectation,
example,
Thursday 1/28/10:
Quicksort slides,
3-2-randomizedHireAssistantEx,
Tuesday 2/2/10:
Sorting slides,
sorting slides with annotations,
StirlingsFormula,
log-n-factorial,
8-bit-numbers,
Thursday 2/4/10:
Selection slides,
max,
recurrence,
bigOhInduction,
floor,
Tuesday 2/9/10:
Red-black tree slides
maxHeap,
unbalancedTree,
Thursday 2/11/10:
B-tree slides
completeTree_redBlackTree,
BTrees,
BTree_node_conditions,
minDegExamples,
Tuesday 2/16/10:
Data structure augmentation slides,
Data structure augmentation slides with annotations
classCanceled_and_intervalEx,
sumOfLogs,
Tuesday 2/23/10:
Dynamic programming slides,
LCS-arrows,
Thursday 2/25/10:
Matrix chain multiplication slides,
parensEx,
parensEx2,
greedy1,
greedy2,
matrixChainMultEx1,
matrixChainMultEx2,
matrixChainMultEx3,
printParensEx,
Tuesday 3/2/10:
midtermAnnouncement,
greedyAlgorithms,
makingChangeGreedy,
proveGreedyCorrectness,
greedyCounterEx,
theorem,
proof1,
proof2,
makingChangeDP,
DPEx,
runtime,
knapsack,
fractionalKnapsackGreedy,
Thursday 3/4/10:
Practice questions for the midterm,
exampleGreedyFracKnapsack,
counterExGreedy01Knapsack,
01KnapsackDP1,
01KnapsackDP2,
midterm,
Thursday 3/11/10:
Amortization slides
Tuesday 3/23/10:
Union-Find slides,
connectedComponents,
logWeightLemma-Case1,
logWeightLemma-Case2,
Ackermann1,
Ackermann2,
Ackermann3,
Thursday 3/25/10:
Graph slides
directedAndUndirectedGraphs,
graphsEx,
DAG,
DFS_Tree_Ex,
cycles,
Tuesday 3/30/10:
MST slides
announcements,
Tuesday 4/6/10:
Dijkstra slides
Dijkstra,
Thursday 4/8/10:
More shortest paths slides,
Tuesday 4/13/10:
P and NP slides,
completeGraphs,
TSP,
P-NP-diagram,
booleanFormulaForSAT,
nonSatisfiableFormula,
Thursday 4/15/10:
TSP_and_HC,
HC_reducedTo_TSP1,
HC_reducedTo_TSP2,
proveNPCompleteness,
complexityClassDiagram,
Tuesday 4/20/10:
approximationAlgorithms,
fixedParameterTractability,
approximationRatio,
minimizationAndMaximizationProblems,
vertexCover,
VC-approx,
VC-approxEx,
VC-approxEx2,
VC-approxTheorem,
VC-approxTheorem2,
TSP_with_triangle_inequality,
TSP_Ex,
TSP_approx,
Thursday 4/22/10:
Network flow slides,
Study problems for the final
Tuesday 4/27/10:
NPCompletenessEx,
NPCompletenessEx2,
NPCompletenessEx3,
FinalTopics,
FinalTopics2,
Last modified by Carola Wenk,
carola @ cs.utsa.edu ,
