Bokus
Nell Dale, Chip Weems, Tim Richards - C++ Plus Data Structures with Navigate Advantage Access, Häftad

Häftad, Engelska, 2016

C++ Plus Data Structures with Navigate Advantage Access

Av Nell Dale, Chip Weems, Tim Richards

2277 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Beskrivning
C++ Plus Data Structures, Sixth Edition explores the specifications, applications, and implementations of abstract data types with unmatched accessibility. Topics such as modularization, data encapsulation, information hiding, object-oriented decomposition, algorithm analysis, life-cycle software verification models, and data abstraction are carefully presented to foster solid software engineering techniques.NEW amp KEY FEATURES OF THE SIXTH EDITION:•UPDATED – Updated with new C++ features including range-based for loops and threads•NEW – Includes a new Chapter , Trees Plus, that emphasizes balancing of search trees by covering AVL Trees, Red-Black Trees, and B-Trees•NEW – Includes a new chapter on Sets, Maps, and Hashing•NEW – Chapter 2, Sorting, now includes practical performance issues and parallel merge sort•NEW – Chapters in the second half of the text are now easier to assign in alternate orders, supporting a wider range of course goals and organizations•NEW – Modern new design enhances the look and feel of the text•STUDENT FAVORITE – Pedagogical features include: chapter openers with goals, marginal definition boxes, algorithm boxes, C++ boxes, function boxes, case studies, chapter summary, and end of chapter exercises
Produktinformation
  • Utgivningsdatum: 2016-09-09
  • Mått: 188 x 236 x 38 mm
  • Vikt: 1 446 g
  • Format: Häftad
  • Språk: Engelska
  • Antal sidor: 838
  • Upplaga: 6
  • Förlag: Jones and Bartlett Publishers, Inc
  • ISBN: 9781284089189
Utforska kategorier
Betyg & recensioner

1 recensioner, genomsnitt 5/5

  1. 5/5 Jim

    The book is written for students who need to develop fluency using pointers while implementing simple, basic data structures, using C++, roughly corresponding to CS2 in the old ACM curriculum.

    Reading and mastering the book and writing lots of C++ code is plenty of work for a CS2 course.

    A CS2 course is often followed by a more thorough course on data structures, with more of an emphasis on proving properties of list and graph algorithms, that require the skills in [C++] programming with pointers developed in this book.

    -

    For C++ programmers who have used pointers, the textbook "Data Abstraction & Problem Solving with C++: Walls and Mirrors" by Frank M Carrano and Timothy Henry covers data structures with greater depth and more challenging exercises. Its last edition was in 2016, so presumably it uses C++14.

    -

    At a more advanced level, Mark A. Weiss's "Data Structures and Algorithm Analysis" provides references to classic and contemporary research papers on data structures. Like Carrony/Henry, Weiss's book is ca. three times more expensive as Dale/Weems/Richards. Weiss's book could also be used for a basic course on algorithm analysis.

    A Chalmers student who has a course using Weiss would do well to study this book (during the summer or winter vacations) first.

    The book appears to use 2011's C++11 (not using e.g., the "auto" facilities of 2014's C++14).

    -

    A more advanced textbook with more focus on algorithms is "Data Structures and Algorithms in C++", 2nd Edition, by Michael T. Goodrich, Roberto Tamassia, David M. Mount. Readers may decide whether an algorithms textbook should use C++ or pseudocode.

    -

    Readers should also consider the textbook, "Data Structures and Algorithm Analysis" (C++ Version), 3rd ed., by Clifford A. Shaffer, which is available as a printed book from Dover, the frugal reprint publisher. It is also freely as a pdf and as an HTML. The on-line version is used at Linköping University.