COSC-173 Data Structures

Faculty:

Kalyanasundaram, Bala

This course is designed as a second year course for majors and minors and covers basic data structures and algorithm analysis. Starting with the art and science of analyzing algorithms, the main goal of this course is to learn various techniques for organizing data so that computer programs can access, modify, and delete data efficiently. Topics covered include basic data structures (for example, lists, stacks and queues), trees, hashing, heaps, disjoint sets, and graphs, self-adjusting data structures; worst-case, average-case, and amortized analysis; and basic problem solving techniques. The topics are theoretical in nature but have dramatic impact in practice. Prerequisites: COSC-072 and -127.

Credits: 3

Prerequisites: COSC 072 COSC 127

Other academic years
There is information about this course number in other academic years:

• 2004-2005 Fall and Spring
• 2005-2006 Fall and Spring
• 2007-2008 Fall and Spring
• 2008-2009 Fall and Spring
• 2009-2010 Fall and Spring
• 2010-2011 Fall and Spring

More information
Look for this course in the schedule of classes.

The academic department web site for this program may provide other details about this course.