COURSE DESCRIPTION

Data Structures is a course in which you will discuss and experiment with many ways to manipulate data in the structures that exist in the programming language C++. Data structures are an important way of organizing information in a computer. Each data structure has unique properties that make it well suited to give a certain view of the data.

Please be aware that Data Structures is a challenging course. No basic C++ language is taught in this course, so you must know C++ programming language before you begin.

COURSE OBJECTIVES

After completing this course, you should be able to:

1. Describe the activities in the software life cycle.
2. Explain what is meant by abstract data types (ADTs) and data encapsulation.
3. Describe the abstract data type List at a logical level.
4. Explain the use of Big-O notation to describe the amount of work done by an algorithm.
5. Describe stacks and queues and their operations at a logical level.
6. Implement stack, queue, unsorted list and sorted list ADT as a linked list structure.
7. Distinguish between shallow and deep copying.
8. Discuss recursion as another form of repetition.
9. Define a binary search tree at the logical level.
10. Show how an arithmetic expression can be stored in a binary tree.
11. Design and implement sorting algorithms.

COURSE STRUCTURE

Data Structures is a three-credit online course, consisting of six (6) modules. Modules include an overview, study materials, and activities. Module titles are listed below.

1. Module 1: Overview of Principles, Design, and Implementation
2. Module 2: Lists, Stacks, and Queues
3. Module 3: Linked Lists
4. Module 4: Recursion
5. Module 5: Binary Trees and Other Branched Structures
6. Module 6: Sorting and Searching Algorithms

Consult the course Calendar for assignment due dates.