Algorithms, Data Structures, and Problem Solving With C++
| Author | : | |
| Rating | : | 4.63 (818 Votes) |
| Asin | : | 0805316663 |
| Format Type | : | paperback |
| Number of Pages | : | 820 Pages |
| Publish Date | : | 0000-00-00 |
| Language | : | English |
DESCRIPTION:
Good, but needs improvement A Customer I just finished a semester at the University of Texas at Austin in which this book was the text book for an abstract data types class. The book is a good textbook, but not a good desk reference. The book is obviously written with students in mind, using rhetorical questions, leaving vital areas unexplained as "exercises for the reader", etc. As an introductory text, in an introductory class, the book served its purpose, though the professor was required to explain some of the details that the book lacked. The co. A Customer said Thorough, but NOT for people new to advanced data structures. This book is very thorough, but thats really all I can tell you about it's content, because the material (both the algorithm analysis and the data structures material), is presented in such a way as that the author expects you to already have a basic understanding of these concepts. Worst yet, the author's code is extremely poorly documented. Stay away from this book if you are new to advanced data types or algorithm analysis.. "This is one book every C++ Programmer should purchase." according to A Customer. This book should be on every C++ programmers list. Of all the books I've read on Data Structures and Algorithms using the C++ language this is the most comprehensive. This book also built my knowledge on the C++ language. I look forward to reading more books by this author.
C++ code is complex, and readers will need to see complete examples to understand some of the finer points. Initially, the basic binary search tree is shown, and then a binary search tree that supports order statistics is derived. However, establishing some of our claims requires proof; Chapters 7 and 18 through 23 require some degree of mathematical sophistication. Appendix A contains a review of this material. In any event, this textbook is not about C++; it is about data structures and algorithm design, which is the proper focus of a CS-2 course. Two of these are:Use the corresponding implementations in Part IV as each data structure is described.
Contains optional advanced material in Part V. * Covers classes, templates, and inheritance as fundamental concepts in sophisticated C++ programs. * Incorporates case studies such as expression evaluation, cross-reference generation, and shortest path calculations. The interface and running time of data structures are presented first, and students have the opportunity to use the data structures in a host of practical examples before being introduced to the implementations. Code is integrated into the book and also available by ftp. * Gives the instructor flexibility in choosing an appropriate balance between practice, theory, and level of C++ detail. Experienced author and teacher Mark Allen Weiss now brings his expertise to the CS2 course with Algorithms, Data Structures, and Problem Solving with C++, which introduces both data structures and algorithm design from the viewpoint of abstract thinking and problem solving. * Includes end-of-chapter glossaries, summaries of common errors, and a variety of exercises. This unique approach enhances the ability of students to think abstractly.Features * Retains an emphasis on data structures and algorithm design while using C++ as the language of im
Mark Allen Weiss is on the Advanced Placement Computer Science Development Committee. He received his Ph.D. He is the successful author of Algorithms, Data Structures, and Problem Solving with C++ and the series Data Structures and Algorithm Analysis in Pascal, Ada, C, and C++, with Addison-Wesley. 0805316663AB04062001 . Mark Allen Weiss is a Professor in the School of Computer Science at Florida International University. in Computer Science from Princeton University where he s