In this revision of a leading text, Mark Allen Weiss provides a concise, complete, and dynamic picture of many important data structures used in modern programming practice, with a focus on issues of performance and efficiency. 080539057XB04062001
--This text refers to an out of print or unavailable edition of this title.
| ||||||||||||||||||
Book Description
Editorial Reviews
From the Back Cover
080539057XB04062001 --This text refers to an out of print or unavailable edition of this title.
About the Author
Mark Allen Weiss is a Professor in the School of Computer Science at Florida International University. He received his Ph.D. in Computer Science from Princeton University where he studied under Robert Sedgewick. Dr.Weiss has received FIU's Excellence in Research Award, as well as the Teaching Incentive Program Award, which was established by the Florida Legislature to recognize teaching excellence. Mark Allen Weiss is on the Advanced Placement Computer Science Development Committee. 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.
080539057XAB04062001 --This text refers to an out of print or unavailable edition of this title.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
3 of 3 people found the following review helpful:
4.0 out of 5 stars
Data Structures and Algorithm Analysis,
By A Customer
This review is from: Data Structures and Algorithm Analysis (Hardcover)
this book provides a concise and fundamental look into algorithms. Excellent book if you want to learn performance time and running time on your written code and gives you the technique to speed up your code. It does not focus too much on what kind of programming language you use and it is to be read in a general sense.
2 of 3 people found the following review helpful:
4.0 out of 5 stars
Great for intermediate programmers,
By Pen Name "whiteaura" (milpitas, ca USA) - See all my reviews
This review is from: Data Structures and Algorithm Analysis (Hardcover)
I gave four stars because the author did a very good job of explaining algorithms. For example, he did a fantastic job of explaining the conversion of Infix Notation to Postfix Notation. Very nice to see a graphical step-by-step approach. Another good area was his break down of explaining how to derive the solution from a postfix equation. Again, nice usage of illustration step-by-step. I did not understand other author's datastructure book, but I did understand this one. I picked up this book only to learn Polish calculators (postfix/infix). Therefore, I did not read the other chapters. If the remaining chapters are as easily understandable as these two chapters, then I'll give 5 stars.
0 of 2 people found the following review helpful:
1.0 out of 5 stars
Not for the faint of heart,
By
This review is from: Data Structures and Algorithm Analysis (2nd Edition) (Hardcover)
I took a data strutures course that used this book. First you have to know C, not C++. You will be dealing with structs not classes. Know your pointers very well. The algorithms are covered are the general ones found in most textbooks dealing with algorithm analysis, but the examples provided are not complete and very vague. You have to rely completely on your instructor to spoon feed you the explanation and if your instructor sucks, then you are out of luck. There are much better textbooks, that take the time to give full explanations of the various interesting data structures out there. God bless and good luck to you if you are using this one for a DS course.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
Browse and search another edition of this book.
Browse and search another edition of this book.
First Sentence:
Suppose you have a group of N numbers and would like to determine the kth largest. Read the first page Key Phrases - Capitalized Phrases (CAPs): (learn more)
Information Processing Letters, New York, The Art of Computer Programming, Acta Informatica, Computing Surveys, Theory of Computing, Foundations of Computer Science, Journal of Algorithms, Dequeued Known, Englewood Cliffs, Prentice Hall, After Dequeue, Discrete Algorithms, Fundamental Algorithms, John Wiley, Proceedings of the Nineteenth Annual, After Union, Center Left, Color Black, Empty Table After, Improved Network Optimization Algorithms, Princeton University Press, Stanford University New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Suppose you have a group of N numbers and would like to determine the kth largest. Read the first page Key Phrases - Capitalized Phrases (CAPs): (learn more)
Information Processing Letters, New York, The Art of Computer Programming, Acta Informatica, Computing Surveys, Theory of Computing, Foundations of Computer Science, Journal of Algorithms, Dequeued Known, Englewood Cliffs, Prentice Hall, After Dequeue, Discrete Algorithms, Fundamental Algorithms, John Wiley, Proceedings of the Nineteenth Annual, After Union, Center Left, Color Black, Empty Table After, Improved Network Optimization Algorithms, Princeton University Press, Stanford University New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 36
books:
See all 36 books this book cites
37
books
cite this book:
See all 37 books citing this book
- Computer Programming by Johnson on page 211, page 339, and page 417
- The Design and Analysis of Computer Algorithms by Alfred V. Aho on page 40, page 145, and page 338
- Computer Science by R Baeza-Yates on page 146, and page 170
- Data Structures by Edward M. Reingold on page 146, and page 494
- Thinking Recursively by Eric S. Roberts on page 14
See all 36 books this book cites
- Computational Intelligence for Decision Support (International Series on Computational Intelligence) by Zhengxin Chen on page 42, page 339, and page 376
- Data Structures and Algorithms Using Visual Basic.NET by Michael McMillan on page 247, and Back Matter
- Data Structures and Algorithms (Software Engineering and Knowledge Engineering, 13) by Shi-Kuo Chang on page 150, and page 184
- Graph Drawing: 13 th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues) by Patrick Healy on page 164
- Perspectives of Systems Informatics: 5th International Andrei Ershov Memorial Conference, PSI 2003, Akademgorodok, Novosibirsk, Russia, July 9-12, ... Papers (Lecture Notes in Computer Science) by Manfred Broy on page 221
See all 37 books citing this book
Books on Related Topics
(learn more)
|
What Other Items Do Customers Buy After Viewing This Item?
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product).
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
