COT5405:
ANALYSIS OF ALGORITHMS
Term: Spring 2006
Location: NEB 102
Professor: Alper Üngör
Teaching Assistants: Jianhua Fan (jfan@cise.ufl.edu), Ravi Jampani (rjampani@cise.ufl.edu), Xinyan Zha (xzha@cise.ufl.edu)
Weekly Schedule:
  Mon Tue Wed Thu Fri
10:40   Lecture
(NEB 102)		   Lecture
(NEB 102)		 Jianhua
(CSE 309)
11:45   Alper
(CSE 430)		   Lecture
(NEB 102)		  
12:50       Alper
(CSE 430)		  
13:55 Ravi
(CSE 309)		   Ravi
(CSE 309)		    
15:00 Jianhua
(CSE 309) 		    Xinyan
(CSE 309) 		 
16:05   Xinyan
(CSE 309) 		     
Catalogue number: 1091
Credit hours: 3

info announcements schedule projects references

Announcements

Schedule

Date Lecture Topic Assignments
Jan 10 Tu Introduction, Syllabus, Course structure.
Algorithm design and analysis, Correctness
Time and space complexity, Insertion-Sort
Asymptotic notation, Big-Oh, Big-Omega
[CLRS01 Ch 1,2,3] [HSR97 Ch 1]
Jan 12 Th Recurrences, Merge-Sort, Substitution method
Recursion-tree method (Reading: Master theorem)
[CLRS01 Ch 4]
Quicksort, Expected analysis, Randomized algorithms
Inplace sorting, Tail recursion
[CLRS01 Ch 5,7] [HSR97 Ch 3]
ALGORITHMIC PARADIGMS AND DATA STRUCTURES
Jan 17 Tu Lower bound on comparion sorts, Decision-tree model
Linear time sorting, Counting-sort, Radix-sort
[CLRS01 Ch 8] [HSR97 Ch 10]
Jan 19 Th Analysis of Radix-sort, Selection, Median
Quick-select, Deterministic selection
[CLRS01 Ch 8,9] [HSR97 Ch 3] 		HW#1 out
[ps, pdf]
Jan 24 Tu Heaps, Priority Queue
[CLRS01 Ch 6]
Jan 26 Th Dynamic Search Structures
[CLRS01 Ch 12-13]
Jan 31 Tu Dynamic Programming, Fibonacci numbers
[CLRS01 Ch15] 		HW#1 due
Feb 2 Th Dynamic Programming, Edit Distance, Greedy Algorithms, Scheduling
[CLRS01 Ch 16] 		HW#2 out
[ps, pdf]
Feb 7 Tu Knapsack Problem, Greedy vs. Dynamic Programming
[CLRS01 Ch 17]
Feb 9 Th Amortized Analysis
[CLRS01 Ch 19]
Feb 14 Tu Matrix-Chain Multiplication, Knapsack Problem revisited
[CLRS01 Ch 20] 		HW#1 graded
HW#2 due
Feb 16 Th MIDTERM EXAM I
GRAPH ALGORITHMS
Feb 21 Tu Elementary Graph Algorithms [CLRS01 Ch 22]
Single-Source Shortest Paths
[CLRS01 Ch 24]
Feb 23 Th All-pairs Source Shortest Paths
[CLRS01 Ch25] 		Exam graded
Feb 28 Tu Minimum Spanning Trees
[CLRS01 Ch 23] 		HW#3 out
[ps, pdf]
Mar 2 Th Maximum Flow
[CLRS01 Ch 26]
Mar 7 Tu Maximum Flow
[CLRS01 Ch 26]
COMPUTATIONAL GEOMETRY
Mar 9 Th Union-Find Data Structure for Disjoint Sets
[CLRS01 Ch 21]
Geometric Algorithms, Closest Pairs
[CLRS01 Ch 33.4] 		HW#3 due
Mar 14 Tu SPRING BREAK
Mar 16 Th
Mar 21 Tu Convex Hull Algorithms, Jarvis's March, Output sensitive algorithms
[CLRS01 Ch 33]
Mar 23 Th Convex Hull Algorithms, divide and conquer, Graham s scan, Chan's algorithm
[CLRS01 Ch 33] 		HW#4 out
[ps, pdf]
Mar 28 Tu Line Segment Intersections
[CLRS01 Ch 33]
Mar 30 Th MIDTERM EXAM II
SELECTED TOPICS
Apr 4 Tu Topics Review, Lower bounds, Graph & Geometry Algs, Union-find
HW#4 due
Apr 6 Th String Matching
[CLRS01 Ch 32]
Apr 11 Tu String Matching
[CLRS01 Ch 32]
COMPLEXITY AND APPROXIMATION
Apr 13 Th NP-completeness
[CLRS01 Ch 34]
Apr 18 Tu NP-completeness
[CLRS01 Ch 34] 		HW#5 out
[ps, pdf]
Apr 20 Th Approximation Algorithms
[CLRS01 Ch 35]
Apr 25 Tu Approximation Algorithms
[CLRS01 Ch 35] 		HW#5 due
May 5 F FINAL EXAM (7:30am-9:30am)

References

Books
[CLRS01] T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms, 2nd Edition, McGraw-Hill, 2001.
[HSR97] E. Horowitz, S. Sahni and S. Rajasekaran. Computer Algorithms , Computer Science Press, 1997.
Surveys
Papers
Links
[L1] A compendium of NP optimization problems
[L2] ACM-SIGACT
[L3] Computing Science Journal Collections
[L4] Journals of ACM
[L5] Journals of SIAM

info announcements schedule projects references

Alper Üngör (ungor@cise.ufl.edu) Nov 2005