CS 5329 - ALGORITHM DESIGN AND ANALYSIS

Fall 2016
Instructor: Vangelis Metsis

Time and Place of Class Meetings:
Tu 6:30pm - 9:20pm, ALK 102 & AVRY 364

Syllabus: PDF


Contacts

Instructor:
Dr. Vangelis Metsis
E-mail:
Office: Comal 307F
Office hours: Tu 4:00pm - 6:00pm & We 3:30pm - 5:00pm


Class Schedule

Class         Date         Topic Textbook Readings Notes
1 08/30 Introduction, Analysis of Algorithms, Insertion Sort Chapters 1-2 -
2 09/06 Mergesort, Growth of Functions, Asymptotic Analysis Chapter 3 -
3 09/13 Growth of Functions, Asymptotic Analysis (cont.) Chapter 3 -
4 09/20 Divide-and-Conquer, Recurrences Chapter 4: sections 4.1, 4.3-4.5 Homework 1 posted. Programming Project posted.
5 09/27 Heapsort, Quicksort Chapter 6: sections 6.1-6.4; Chapter 7: sections 7.1-7.3 -
6 10/04 Hash Tables Chapter 11: sections 11.1-11.4 (excluding 11.3.3) Homework 1 due. Homework 2 posted.
7 10/11 Binary Search Trees Chapter 12: sections 12.1-12.3 -
7 10/18 Balanced Search Trees Chapter 13: sections 13.1-13.3; Chapter 18: sections 18.1-18.2 Homework 2 due.
10 10/25 MIDTERM EXAM
11 11/01 Dynamic Programming
Fibonacci Numbers, Longest Common Subsequence
Chapter 15: sections 15.1, 15.3, 15.4 -
12 11/08 Greedy Algorithms Chapter 16: sections 16.1-16-3 -
13 11/15 Elementary Graph Algorithms Chapter 22: sections 22.1-22.5 Homework 2 posted.
13 11/22 Minimum Spanning Trees Chapter 23: sections 23.1-23.2 Homework 3 due.
14 11/29 Single-Source Shortest Paths Chapter 24: sections 23.1-23.3 Homework 4 posted.
15 12/06 NP-Completeness -
Polynomial Time Verification, NP-Complete Problems, Reducibility
Chapter 34: sections 34.1-34.5 Homework 4 due.
Programming projects demos.
-- 12/13 FINAL EXAM (8:00 PM - 10:30 PM)

Textbook: Introduction to Algorithms - Cormen, Leiserson, Rivest, Stein, 3rd ed. , MIT Press, 2009.

Tentative course topics:


Homework Assignments

See TRACS.


Programming Project

See TRACS.