Ebook Info
- Published: 2010
- Number of pages: 448 pages
- Format: PDF
- File Size: 1.80 MB
- Authors: Alfred Aho
Description
The authors’ treatment of data structures in Data Structures and Algorithms is unified by an informal notion of “abstract data types,” allowing readers to compare different implementations of the same concept. Algorithm design techniques are also stressed and basic algorithm analysis is covered. Most of the programs are written in Pascal.
User’s Reviews
Editorial Reviews: From the Back Cover The authors’ treatment of data structures in “Data Structures and Algorithms” is unified by an informal notion of “abstract data types,” allowing readers to compare different implementations of the same concept. Algorithm design techniques are also stressed and basic algorithm analysis is covered. Most of the programs are written in Pascal.
Reviews from Amazon users which were colected at the time this book was published on the website:
⭐This review applies to both books by these authors: It applies to “The design and analysis of computer algorithms”; and it applies to “Data structures and algorithms”.The CONTENT of the books is wonderful; marvelous; and if you learn it you will be on your way to be a great computer scientist.The PRINTING, by once great but now low quality Addison-Wesley… is a whole other matter. The book binding is almost ripping after 2 weeks of reading; the paper is garbage, and the ink is also very poor.Wonderful books to have. Perhaps in digital form; but not these garbage Addison-Wesley copies. These are pretty lame.
⭐Pros:-Covers a lot-Good for self-motivated study, if using with other references-Illustrations are good for overall data structuresCons:-Doesn’t provide full implementations of most data structures-Dense text, the author often takes a lot of words to say little-At the same time, the author does not spend enough time on certain data types-Along with actually implementing more methods, illustrations of methods would help-If you don’t have a strong math background, explanations of algorithms will go right over your head
⭐I’ve read about more than a third of this good book. The book carefully integrate learned features into later developments in the text. You get a good basic understanding that’s later on become more advanced as you pave through the material. Each chapter has excercices with no solution manual which is the only flaw of the book in my opinion.
⭐The book was very clean and looked like new. Now if I could just comprehend the contents, all would be good. 😉
⭐how else can one report an error in the website description?epic book 5 stars – poor website description
⭐I found this book to be detailed and very good at explaining things. I was able to teach myself the concept of time complexity and working through algorithms
⭐Well written and nice explanations.
⭐A classic.
⭐Main Reason for low review –> Outdated TextbookUnlike some field like mathematics, Computer Science is an evolving field. Therefore textbooks need to be kept updated. Writing in some esoteric language like Pascal which noone uses isn’t solving anybody’s data structure problem.Further the book is heavily cited, but thats because good data structures books were not there in the past. Today, all of the data structures used here are common folklore. Go for this book only as reference to help you with other textbooks. Do not use this as your first textbook.Overall:Buy this book if you are a computer science geek and you want to read directly about data structures directly from the source of some of those data structures. This is not first or second textbook material.For data structures, there are several texts that can refer to before this one. For starters choose one in the language that you use. Sahni Horowitz, Goodrich and Balagurusamy are for example more up to date and easier to learn from in my opinion.If you want algorithms, there is very little in this book – CLRS, Tardos, Sedgewick or Roughgarden are better.
⭐One of the best classics for getting started with data structures! Definitely should be in your have-read list!Pros:1. Theoretical aspects (proofs, etc.) have been addressed as and when required.2. Clear and concise explanation style.3. Many linear & non-linear data structures have been addressed here. After this book, you should consult “Introduction to Algorithms by CLRS” for further reading.
⭐Este libro es otro clásico que me fue muy útil durante mis años de estudiante, y que todavía me sirve. Tiene muchos ejemplos únicos, que solamente pueden encontrarse aquí, y sobre todo, explicados de una manera muy didáctica.A good book but its examples are implemented in pascal, which causes problems as mostly, students learn C, python or C++ as a beginning language. Buy only if you want to have some theoretical knowledge of data structures and if you can grasp the programs and examples in pascal.
⭐Classic book, and great on the content. Paves the way to think innovatively on algorithms; it is not the coverage itself, but what actually goes in at a principle-level to design/define an algorithm; that makes this book so great.
Keywords
Free Download Data Structures and Algorithms 1st Edition in PDF format
Data Structures and Algorithms 1st Edition PDF Free Download
Download Data Structures and Algorithms 1st Edition 2010 PDF Free
Data Structures and Algorithms 1st Edition 2010 PDF Free Download
Download Data Structures and Algorithms 1st Edition PDF
Free Download Ebook Data Structures and Algorithms 1st Edition