CS 5633 Analysis
of Algorithms
Slides, pictures
- Monday 1/12/04:
convexhull,
announcements,
algorithm,
describealgo,
insertionsort,
pseudocode,
loopinvariant,
maintenance,
termination,
analysis,
bestcaseworstcase,
reading,
- Wednesday 1/14/04:
asympnotation,
graph,
bigOh,
bigOhEx,
bigOmega,
bigTheta,
bigOmegaEx,
ex1,
ex2,
codesnippets1,
codesnippets2,
codesnippets3,
harmonicnumber,
littleOh,
- Wednesday 1/21/04:
Recurrence slides
3-announcement,
3-readingMergesort,
3-substitutionmethod,
3-substitutionmethod2,
3-expansion,
3-anotherrecurrence,
3-anotherrecurrence2,
3-mastertheorem,
- Monday 1/26/04:
Divide & Conquer slides,
Quicksort slides
4-weekplan,
4-mastercase12,
4-mastercase3,
4-ex1,
4-ex2,
4-ex3,
4-matrixmult,
4-atothe6,
- Wednesday 1/28/04:
5-officeHoursChanged,
5-recurrence,
5-avgcase,
5-randalgos,
5-randquicksort,
5-probability,
5-rollingdie,
5-randomvariable,
5-expectedvalue,
5-game,
5-sum,
5-sumex,
- Monday 2/2/04:
6-indicatorvariable,
6-polymult,
6-ex1,
6-ex2,
6-hwprobl3,
6-randompartition,
6-quicksortAnalysis,
- Wednesday 2/4/04:
7-adt,
7-datatype,
7-prioqueue,
7-implementations,
7-heap,
7-heapex1,
7-extractmax,
7-heapex2,
7-insert,
7-heapex3,
7-buildheap,
7-buildheap2,
7-buildheap3,
7-buildheap4,
- Monday 2/9/04:
Some corrected quicksort slides
Sorting slides
8-insertionsort,
8-runtimeBuildheap,
8-runtimeBuildheap2,
8-stirlingsformula,
8-lognfactorial,
8-lognfactorial2,
8-apowerxy,
8-simplecountingsort,
- Wednesday 2/11/04:
Order statistics slides
9-radixsortex,
9-radixsortex2,
9-radixsortex3,
9-lexicographic,
9-select,
- Monday 2/16/04:
10-maximum,
10-select,
10-runtime,
10-runtime2,
- Wednesday 2/18/04:
Hashing slides
11-thesisworkshop,
11-calendar,
11-probing,
11-linearprobing,
11-quadraticprobing,
- Monday 2/23/04:
Dynamic tables slides
12-bincounter,
12-bruteforce,
12-chapter17,
12-accounting,
12-accounting2,
12-amortized,
12-amortizedaccounting,
12-bincounterex,
12-aggregate,
- Wednesday 2/25/04:
Relevant material for midterm (ps, pdf)
Red-black tree slides
13-adtdictionary,
13-bst,
13-delete,
13-runtime,
13-numberofleaves,
13-karysearchtree,
13-case1,
- Monday 3/1/04:
14-btrees,
14-splitting,
14-example,
14-insert,
14-btreedef,
14-codesnippets,
14-codesnippets2,
14-codesnippets3,
- Monday 3/8/04:
Dynamic programming slides
15-btrees,
15-insertBtree,
15-btreeheight,
15-btreeex,
15-btreeex2,
15-btreeex3,
15-dp,
15-fib,
15-lcs,
- Wednesday 3/10/04:
16-HW7,
16-LCSrecformula,
16-optsubstruct,
16-matrmult,
16-matrmultex,
16-recsolution,
- Monday 3/22/04:
17-topics,
17-matrixchainmult,
17-recurrence,
17-ex1,
17-ex2,
17-ex3,
17-code,
17-printparens,
- Wednesday 3/24/04:
Computational geometry slides
18-bintree,
18-2drangetree,
18-2drangetree2,
18-outputsensitive,
- Monday 3/29/04:
19-rangetree,
19-points,
19-query,
19-space,
19-preprocessing,
19-sweepline,
- Wednesday 3/31/04:
MST slides
20-pred,
- Monday 4/5/04:
21-kruskalex,
21-numMSTs,
21-disjointsets,
21-kruskal,
- Wednesday 4/7/04:
Union-Find slides
22-height,
22-height2,
22-height3,
22-unionfindEx,
22-unionfindResults,
22-ackermann,
22-ackermann2,
22-alpha,
- Monday 4/12/04:
Single-Source Shortest Paths slides
- Wednesday 4/14/04:
More Shortest Paths slides
23-topsort,
23-topsort2,
- Monday 4/19/04:
P and NP slides
24-reduction,
24-formula,
- Wednesday 4/21/04:
25-IS_VC,
25-NPdefinitions,
25-classnesting,
25-cliqueNPcomplete,
25-blackbox,
25-TSP_HC,
25-HC-HP,
- Wednesday 4/28/04:
Material for the final (ps, pdf)
Study problems for the final (ps, pdf)
26-HP_HC,
26-HP_HCdef,
26-recurrence,
26-NPhomework4,
26-NPhomework4b,
26-subgraphiso,
26-subgraphiso2,
Last modified by Carola Wenk,
carola @ cs.utsa.edu ,
