Data Structures 
DATA STRUCTURE 
CLASS CODE: 
CS 235 
CREDITS:
3

DIVISION: 
PHYSICAL SCIENCE & ENGINEERING 
DEPARTMENT: 
ELECTRICAL & COMPUTER ENGINEERING 
GENERAL EDUCATION: 
This course does not fulfill a General Education requirement. 

CATALOG DESCRIPTION: 
Abstraction, recursion, introduction to algorithm analysis, list structures, binary trees, sorting and graphs. 
DESCRIPTION: 
Builds on the foundation of CS 124 and CS 165 to introduce the fundamental concepts of data structures and the algorithms that proceed from them. 
TOPICS: 
Abstract Data Types; Recursion; What is Algorithm Analysis; List Structures; Searching; Sorting; Trees; Graphs. 
OBJECTIVES: 
Use and implement the fundamental abstract data types necessary to solve algorithm problems efficiently. Identify data structures that could be used to represent spedcific types of information and discuss tradeoffs among the different possibilities. Write programs that use arrays, classes, strings, linked lists, stacks, queues, has tables, binary trees, graphs. Describe how these data structures are allocated and represented in memory. Solve problems using sequential search, binary tree search, sorting algorithms, and fundamental graph algorithms. Explain the concept of recursion and how it applies to the structure of the divideandconquer approach. Write, test, and debug recursive functions. Describe how recursion can be implemented using a stack. Determine the time complexity of simple algorithms. 
REQUIREMENTS: 
Access to computers in the Linux computer lab is required to complete homework. 
PREREQUISITES: 
CS 165 
OTHER: 

EFFECTIVE DATE: 
August 2001 