Skip to Main Content

CISC 230

Download as PDF

Data Structures and Algorithm Analysis

Academic Level

Undergraduate

Course Title

Data Structures and Algorithm Analysis

Description

This course covers performance analysis and measurement of programs, formal induction proofs, asymptotic notation, algorithm analysis, hashing, binary trees, binary search trees, balanced search trees, graphs, biconnected components, spanning trees, and shortest path algorithms. Prereq. - CISC 125. Offered fall semester only.

4

Repeatable for Additional Credit

No

Prerequisites and Corerequisites

Prerequisite: CISC125

This course is an approved AA/AS elective

Yes

This course is an approved AAS elective

Yes

Honors Section Available

No