CSCI-2300: Data Structures and Algorithms
Sections 1, 2, 3, 7
Spring 2002


Announcements
Labs
Exams
Projects
Homeworks
Code from lectures

Course Information

Instructor: Srinivas Akella
Office: Amos Eaton 112, x8770, sakella@cs.rpi.edu
Office Hours: Tuesday 2:00-3:30pm, Thursday 2:00-3:30pm

Time: Tuesday and Friday, 10:00am - 11:20am
Classroom: Sage 3303
Credits: 4
Prerequisites: Computer Science II (CSCI-1200) and Calculus I (MATH-1010).

Web page: http://www.cs.rpi.edu/~sakella/dsa/

Grad TA for Sections 1 and 2:
Jitendra Deshpande
Email: deshpj@cs.rpi.edu
Office Hours: Tuesday 4:00-5:00 pm, Wednesday 1:00-2:00pm
Office: Lally 9, x8981

Grad TA for Sections 3 and 7:
Justin Chen
Email: chenh3@rpi.edu
Office Hours: Monday 12:00-1:00pm, Friday 12:00-1:00pm
Office: Lally 3A, x8556

Description

This course is an introduction to data structures and algorithms, and the mathematical techniques necessary to design and analyze them. Data structures covered include lists, heaps, priority queues, balanced search trees, and graphs. Mathematical techniques for designing algorithms and analyzing worst-case algorithm efficiency will be introduced. Example sorting, searching, and graph traversal algorithms will be described. Advanced algorithm topics such as NP-completeness, dynamic programming, greedy algorithms, and backtracking may also be covered.

Syllabus. postscript file, pdf file.


Labs

Section 1 (Wednesday 8:00-9:50am; Sage 3101), TAs: Jitendra Deshpande, Michael Masters, Andrew Sheh
Section 2 (Wednesday 10:00-11:50am; Sage 3101), TAs: Jitendra Deshpande, Vi Nguyen, Patrick Willett
Section 3 (Tuesday 6:00-7:50pm; Sage 3101), TAs: Justin Chen, Mohit Oberoi, Stacy Schoenberg
Section 7 (Wednesday 4:00-5:50pm; Sage 3101), TAs: Justin Chen, Alan Merzon, Steve Hay

Note: Students must go to their assigned lab section. You may find it helpful to take a C++ reference book to the lab.

Lab

Labs begin the first week of class.

Lab solutions


Lectures

Code from class lectures: Class lecture handouts are available outside Amos Eaton 112.

Acknowledgment: Class lecture notes and code examples are based on those generously provided by Prof. Chuck Stewart.


Projects

Project handouts are available outside Amos Eaton 112.

Homeworks

Homework handouts are available outside Amos Eaton 112.

Exams


Announcements

Last updated Friday, May 10 at 5:30pm. Please check these announcements frequently.

Books

The required textbook is: The recommended optional textbook is:

Links


Srinivas Akella
Department of Computer Science
Rensselaer Polytechnic Institute
110 8th Street
Troy, NY 12180
Email: sakella@cs.rpi.edu