CS465/665: Analysis of Algorithms

Fall 2004

General Information Course Description Syllabus Assignments/Grading Announcements



Instructor: Monica Nicolescu

E-mail:monica@cs.unr.edu
Office:SEM 239
Phone:(775) 784-1687
Office hours:Tuesday, Thursday 2:30pm-3:30pm

Teaching assistant: Kai Xu

E-mail:xukai@cs.unr.edu
Office:SEM 255A (room 4)
Phone:TBD
Office hours:Monday, Wednesday, 2:30 - 5:00pm

Time and Place

Tuesday, Thursday: 1:00pm-2:15pm, SEM 326

Required Textbook

Introduction to Algorithms, Second Edition, 2001.
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein



Course description

The design and analysis of algorithms is the core subject matter of Computer Science. Given a problem, we want to (a) find an algorithm to solve the problem, (b) prove that the algorithm solves the problem correctly, and (c) prove that we cannot solve the problem any faster. Designing an algorithm for a computational problem involves knowledge of the problem domain, a thorough knowledge of the data structures that are available and suitable and no small measure of creativity. This course concentrates on the above problems, studying useful algorithmic design techniques, and methods for analyzing algorithms.

Prerequisites

CS 308 (Data structures). Good knowledge of data structures (such as linked lists and trees) and a good mathematical background are required.



Syllabus

Following are the topics that will be discussed, listed in the approximate order in which they will be covered.
  • Introduction/Mathematical Foundations (Chapters 1, 3, Appendix A)
  • Recurrences (Chapter 4)
  • Sorting Algorithms (Chapters 2, 8)
  • Randomized Algorithms (Chapters 5, 7, 9)
  • Data Structures (Chapters 6, 11, 12, 13, 14)
  • Greedy Algorithms (Chapter 16)
  • Dynamic Programming (Chapter 15)
  • Graph Algorithms (Appendix B4, Chapters 22, 23, 24, 25)
  • Selected Topics (Chapters 28, 30, 31, 34, 35)

Class schedule

The topics presented and the lecture notes for each class will gradually be posted below as we cover them in the class. The assignments and their due dates will also be posted in this table. Please check this web page regularly for updates.

Date Topic Readings Assignments

Aug 24

Introduction, Asymptotic notations Chapters 1, 3 ---

Aug 26

Recurrences: Iteration method, substitution method Chapter 4: Sections 4.1, 4.2 ---

Aug 31

Recurrences: Recursion trees, Master Theorem; Sorting: Insertion sort Chapter 4: Sections 4.2, 4.3, Chapter 2: Section 2.1 Hw1 out
Sep 2 Sorting: Bubble sort, selection sort, Merge sort Chapter 4: Section 2.3 ---
Sep 7 Sorting: Quicksort Chapter 7 Hw2 out
Sep 9 Sorting: Quicksort, Order Statistics Chapters 7, 9 ---
Sep 14 Sorting in linear time Chapter 8 Hw3 out
Sep 16 Heaps, Heapsort Chapter 6 ---
Sep 21 Binary Search Trees Chapter 12 Hw4 out
Sep 23 Red-Black Trees Chapter 13 ---
Sep 28 Augmenting Data Structures Chapter 14 Hw5 out
Sep 30 Hashing Chapter 11 ---
Oct 5 Hashing Chapter 11 ---
Oct 7 Mit-term review --- ---
Oct 12 MID-TERM --- ---
Oct 14 Dynamic Programming Chapter 15 ---
Oct 19 Dynamic Programming Chapter 15 Hw6 out
Oct 21 Dynamic Programming Chapter 15 ---
Oct 26 Dynamic Programming, Greedy Algorithms Chapters 15, 16 ---
Oct 28 Greedy Algorithms Chapter 16 Hw7 out
Nov 2 Greedy Algorithms, Graph Algorithms: BFS Chapters 16, 22 ---
Nov 4 Graph Algorithms: DFS, Topological Sort Chapter 22 ---
Nov 9 Strongly Connected Components, Minimum Spanning Trees: Kruskal's Algorithm, Prim's Algorithm, Shortest Path Algorithms: Bellman-Ford Algorithm Chapters 22, 23, 24 ---
Nov 11 Veterans Day
Nov 16 Shortest Path Algorithms: DAG Shortest Paths, Dijkstra, All Pairs Shortest Paths Chapters 24, 25 Hw8 out
Nov 18 All Pairs Shortest Paths: Floyd-Warshall Algorithm Chapters 25, 31 ---
Nov 23 All Pairs Shortest Paths, Number Theoretic Algorithms Chapter 31 Hw9 out
Nov 25 Thanksgiving Day
Nov 30 Number theoretic algorithms, RSA Public Cryptosystem, NP-Completeness Chapters 31, 34 ---
Dec 2 Final review --- ---
Dec 6 NP-Completeness Chapter 34 ---
Dec 9 FINAL EXAM: noon-2pm Comprehensive, but focused on second half of semester ---



Assignments and grading

Homework assignments: There will be 10 homework assignments. The homeworks and their due dates will be posted on the course web page. Homeworks are due on their specified date at the beginning of the class. Some assignments will contain extra-credit problems and some may have a programming component. For each assignment the undergraduate students are required to solve the problems labeled U-required, while graduate students are required to solve all the problems. For the assignments that include extra-credit problems, the undergraduate students can earn extra-credit by solving either the extra-credit or the graduate level problems. Solutions to all the problems assigned will be provided.

Please make sure that you have a CS department computer account - you will need it for the programming assignments. You can obtain a CS department account by filling out the account registration form at the CS department.

Late policy: each late homework will incur a 10% penalty for each day of delay, but no homeworks may be submitted later than 3 days after the deadline.

Academic integrity: Students are encouraged to study together, however each student must individually prepare his/her solutions. Cheating or plagiarism are not permitted and will be sanctioned according with the UNR policy on Academic Standards. You should carefully read the section on Academic Dishonesty found in the UNR Student Handbook (copies of this section are on-line). Your continued enrollment in this course implies that you have read it, and that you subscribe to the principles stated therein.

Exams: there will be one mid-term and one final exam. Both exams will be closed books, closed notes. Permission to take exams on other dates than scheduled will not be given, except for extreme medical emergencies.

Grading policy (tentative, subject to change):
Homework:40%
Mid-term:25%
Final exam:30%
Attendance and class participation:5%

Grading scheme (tentative, subject to change):
A:90 and above
B:80-89
C:65-79
D:55-64
F:<55




Announcements

Announcements regarding the assignments or other updates will be posted on the class web page and also sent by e-mail. Please check your UNR e-mail account, as this is the address I will use to contact you. If needed, implement e-mail forwarding.



Created by: Monica NICOLESCU (e-mail:monica@cs.unr.edu)
Last update: 04/12/2004