Algorithms and Programming
Algorithms and Programming is primarily intended for use in a first-year undergraduate course in programming. It is structured in a problem-solution format that requires the student to think through the programming process, thus developing an understanding of the underlying theory. The book is easily readable by a student taking a basic introductory course in computer science as well as useful for a graduate-level course in the analysis of algorithms and/or compiler construction.
Each self-contained chapter presents classical and well-known problems supplemented by clear and in-depth explanations. The material covered includes such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms and much more. Students and teachers will find this both an excellent text for learning programming and a source of problems for a variety of courses.
This second edition contains problems from new topics including suffix trees, games and strategies, and Huffman codingGood undergraduate introduction to programming course, especially one which is mathematically motivatedMay also be used as a textbook in a graduate course on the analysis of algorithms and/or compiler constructionThe "problem and solution" style makes the reader think through the programming process, making the book ideal for students in the classroom setting or for self study