Georgetown University home page Search: Full text search Site Index: Find a web site by name or keyword Site Map: Overview of main pages Directory: Find a person; contact us About this site: Copyright, disclaimer, policies, terms of use Georgetown University home page Home page for prospective students Home page for current students Home page for alumni and alumnae Home page for family and friends Home page for faculty and staff Georgetown University Search: Full text search Site Index: Find a web site by name or keyword Site Map: Overview of main pages Directory: Find a person; contact us About this site: Copyright, disclaimer, policies, terms of use
Navigation bar Navigation bar
spacer spacer spacer spacer
border
spacer spacer spacer
border
spacer spacer

COSC-173 Data Structures

COSC-173 Data Structures
Fall only
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:
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.
spacer spacer
Navigation bar Navigation bar