Semester and Year

Spring 2016

Dept

Computer Science

Course Number

354

Section Number

1

Course Catalog Description

Explores efficient programming through the study of alogrithms and data structures. Algorithm complexity analysis. Common patterns and tradeoffs; e.g., recursion, divide and conquer, greedy algorighms, parallelizaton, etc. Advanced date structures and abstract data models; e.g. linked structures, array-based structures, hash table, trees, graphs, sets, etc. Prerequisites: 128 and Math 136. Offered each fall.

Download
Off-Campus Download

Request a copy that is accessible using assistive technology (link opens in a new window)

Share

COinS