The George Washington University
School of Engineering and Applied Science
Department of Computer Science

CSci 212 -- Design and Analysis of Algorithms

Fall 2001

Lecture Times: Wednesdays, 6:10 PM-8:40 PM

GW Code of Academic Integrity 

• Abdelghani Bellaachia
• Email: bella@seas.gwu.edu
• Phone: (202) 994-xxxx
• Office: Gelman Library Room 704L
• Office Hours: Wednesdays 5:00PM-6:00PM

Homework #4 

Computer Algorithms,  Ellis Horowitz, Sartaj Sahni, and S. Rajasekaran,
Computer Science Press, 1998

Recommended Book: Introduction to Algorithms
by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
MIT Press.

• Homework
• Midterm 
• Final

• Homework:             Biweekly

• Midterm:                 Wednesdays, October 24, 2001

• Final:                      TBA

• Homework:              20%

• Midterm:                  35%

• Final:                        45%

• Introduction

• Basic principles of algorithm design and analysis

• Complexity

• Data Structures, sets and Union-Finds

• The divide and Conquer method

• The Greedy method

• Dynamic Programming

• Graph traversal and related method

• Backtracking

• Branch and Bound method (MS Word)

• Lower bound theory

• Introduction to NP-completeness

Homework #1

Homework #2

Homework #3

Homework #4