CSCI 613 - Data Structures

Overview

Course Title

Data Structures

Department(s)

Description

Fundamental data structures and their implementations: stacks, queues, trees (binary and AVL), heaps, graphs. Hash functions and hash tables. Algorithms for searching, sorting, graph traversal, and topological sorting. Best, worst, and average-case runtime analysis. Examples of problem-solving using greedy algorithm, divide-and-conquer, and backtracking.

Typically Offered

Fall, Spring

Academic Career

Graduate

Credits

Minimum Units

3

Maximum Units

3

Academic Progress Units

3

Repeat For Credit

No

Components

Name

Lecture

Hours

3

Requisites

027336

Course Schedule