C++ Plus Data Structures with Navigate Advantage Access

Nell Dale received a B.S. in Mathematics and Psychology from the University of Houston, a M.A. in Mathematics, from the University of Texas at Austin, and a Ph.D. in Computer Sciences from the University of Texas at Austin. Nell Dale has been on the faculty at the University of Texas, Austin since 1975. She teaches occasionally but concentrates on computer science education, writing, traveling, tennis, and bridge -- and her family of course.Chip Weems is an Associate Professor of computer science at the University of Massachusetts at Amherst. He received his Bachelor's and Master's degrees from Oregon State University in 1977 and 1979, respectively. He received a Ph.D. from the University of Massachusetts in 1984. Over the last 23 years, he has taught courses in introductory programming, software engineering, computer architecture, and parallel processing. Since 1986 he has co-authored 13 textbooks that have helped over a million students learn to program computers. His books have been translated into French, Spanish, and Russian. He conducts research in computer architecture, compilers, parallel processing, and compiler-architecture co-optimization.

1. 5/5

   2011 C++ programming with arrays, lists, pointers

   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.

   Jim

   12 juli 2021