Atjaunināt sīkdatņu piekrišanu

Cplusplus Data Structures: a Laboratory Course: A Laboratory Course 3rd New edition [Mīkstie vāki]

1.67/5 (6 ratings by Goodreads)
, , ,
  • Formāts: Paperback / softback, 174 pages, weight: 425 g
  • Izdošanas datums: 07-Mar-2008
  • Izdevniecība: Jones and Bartlett Publishers, Inc
  • ISBN-10: 0763755648
  • ISBN-13: 9780763755645
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 140,55 €
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
Cplusplus Data Structures: a Laboratory Course: A Laboratory Course 3rd New editionPalielināt
  • Formāts: Paperback / softback, 174 pages, weight: 425 g
  • Izdošanas datums: 07-Mar-2008
  • Izdevniecība: Jones and Bartlett Publishers, Inc
  • ISBN-10: 0763755648
  • ISBN-13: 9780763755645
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9780763755645.html
C++ Data Structures: A Laboratory Course 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 can be applied. Providing a framework that offers feedback and support, this text challenges students to exercise their creativity in both programming and analysis. Topics covered include: Text ADT, BlogEntry ADT, Stack ADT, Heap ADT, Weighted Graph ADT, and much more!

A&P Binding: PB Saleable
Preface vii
Text ADT
1(14)
Focus: Implement an ADT using a C++ class, introduce a number of foundational C++ concepts used in ADT implementation, and an array implementation of a delimited character string
Application: Lexical analysis
BlogEntry ADT
15(14)
Focus: Implement a blog entry class and continue introduction of foundational C++ concepts used in ADT implementation
Application: Generate an HTML representation of a data structure's contents
Array Implementation of the List ADT
29(14)
Focus: Array implementation of a list
Application: Analyzing DNA sequences
Ordered List ADT
43(14)
Focus: Array implementation of an ordered list using inheritance
Application: Assembling messages in a packet switching network
Singly Linked List Implementation of the List ADT
57(12)
Focus: Singly linked list implementation of a list
Application: Slide show program
Stack ADT
69(14)
Focus: Array and singly linked list implementations of a stack
Application: Evaluating postfix arithmetic expressions
Queue ADT
83(10)
Focus: Array and singly linked list implementations of a queue
Application: Simulating the flow of customers through a line
Expression Tree ADT
93(14)
Focus: Linked implementation of an expression tree
Application: Logic circuits
Binary Search Tree ADT
107(14)
Focus: Linked implementation of a binary search tree
Application: Indexed accounts database
Hash Table ADT
121(12)
Focus: Hash table implementation with chaining
Application: Development of a perfect hash
Heap ADT
133(16)
Focus: Array implementation of a heap
Application: Simulating the flow of tasks in an operating system using a priority queue
Weighted Graph ADT
149(16)
Focus: Adjacency matrix implementation of the Weighted Graph ADT
Application: Computation of Shortest paths
Performance Evaluation
165
Focus: Determining execution times
Application: Analyzing the execution times of sorting and searching routines
Stefan Brandle, Ph.D., Taylor University

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