Spring 2008
Topics:
This course emphasizes the
understanding of data structures and algorithms from an analytical perspective
rather than from an implementation standpoint. The concepts developed allow
discussion of the efficiency of an algorithm and the comparison of two or more
algorithms with respect to space and run-time requirements. Analytical methods
are used to describe theoretical bounds as well as practical ones. In general,
this course addresses the constraints that affect problem solvability. A grade
of C or better required in CS prerequisite 2604 or 2606. I, II
Lecture: Tu-Th
3:30-4:45 PM, 321 McBryde
Hall
Final exam: May 3, 2008, 1:05-3:05PM.
Instructor: Dr. Adrian
Sandu
E-mail: sandu@cs.vt.edu
Phone: 1-2193
Office: 2242 KnowledgeWorks II Building
Office hours: By appointment.
Teaching Assistants:
Guanying Wang (wanggy@vt.edu) and
Tridib Dutta (tridibd@vt.edu)
Office hours: Guanying Thu 1-3pm, Tridib Fri 2-4pm, 133B McBryde Hall.
Prerequisites:
(CS
2604 or CS
2606), (MATH
3134 or MATH
3034)
Textbook:
"Computer
Algorithms: Introduction to Design & Analysis" (third edition). Sara Baase, Allen Van Gelder. 688 pages. ISBN:
0-201-61244-5. Addison-Wesley, 2000.
Grading:
The grade is based on:
Syllabus:
For detailed information please consult
the syllabus (PDF)
Please
check the list
of assignments.