|
|
|
REVIEWER COMMENTS
On the Design Technique approach (as profiled in the Dr. Dobbs Article)
"After reviewing this text for the second time, I am convinced
that this fresh approach will create some buzz in computer science courses....you
have a winner on your hands"
-Bringham Young
"What continues to appeal to me about this book is the attempt
to present the ideas of algorithm design in a new unified framework,
which enhances its pedagogical feel. I would not nbe surprised if some
professors will take a look at the table of contents and decide to use
the book based on that"
-BYU
"Grouping algorithms by design is nothing new, but this text takes
it to a whole new level."
-UNLV
"The taxonomy of algorithms suggested by the author will definitely
be a positive factor in the competition with other books."
-GWU
"[More appealing than my current book i find the] Better separation
into more distnict design techniques. For instance, decrease-and-conquer
is separated from divide- and -conquer."
- Univ of Alabama
"I like the organization of algorithms into design classes. My
current text (CLR) does this for some design classes but the proposed
text carries this pedagogically powerful organizational principle further."
-Colorado State
"Levitin's TOC provides better groupings by algorithm design techniques
than does Brassard. This manner of grouping is muchmore useful than
grouping by problem domain, as most other algorithms textbooks do."
-Univ of Alabama
On the treatment of math
"The most appealing aspect of this text is its presentation of
major principles and results without much hard work. For this reason
the text is readable by mid to upper level undergraduate students."
-Univ of Michigan
" Levitin promises more narrative and less math. My students want
that!"
- BYU
...'the text is heavily biased towards description of algorithms as
opposed to mathematical details regarding their analysis....The manner
in which algorithms are descriobed with respect to both their structure
(English language description, pseudocode) and behavior (English language
descriptions, execution trees) is excellent."
- Univ of Michigan
On the writing style
"The presentation of the manuscript is clear, well-organized and
exciting..I like the informal style, the forward references to follow
up material, the justification for various examples, and anticipation
(and answers!) of typical student questions at various spots. I like
this text much better than my present text.On the table of contents:
It covers the whole theroy of the design and analysis of algorithms
as it presently understood GWU."
-GWU
On the exercises(including the puzzles)
"The exercises provide a good mix of algorithm tracing, algorithm
design, mathematical proof, and program implementation"
- Univ of Alabama.
" Students completing our course should be able to recognize standard
problems embedded in real-world applications."
- Univ of Alabama
|