POWERPOINT SLIDES

COURSE: CMSC 208 DM1 Computer Science II

TEXTS: Data Abstraction and Structures Using C++,

by Headington and Reilly, D.C. Heath Publ.(1994)

and, Data Structures in C++: A Laboratory Course,

by Roberge, D.C. Heath Publ.(1995)

H&R CHAPTER

TITLE

 TOPICS

1

Control Abstraction

Functions, Parameters, Stubs, Loop Invariants

2

Modules and Information Hiding

Specification and Implementation Files, Random Number Generators, Library Functions

3

Data Abstraction Through Classes

Information Hiding, Constructors

4

Introduction to Data Structures

Lists, Stacks, Queues

5

C++ Records (structs)

Aggregate Operations, Array of structs

6

Recursion

Base Case and General Case

7

Pointers and Dynamic Data

Pointer Variables, Null Pointer, Dereference Operator, new, delete, Dynamic Array Allocation

8

Linked Lists

Dynamic Allocation of Nodes, Singly Linked Lists, Recursive Traversal

9

Design and Implementation of Abstract Data Types

Copy Constructor, Destructor, Stack, Queue

12

Algorithm Efficiency, Searching, and Sorting

Big-O Notation, Linear and Binary Search, Hashing, Quicksort

13

Binary Trees

Binary Expression Trees

13-BST

Binary Search Trees

Searching, Traversals

[ CCBC-Essex Home Page | Sylvia Sorkin's Homepage ]
Last updated: Nov. 4, 1999