 |
GetTextbooks.co.uk
Compare Prices & Save up to 90% |
|
|
|
| Login | Sign up | My Wish List |
 | | Algorithms and Data Structures: An Approach in C by Charles F. Bowman ISBN-10: 9780195114430 ISBN-10: 0-19-511443-4 ISBN-13: 9780195114430 ISBN-13: 978-0-19-511443-0 Hardcover 1994-02-01 Oxford University Press, USA Find Lowest Price |
Editorials | ||
Product Description With numerous practical, real-world algorithms presented in the C programming language, Bowman's Algorithms and Data Structures: An Approach in C is the algorithms text for courses that take a modern approach. For the one- or two-semester undergraduate course in data structures, it instructs students on the science of developing and analyzing algorithms. Bowman focuses on both the theoretical and practical aspects of algorithm development. He discusses problem-solving techniques and introduces the concepts of data abstraction and algorithm efficiency. More importantly, the text does not present algorithms in a "shopping-list" format. Rather it provides actual insight into the design process itself. | ||
Reviews | ||
Look for another text I was asked to teach a course of the same title, and the this text was already listed for the course. A few pages of each chapter are useful. The figures are good and the given definitions of lists, trees, and graphs are good. However, only a few pages are devoted per topic to definitions and related terminology. The remaining parts (bulk) of the chapters are devoted to academic C-language implementations of data structures and algorithms. Few, if any of the implementations scale well. There is an unnecessary emphasis on recursion. Complexities of the C language are introduced which distract from the main topic of the book. Much of the complexity is pointless, particularly from the point of view of efficient, intuitive coding practice. Even when C was a prominent industrial implementation language -- you would not want to train the work force in this manner. Look for another text. | ||