CS 502 - Ugur Dogrusoz

CS 502 Algorithms II Fall 2020
Instructor: Ugur Dogrusoz
Office, Hours: EA-522, Tue, Fri AM
Classroom, Hours: EB-103, Tue PM, Fri AM

Rules of conduct for Final exam
Week of Dec 14, read Chapter 25
Week of Dec 14, read Chapter 25
Week of Dec 14, Quiz 4
Week of Dec 7, read Chapter 24
Week of Nov 23, Quiz 3
Week of Nov 16, read Chapter 23
Week of Nov 2, Rubric for Quizzes
Week of Oct 26, Quiz 2
Week of Oct 19, read Chapter 22
Week of Oct 12, read Chapter 21
Week of Oct 5, Quiz 1
Rules of conduct for Quizzes
Week of Sept 28, read Chapter 19
Week of Sept 21, read Chapters 13 and 14
Remarks on distance learning
Office hour (by appointment): Tue, Fri 8:30-9:20
Unless otherwise stated, we do not hold the following lecture hour: Fri 8:30-9:20
Check here at least once a week!

This course picks up where Algorithms I left and aims for the student to acquire the following upon completion:

Become fluent in analyzing algorithms and data structures in terms of correctness and required computational resources.
Comprehensively understand, use, and manipulate advanced and efficient data structures.
Develop a comprehensive and in-depth understanding of common algorithm design techniques.
Be able to design and analyze algorithms to solve new problems.
Understand how to formulate different problems in terms of each other.
Develop a comprehensive understanding of the theory of computational complexity.

Prior knowledge of fundamentals of computer science and algorithms required. Permission from the instructor required for undergraduates.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to Algorithms", MIT Press and McGraw-Hill, 2009. Third Edition

Concepts / Slides	Textbook
Basics	-
Augmenting Data Structures	Chapter 14
Fibonacci Heaps	Chapter 19
Data Structures for Disjoint Sets	Chapter 21
Elementery Graph Algorithms	Chapter 22
Minimum Spaning Trees	Chapter 23
Single-Source Shortest Paths	Chapter 24
All-Pairs Shortest Paths	Chapter 25
NP-Completeness	Chapter 34