CS 5633 Analysis
of Algorithms>
Spring 08
Slides, pictures
Tuesday 1/15/08:
algorithm,
describeAlgorithm,
sortingProblem,
insertionSortDescription1,
insertionSortDescription2,
correctnessProof1,
correctnessProof2,
runtimeAnalysis1,
runtimeAnalysis2,
bestCase-worstCase,
Thursday 1/17/08:
asymptoticNotation,
largeN,
runtimeFunction,
definitions,
examples234,
examples56,
bigOhOmegaLemma,
thetaAndLittleOh,
limitTheorem,
examples8910,
logFormula,
codeSnippets1,
codeSnippets2,
codeSnippets3,
Tuesday 1/22/08:
hw1,
heapDef,
heapEx,
ADT-PriorityQueue,
priorityQueueImplementations,
heapArrayEx,
heightLemmas,
heightLemmaProof,
addElement,
addElementEx,
buildHeap,
extractMax,
extractMaxEx,
heapifyDown,
Thursday 1/24/08:
Divide and Conquer slides
buildHeap,
runtimeOfHeapifyDown,
runtimeOfHeapifyDown2,
runtimeOfHeapifyDown3,
heapSort,
summations,
mergesortRecurrence,
mergesortRecurrence2,
inductionSubtract,
recursionTree,
Tuesday 1/29/08:
More Divide and Conquer slides
hw,
case1Ex,
case2Ex,
case3Ex,
counterEx,
Thursday 1/31/08:
matrixMult,
polynomial,
probability,
probabilityEx,
probabilityProperties,
randomVariable,
expectedValue,
randomVariableEx,
linearityOfExpectation,
hireAssistant,
hireAssistantRuntime,
randomizedHireAssistant,
sampleSpaceHireAssistant,
Tuesday 2/5/08:
Quicksort slides,
hireAssistantSampleSpace.,
hireAssistantRandomVariable,
hireAssistantExpectation,
hireAssistantExpectation2,
log910ths.,
Thursday 2/7/08:
Sorting slides,
insertionSort,
insertionSortDecisionTree,
Tuesday 2/12/08:
Selection slides,
deterministicSelectRuntime,
Thursday 2/14/08:
Red-black tree slides(lecture,
handout)
hw4ex6Sol_a,
hw4ex6Sol_b,
hw4ex6Sol_c,
wrongBST,
Thursday 2/21/08:
B-tree slides (
lecture,
handout)
rangeTree,
bTreeHeight,
Tuesday 2/26/08:
Augmenting data structures slides (lecture, handout),
test1Statistics,
intervalTreeCases,
Thursday 2/28/08:
Range tree slides (lecture, handout),
test1Recursiontree,
newGradingScheme,
rangetreeEx,
rangetreeSpace,
Tuesday 3/4/08:
MS orientation slides (lecture, handout),
Dynamic programming slides (lecture, handout),
hw6-3b,
Thursday 3/6/08:
Matrix multiplication slides (lecture, handout),
hw6-3,
LCS_recurrence,
matrixMultEx,
matrixMultOptSubstructure,
matrixMultDPEx,
Tuesday 3/11/08:
hwIntervalDP,
greedy,
makingChange,
optSubstructure,
correctnessGreedy,
correctnessGreedy2,
counterEx,
makingChangeDP,
knapsack,
greedyFractionalKnapsack,
Thursday 3/13/08:
Amortization slides (lecture, handout),
knapsack,
optSubstructure,
correctnessGreedy,
knapsackEx,
Tuesday 3/25/08:
Union-Find slides (lecture, handout),
unionsRuntime,
treeUnion,
ackermann1,
ackermann2,
ackermann3,
Thursday 3/27/08:
Graph slides (lecture, handout),
test2,
ackermann,
graphs,
Thursday 4/3/08:
MST slides (lecture, handout),
test2Statistics,
Tuesday 4/8/08:
Single source shortest paths slides (lecture, handout),
shortestPath,
Thursday 4/10/08:
More shortest paths slides (lecture, handout),
reweighingLemma,
johnsonsAlgorithmComputeVertexWeights,
johnsonsWeights,
Tuesday 4/15/08:
P and NP slides (lecture, handout),
complexityHierarchy,
completeGraphs,
clause,
Thursday 4/17/08:
NP-hard,
NP-complete,
CliqueInN,
equivalence,
HamiltonPathAndCircuit,
HC_NPcomplete_proof1,
HC_NPcomplete_proof2,
HC_and_TSP,
Tuesday 4/22/08:
approximationAlgorithms,
approximationRatio,
VCandTSP,
Max3SAT,
vertexCover,
vertexCoverEx,
VCTheorem-1,
VCTheorem-2,
TSP,
TSPEx,
TSPTheorem-1,
TSPTheorem-2,
Thursday 4/24/08:
Flow networks slides (lecture, handout),
cut,
implicitSummationNotation,
Tuesday 4/29/08:
residualNetwork,
Last modified by Carola Wenk,
carola @ cs.utsa.edu ,
