Data Structures and Software Reusability in C++: Using Class Libraries

Dive Into® Series Data Structures and Software Reusability in C++:
Using Class Libraries

C++ How to Program
Fifth Edition

An intensive 5-day data structures course in C++. This course is for practicing C++ programmers. The course includes extensive code walkthroughs. The course uses the C++ capabilities of dynamic memory allocation, recursion, pointers, data abstraction, classes, composition, inheritance, templates, polymorphism and exceptions to provide a fundamental grounding in the creation and manipulation of key data structures used in writing systems software and applications software. The course features live-code demonstrations of using the C++ Standard Template Library. The course offers extensive laboratory experience. Solutions are provided for laboratory exercises. 60% lecture and 40% laboratory exercises.

Prerequisites

General familiarity with your operating system environment
Ability to create and edit text files
Program in C++ at the level of C++ and Object-Oriented Programming (for C Programmers)

Course Objectives

Compare, contrast, and code searching techniques (linear and binary) and sorting techniques (interchange, bubble, shell, bucket, merge, and address calculation sorts)
Allocate and free storage dynamically with new and delete
Create and manipulate linked lists
Understand and code linked-list operations such as list searching, insertion and deletion
Create singly-linked lists, multithreaded linked lists, circular linked lists, and indexed linked lists
Understand iterator classes
Create and manipulate queues and priority queues
Understand and code queue operations enqueue and dequeue
Create and manipulate stacks
Understand and code stack operations push, pop, isEmpty and isFull
Understand recursion and its relationship to stacks
Understand and code the quicksort algorithm
Understand infix, prefix, and postfix expression notation
Code infix-to-postfix conversion and postfix evaluation algorithms
Create and manipulate binary search trees used for high-performance sorting and searching
Understand and code tree operations such as insertion and preorder, inorder, and postorder recursive tree traversals
Understand and code heaps and heapsort
Create and manipulate generalized graph data structures
Understand and code the adjacency-list and adjacency-matrix representations of graphs
Code the depth-first search graph algorithm
Determine the connected components of a graph
Determine the nodes reachable from a given node in a graph
Understand the B-Tree data structure and its application to high-speed information retrieval (direct-access file processing)

For more information about this course, please e-mail us or call (978)-823-0130.

Please Note: There is no additional cost for customizing course curriculum or outlines.