Page Tools:
  • print-friendly version

C++ Data Structures: A Laboratory Course, Third Edition

Author(s): Stefan Brandle, PhD, Taylor University, New York
James Robergé, PhD
Jonathan Geisler, PhD, Taylor University
David Whittington, Filtro Systems, Inc.
Details:
  • ISBN-13: 9780763755645
  • Paperback    173 pages      © 2009
Price: International Sales $61.95 US List
Add to Cart Request a Review Copy

Overview

C++ Data Structures: A Laboratory Course, Third Edition exemplifies the active learning experience. With a dynamic learn-by-doing focus, this laboratory manual encourages students to explore data structures by implementing them, a process through which students discover how data structures work and how they are applied. Providing a framework that offers feedback and support, this text challenges students to exercise their creativity in both programming and analysis. Each online laboratory consists of three parts: basic implementation and testing, programming exercises, and analysis exercises, which expertly guide students through every stage and urges them to think critically about their results.

Click HERE to download Student Resource Files including Source Code. 

ShowKey Features

All worksheet pages and appendix material are available online for instructors and students to utilize and print as needed.

More sophisticated use of templates is presented. Template specialization is introduced in the Expression Tree. Default template types and template template parameters are introduced in the Heap.

Lab order has been changed to be compatible with the order in most current textbooks. 

Each laboratory consists of three parts: basic implementation and testing, programming exercises, and analysis exercises. The basic implementation section explains the specific ADT, introduces the new C++ concepts, describes the ADT's properties, explains implementation details, and guides you through testing your implementation. In the three programming exercises, the first exercises is usually to apply or extend the concepts introduced in the basic implementation. The analysis exercise urges students to analyze a data structure in terms of its efficiency or use.

Back to top

ShowTable of Contents

Laboratory 1  Text ADT    

Laboratory 2  BlogEntry ADT

Laboratory 3  Array implementation of the List ADT 

Laboratory 4  Ordered List ADT    

Laboratory 5  Singly linked list implementation of the List ADT 

Laboratory 6  Stack ADT

Laboratory 7  Queue ADT

Laboratory 8 Expression Tree ADT
           

Laboratory 9 Binary Search Tree ADT 

Laboratory 10 Hash Table ADT        

Laboratoy 11 Heap ADT 

Laboratory 12 Weighted Graph ADT 

Laboratory 13 Performance Evaluation

         

 


Back to top

ShowAbout the Author(s)

Stefan Brandle, PhD-Taylor University, New York

Stefan Brandle, Ph.D., Taylor University

James Robergé, PhD

James Roberge earned his Ph.D. at Northwestern University. His research interests include medical imaging, computer visualization, and computer science education. 

Jonathan Geisler, PhD-Taylor University

David Whittington-Filtro Systems, Inc.

Back to top

ShowResources

Back to top
Stay Connected
Connect on facebook
Follow us on Twitter
Read our Blog