Semester and Year

Spring 2019

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 trade offs; e.g., recursion, divide and conquer, greedy algorithms, parallelizaton, etc. Advanced data structures and abstract data models; e.g. linked structures, array-based structures, hash tables, trees, graphs, sets, etc. Prerequisites: CS 128 and CS/MATH 136. Offered every year.

Download
Off-Campus Download

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

Share

COinS