CS 483 Spring 2007
Data Structure and Analysis of Algorithms

Time: Tue.&Thur. 9:00-10:15am
Location: Innovation Hall 134
Course webpage: http://cs.gmu.edu/~jmlien/teaching/07_spring_cs483/

Instructor: Jyh-Ming Lien
Office hours: Tue, Thu 10:30-11:30am
Contact: jmlien@gmu.edu, (703) 993-9546, Office 421 ST II
Teaching Assistant: Yuan Li
Office hours: Friday 2:00-6:00pm
Contact: ylif@gmu.edu, Office 365 ST II

Syllabus: pdf

"An algorithm is a procedure (a finite set of well-defined instructions) for accomplishing some task which, given an initial state, will terminate in a defined end-state" - from wikipedia, the free encyclopedia

Course Scope. In this course, a thorough examination of several well-known techniques that are used for the design and analysis of algorithms will be covered. Topics to be covered include theoretical measures of algorithm complexity, sorting and selection algorithms, greedy algorithms, divide and conquer techniques, dynamic programming, graph algorithms, search strategies, and an introduction to the theory of NP-completeness. Additional topics may be covered if time permits. Students are expected to have taken prior undergraduate courses in data structures, as well as calculus and discrete mathematics.

Prerequisites. CS 310 and CS 330 Calculus (MATH 113, 114, 213) and MATH 125

Required Textbook. Introduction to the Design and Analysis of Algorithms by Anany Levitin, Addison Wesley; 2nd edition (2006)

  1. Quizzes (about every 1-2 weeks) and CS Culture assignments 10%
  2. Assignments 20%
  3. Midterm Exam 20%
  4. Final Exam 30%
Important Dates.
  • Spring Break (March 1118)
  • Midterm Exam (March 22)
  • Final Exam (May 15)
Weekly Schedule, Readings, Assignments, Notes.

Click this button to subscribe the calendar.
This calendar will be updated frequently during the semester.

List of Topics.
  • Fundamentals of problem solving (problem types, data structures)
  • Analysis of Algorithm Efficiency (asymptotic notation)
  • Brute Force Techniques (sorting, search, traveling salesmen)
  • Divide and Conquer (merge sort, quicksort, binary search)
  • Decrease and Conquer (graph traversals, insertion sort)
  • Transform and Conquer (heapsort, balanced search trees, problem reduction)
  • Dynamic Programming
  • Greedy Techniques (MWST, Dijkstra, Huffman trees)
  • Limitations of Algorithm Power (decision trees, lower bounds, P, NP)
  • Coping with Limitations

Policies. All required assignments must be completed by the stated due date and time. There will be absolutely no extensions for the homework (not even in the case of emergency). Your lowest homework grade will not be counted towards your final grade.
Please note that all coursework is to be done independently. Plagiarizing the homework will be penalized by maximum negative credit and cheating on the exam will earn you an F in the course. See the GMU Honor Code System and Policies at http://www.gmu.edu/catalog/acadpol.html and http://www.cs.gmu.edu/honor-code.html. You are encouraged to discuss the material BEFORE you do the assignment. As a part of the interaction you can discuss a meaning of the question or possible ways of approaching the solution. The homework should be written strictly by yourself. In case your solution is based on the important idea of someone else please acknowledge that in your solution, to avoid any accusations.
You will be allowed to have one page (letter size) of notes for the midterm and two pages (one sheet) for the final. No copying of anything from the textbook or another person is allowed. You can write some things verbatim. You can also write your notes on the computer and print them. The notes sheet will be handed in with the exam.
The quiz will be a closed book exam - no notes will be allowed. You can also have up to two opportunities of making up your missed/failed quizzes by turning in two CS culture assignments. A CS culture assignment is a one-page written summary of a talk from a CS seminar (see http://cs.gmu.edu/events/) that you attend during the Spring'07 semester.

File translated from TEX by TTH, version 3.77.
On 16 Jan 2007, 15:38.