CSCI070 HM - Data Structures and Program Development

Credit(s): 3

Instructor(s): Breeden, Medero, O'Neill, Stone, Talvitie, Trushkowsky

Offered: Fall and Spring

Description: Abstract data types including priority queues and dynamic dictionaries and efficient data structures for these data types, including heaps, self-balancing trees, and hash tables. Analysis of data structures including worst-case, average-case and amortized analysis. Storage allocation and reclamation. Secondary storage considerations. Extensive practice building programs for a variety of applications.

Prerequisite(s): (CSCI060 HM  or CSCI042 HM ), and at least one mathematics course at the level of calculus or higher; MATH055 HM  recommended

This course information is from the 2023-2024 Catalog. View this publication.
Print this page.