C S 235

Download as PDF

Data Structures and Algorithms

Computer Science College of Physical and Mathematical Sciences

Course Description

Fundamental data structures and algorithms of computer science; basic algorithm analysis; recursion; sorting and searching; lists, stacks, queues, trees, hashing; object-oriented data abstraction.

When Taught

Fall, Winter, Spring

Min

3

Fixed

3

Fixed

3

Fixed

0

Title

Data Computing Fundamentals

Learning Outcome

Use the fundamental data types of computing (lists, stacks, queues, priority queues, sets, maps, trees, etc.).

Title

Implementing Fundamental Data Types

Learning Outcome

Understand the major techniques for implementing the fundamental data types (linked lists, binary search trees, hashing, heaps, etc.) and implement several of them.

Title

Select Data Structures

Learning Outcome

Properly use and select data structures from language-provided data-structure libraries.

Title

Analysis

Learning Outcome

Apply basic algorithm analysis.

Title

Recursion

Learning Outcome

Understand how recursion works and write programs using recursion to solve problems.

Title

Usage of Algorithms

Learning Outcome

Make informed decisions about which sorting and searching algorithms to use in specific circumstances.

Title

Program Writing

Learning Outcome

Write programs that require ~500 lines of code.