Data Structures

Hours

3.0 Credit, 3 Lecture, 0 Lab

Semester

Fall

Programming concepts for IS majors pursuing careers in software development. Concepts include lists, stacks, queue, maps, and other structures; sorting and other algorithms; recursion; and computational complexity analysis.

Essential Concepts

Students will be able to explain essential concepts in data structures and algorithms.

Critical Thinking

Students will develop critical thinking skills through solving programming problems.

Written and Verbal Communication

Students will be able to identify the best data structure and algorithm to be used to solve a given problem and then implement and validate your solution. Be able to show that your solution is optimal with regard to specific measures of quality or suitability.