CPSC 327: Data Structures and Algorithms
Spring 2006


Stina Bridgeman
Lansing 312, x3614

Course Description

At the heart of computer science is the development of efficient algorithms for solving problems, and the choice of data structure to implement that algorithm can have a significant impact on the simplicity and efficiency of a program.

This course continues the study of data structures, their applications, and the algorithms associated with them. Topics include abstract data types, dictionaries, graphs, searching, and sorting. The design and analysis of algorithms is also covered, with topics such as efficiency and complexity, NP-completeness, dynamic programming, and amortized analysis.

Office Hours

M 1-2pm, W 4-5:30pm, Th 9:30-11am, F 1:30-2:30pm
or by appointment (schedule)

Class Hours and Meeting Place

MWF 11:15am-12:10pm
Lansing 300

Course Links


[1/16] Welcome to CPSC 327! This web page is your source for a great deal of important and useful material, so you should take a few minutes to familiarize yourself with the website. Check back often for announcements and new information.

Valid HTML 4.01!