Data Structures for Cross-Disciplinary Minors
Overview
Subject area
CSCI
Catalog Number
314
Course Title
Data Structures for Cross-Disciplinary Minors
Department(s)
Description
Open only to students enrolled in a cross-disciplinary minor sponsored by the Computer Science Department. Fundamental data structures and their implementations: stacks, queues, trees (binary and AVL), heaps, graphs, hash tables. Searching and sorting algorithms. Runtime analysis. Examples of problem-solving using greedy algorithm, divide-and-conquer, and backtracking.
Typically Offered
Fall, Spring
Academic Career
Undergraduate
Liberal Arts
Yes
Credits
Minimum Units
3
Maximum Units
3
Academic Progress Units
3
Repeat For Credit
No
Components
Name
Lecture
Hours
3
Requisites
010198