CS 235 - Data Structures

CS 235 provides a hands-on introduction to data structures and algorithms. Through programming projects and exams, you learn how to select and implement suitable data structures for various problems, how and when to use recursion, and how to analyze the cost of algorithms, especially sorting and searching algorithms.

We will study the following topics:

Fundamental data types used in computing (lists, stacks, queues, priority queues, sets, maps, binary trees, trees, etc.)
Common techniques for implementing the fundamental data types (sequential structures, linked lists, binary search trees, hash tables, heaps, etc.) and the implementation(s) of several of them
Proper use and selection of data structures from language-provided data-structure libraries
Basic algorithmic analysis
Recursion
Making informed decisions related to sorting and searching algorithms

Office Hours:

Dr. Jacob Crandall (3326 TMCB): Tuesday from 2-2:50pm and Wednesday from 2-3pm; (email: crandall@cs.byu.edu)
TA's (1058 TMCB): TA hours; (Email: cs235ta@cs.byu.edu - note that contacting TAs using this email address is unreliable as it is monitored only sporadically. You can try it, but it is probably better to go see them in person.)
TA Help Queue