Design and Analysis of Algorithms: Assignments
Code for Exercises
In this text from the author's page
Past Exams
Comprehensive Core Exam
The CCE exams for CSCI 650 are closed book and closed note tests - no "cheat sheets"
How to study? Exam Study Guide
Fall 2003 CCE, Spring 2004 CCE (.doc), Fall 2004 CCE, Spring 2005 CCE (.doc), Fall 2005 CCE (.doc),
Spring 2006 CCE (.doc), Fall 2006 and Spring 2007(.doc),
Fall 2007 CCE (.doc) and Spring 2008 CCE (.doc)
Midterms
Fall 2003 Midterm, Fall 2004 Midterm, Spring 2005 Midterm (.doc),
Fall 2006 Midterm (.doc), Fall 2007 Midterm (.doc)
various tests ( with some finals too ),
links to online webpages (with potentials for example midterms and finals)
Course Assignments
Chapter 1: Introduction, Performance Analysis
warm-up exercises
Homework
Chapter 2:Elementary Data Structures
Assignment 2
Chapter 3: Divide and Conquer
Assignment 3
Chapter 4: Greedy Method and Chapter 5: Dynamic Programming
Assignment 4
Chapter 6: Basic Traversals and Search Techniques
Assignment 5
Chapter 11: NP-Hard and NP-Complete
Assignment 6
Web-archive course:
The Final exam is on WebCT. The test is closed book and closed notes except one 8x11 "cheat sheet" (one page with what you
have deemed to be important). Discussion or using additional resources concerning questions and answers is not permissible.
Favorite student comment from class:
"This equation was obtained by using a method which I'll call Noncommittal Induction Equation Fabrication" AND it (the comment's term) was trade-marked!