CS477/677: Analysis of Algorithms

Fall 2012

General Information Course Description Syllabus Assignments/Grading Announcements


Instructor: Monica Nicolescu
E-mail:monica@cse.unr.edu
Office:SEM 239
Phone:(775) 784-1687
Office hours:TBA

Teaching assistant: TBA
E-mail:TBA
Office:TBA
Phone:TBA
Office hours:TBA

Time and Place
Monday, Wednesday: 1:00pm-2:15pm

Required Textbook
Introduction to Algorithms, Third Edition, 2009.
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 365. 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.

For homework submission please include a typed cover sheet with your name, section number and homework number. It would be desired to type the rest of your homework, but handwriting will be accepted. You can find instructions about writing your homework with LaTeX on Richard's webpage. A template for writing your homework solution with LaTeX has been kindly provided by Nolan Warner (download).


Date Topic Readings Assignments

Aug 27

 No class. --- ---

Aug 29

 Introduction ---

Sep 5

 Asymptotic notations --- ---

Sep 10

 Solving recurrences --- Hw1 out

Sep 12

 Solving recurrences --- ---

Sep 17

 Analysis of sorting algorithms --- Hw2 out

Sep 19

 Analysis of sorting algorithms --- ---

Sep 24

 The selection problem --- Hw3 out

Sep 26

 Advanced data structures --- ---

Oct 1

 Red-black trees, OS-Trees --- ---

Oct 3

 OS-Trees, Interval trees --- Hw4 out

Oct 8

 Dynamic Programming --- ---

Oct 10

 Dynamic Programming --- ---
Oct 15 Dynamic Programming --- ---
Oct 17 Mid-term review --- Hw 5 out
Oct 22 MID-TERM --- ---
Oct 24 Mid-term review, Dynamic Programming, Greedy Algorithms --- ---
Oct 29 Greedy Algorithms --- ---
Oct 31 Greedy Algorithms --- ---
Nov 5 Greedy Algorithms --- Hw 6 out
Nov 7 Graph Algorithms --- ---
Nov 14 Graph Algorithms --- ---
Nov 19 Graph Algorithms --- ---
Nov 21 Graph Algorithms, Number Theoretic Algorithms --- ---
Nov 26 Number Theoretic Algorithms, NP-Completeness --- Hw7 out
Nov 28 NP-Completeness --- ---
Dec 3 Approximation Algorithms --- ---
Dec 5 No class - independent study work. --- ---
Dec 10 Final review --- ---
Dec 17
10:15am-12:15pm		 Final Exam: comprehensive, with emphasis on material after mid-term --- ---


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)