CS 6363: Design and Analysis of Computer Algorithms
Semester: Fall 2021
Time: Monday/Wednesday, 10:00am to 11:15am CST
Room: ECSS 2.203
Instructor Information:
Name: Benjamin Raichel
Office: ECSS 4.226
Phone: (972) 883-4193
Email: benjamin.raichel@utdallas.edu
Office Hours: TBD
URL: http://www.utdallas.edu/~benjamin.raichel
Teaching Assistant Information:
Name: TBD
Email: TBD
Office Hours: TBD
Textbooks:
-
Introduction to Algorithms, Third Edition. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and Clifford Stein. (Often abbreviated as CLRS.)
- Jeff Erickson's Lecture Notes
Syllabus: SACS Syllabus
Schedule
Below are the topics covered in each class. Topics on future dates may change.
JN = Jeff's Notes, CLRS = Intro to Algorithms text book, numbers represent the relevant chapters.
- 08/22-08/28:
- [JN 0, CLRS 3] Introduction, what is an algorithm, growth of functions, asymptotic notation
- [JN 1, CLRS 3] properties of common functions, induction
- 08/29-09/04:
- [JN 1, CLRS 4.1] Recursion, divide and conquer
- [JN 1, CLRS 4.3-4.5] Solving recurrences
- 09/05-09/11:
- [JN 1, CLRS 2.1, 2.3, 8.1] InsertionSort and MergeSort, sorting lower bound
- [JN 1, CLRS 7.1,7.2, 9.3] Quick Sort, Median Selection