ITCS 2700 - Data Structures

Credit Hours: 4.00

Prerequisites: ITCS 2550 or ITCS 2620

This course provides students with a study of classical abstract data types (ADT). Emphasis will be placed on matching the appropriate data structures and algorithms to application problems. Object oriented structures such as linked lists, stacks, queues and trees will be developed. Algorithms such as hashing, searching and sorting, disjoint sets and graphing will also be implemented. Students will evaluate complexity theory (Big O) across these algorithms. This course assumes that students are already familiar with object oriented programming and dynamic data allocation using pointers.

Location: Center Campus

Contact Hours: 4
Billable Contact Hours: 4

OUTCOMES AND OBJECTIVES
Outcome 1: Upon completion of this course, students will be able to outline behaviors and properties of abstract data types.

Objectives:

Use Linked lists, stacks and queues to solve problems.
Use Hashing and Trees to solve problems.
Use sorting, disjoint sets and graphing algorithms to solve problems.

Outcome 2: Upon completion of this course, students will be able to assess complexity of an algorithm based upon a specific criterion.

Objectives:

Discuss Big O notation including its implications
Differentiate complexity based upon various criteria

Outcome 3: Upon completion of this course, students will be able to design and implement fundamental data structures and algorithms.

Objectives:

Develop structures based upon the classical ADT models
Apply the classical algorithms to the listed Data structures.

Outcome 4: Upon completion of this course, students will be able to compare and contrast the operation of common data structures in terms of complexity and data structures that they implement.

Objectives:

Evaluate structures based upon the classical ADT models
Compare complexity of algorithms and data structures

Outcome 5: Upon completion of this course, students will be able to solve problems within the discrete math.

Objectives:

Identify the discrete math models.
Describe Graph Theory including trees, number and set theory.
Explain the use of Recursion in the algorithms.

COMMON DEGREE OUTCOMES
(Bulleted outcomes apply to the course)

1. The graduate can integrate the knowledge and technological skills necessary to be a successful learner.

2. The graduate can demonstrate how to think competently.

3. The graduate can demonstrate how to employ mathematical knowledge.

4. The graduate can demonstrate how to communicate competently.

5. The graduate is sensitive to issues relating to a diverse, global society.

COURSE CONTENT OUTLINE

Discrete Math Review
Algorithm Analysis
Lists, Stacks, Queues
Trees
Hashing
Priority Queues
Sorting
Disjoint Sets
Graph Algorithms

Primary Faculty
Schleis, George
Secondary Faculty

Associate Dean
Evans-Mach, Patrick
Dean
Balsamo, Michael

Official Course Syllabus - Macomb Community College, 14500 E 12 Mile Road, Warren, MI 48088