ISTC 2050 - Data Structures

3 Credits
Prerequisites ISTC 1300

This course introduces the student to the theory, design, and implementation of common data structures and related algorithms. Topics include linked lists, recursion, stacks, queues, search algorithms, sorting algorithms, graphs, and binary trees. Students will write numerous programs to demonstrate comprehension of the course topics.

Learning Outcomes
Understand complexity analysis and Big O notation.

Understand recursive solutions and their applications.

Compare and contrast searching and sorting algorithms.

Choose the appropriate data structure for modeling a given problem.

Define and use common Abstract Data Types (ADT)