Design and Analysis of Algorithms

Design and Analysis of Algorithms: Assignments

Code for Exercises

In this text from the author's page (has code in C++ though, also some of C++ version of book is here)

Past Exams

Comprehensive Core Exam
The CCE exams for CSCI 650 is a completely closed book and closed note test - no "cheat sheet" either

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), Fall 2009 CCE (.doc), Spring 2009 CCE (.doc)

Midterms

Fall 2003 Midterm, Fall 2004 Midterm, Spring 2005 Midterm (.doc), Fall 2006 Midterm (.doc), Fall 2007 Midterm (.doc), Fall 2008 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

summations and induction review,

warm-up exercises

Don't look at these until you have tried them yourself!

handout scanned

Chapter 2:Elementary Data Structures

after

Chapter 3: Divide and Conquer

after

Chapter 4: Greedy Method and Chapter 5: Dynamic Programming

Midterm

You may use only one side of an 8 1/2 x 11 piece of paper with notes for the Midterm

Chapter 6: Basic Traversals and Search Techniques

Chapter 11: NP-Hard and NP-Complete

FINAL

You may use only one side of an 8 1/2 x 11 piece of paper with notes for the Final.

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!