Data Structures and Their Algorithms 1st Edition by Harry R. Lewis (PDF)

4

 

Ebook Info

  • Published: 1991
  • Number of pages: 528 pages
  • Format: PDF
  • File Size: 24.87 MB
  • Authors: Harry R. Lewis

Description

This book in an all-inclusive presentation introduces the datastructures (and their algorithms) that comprise the foundationof software engineering. Designed to show students at the sophomorelevel the connection between a programming approach and mathematicaltheory, the text focuses on practical techniques for studentsto master data structures and efficient algorithm implementation.Other topics pertinent to programmers also receive coverage. Chapter-endingproblems and references give students a helpful review and solidifychapter concepts. 067339736XB04062001

User’s Reviews

Editorial Reviews: From the Back Cover This book in an all-inclusive presentation introduces the datastructures (and their algorithms) that comprise the foundationof software engineering. Designed to show students at the sophomorelevel the connection between a programming approach and mathematicaltheory, the text focuses on practical techniques for studentsto master data structures and efficient algorithm implementation.Other topics pertinent to programmers also receive coverage. Chapter-endingproblems and references give students a helpful review and solidifychapter concepts. 067339736XB04062001

Reviews from Amazon users which were colected at the time this book was published on the website:

⭐old text book, but a lot of details on pseudo code of algorithms in data structures.

⭐I never really appreciated this book until many years after graduating from college. I had this in my library just sitting around. The data structures course I took in school was completely uninspiring. However, when it came to researching and implementing appropriate data structures for my own software, I didn’t realize how comprehensive this book is. It covers more algorithms and in greater detail than the ever popular Cormen book. The pascal-like examples are very thorough. There are times when code is not provided, but it gives you enough detail to extrapolate from what is already there to get started.

⭐One of the best ways to discover the strengths and weaknesses of a textbook is to teach a course using it. A few years ago I taught a senior-level course on Data Structures using this book. The book was a joy to teach from, and I would happily use it again — I thought it was one of the nicest textbooks I’ve ever used.(In case you haven’t figured it out from the above paragraph, I believe that Paul Schreiber’s review of this book is far too negative.)

⭐This is one of the 2 texts we’ve had for our data structures course. I’m not sure what the other book is, because this one was so good. It covered the material in a clear and precise way. I even have a copy of this book today, for further reference!

⭐I seriously like this book. It’s explaining is close to crystal clear to me when I read it, and the algorithms listed (in pseudo-code) take it to a practical level.

⭐In this book, Lewis and Denenberg attempt to explain data structures and associated algorithms. They rely too heavily on obscure proofs, have few, if any worked-out examples and many ambiguously worded questions. Their assesrrtion that a “high school” math background is needed is clearly false. The book also suffers from poor typesetting.

Keywords

Free Download Data Structures and Their Algorithms 1st Edition in PDF format
Data Structures and Their Algorithms 1st Edition PDF Free Download
Download Data Structures and Their Algorithms 1st Edition 1991 PDF Free
Data Structures and Their Algorithms 1st Edition 1991 PDF Free Download
Download Data Structures and Their Algorithms 1st Edition PDF
Free Download Ebook Data Structures and Their Algorithms 1st Edition

Previous articlePrinciples of Embedded Networked Systems Design by Gregory J. Pottie (PDF)
Next articleData Abstraction and Structures Using C++/Book and Disk by Mark R. Headington (PDF)