CSC 203: Data Structures & Algorithms

Download as PDF

Class Program

Computer Science

Credits

Clinical Hours None

Weekly Contact Hours

Course ID

092454

Meets Degree Requirements For

Restricted Elective

Description

Introduces the fundamental concepts of classic data structures with associated algorithms. Topics include recursion, searching and sorting lists (arrays, linked lists, stacks, queues, vectors), algorithmic analysis, big O notation, expression parsing, binary search operations, heaps, priority queues, other types of trees, Huffman encoding, toolbars, hash tables, and graphs.

Grading Basis

Graded

Prerequisites

CSC 202 or CSC& 142

Course Learning Outcomes

Implement certain algorithms recursively and non-recursively.

Implement classic data structures in memory, and apply their associated algorithms.

Create classes for reuse in programming environments.

Explain where each basic data structure provides an advantage in a software solution.

Identify the best, average, and worst case behaviors for an algorithm.

Describe the work an algorithm does in terms of big O, omega, and theta notation.

Core Topics

Fundamental data structures: stacks, queues, linked lists, hash tables, trees, graphs
Fundamental computing algorithms: searching, sorting, traversing , hash tables, binary search trees, depth- and breadth-first traversals
Practical applications of data structures: record storage, process queues, expression parsing, Huffman encoding, networks
- Basic algorithm analysis: Asymptotic analysis of upper and average complexity bounds; identifying best, average, and worst case behaviors; big O, little o, omega, and theta notation