Search | Directories | Reference Tools
UW Home > Discover UW > Student Guide > UW Bothell Course Catalog 

Instructor Class Description

Time Schedule:

Robert C Shields
CSS 342
Bothell Campus

Data Structures, Algorithms, and Discrete Mathematics I

Integrating mathematical principles with detailed instruction in computer programming. Explores mathematical reasoning and discrete structures through object-oriented programming. Includes algorithm analysis, basic abstract data types, and data structures. Prerequisite: minimum grade of 2.5 in CSS 162; B CUSP 124; may not be repeated.

Class description

This sequenced course integrates mathematical principles with detailed instruction in computer programming. Topics include presentation of formal arguments to prove mathematical statements; development of algorithms; sorting and searching; algorithm analysis; object-oriented programming; basic abstract data types including lists, stacks, queues, and binary trees. Prerequisites: Calculus, two quarters programming. class Website:

Student learning goals

See class website for syllabus, etc.

General method of instruction

Recommended preparation

Class assignments and grading

The information above is intended to be helpful in choosing courses. Because the instructor may further develop his/her plans for this course, its characteristics are subject to change without notice. In most cases, the official course syllabus will be distributed on the first day of class.
Last Update by Robert C Shields
Date: 09/21/2013