Beschreibung
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 selfcontained chapter presents classical and wellknown problems supplemented by clear and indepth explanations. The material covered includes such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected wellknown 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.
Inhaltsverzeichnis
Preface.- 1. Variables, expressions, assignments.- 2. Generation of combinatorial objects.- 3. Tree traversal (backtracking).- 4. Sorting.- 5. Finite-state algorithms in text processing.- 6. Data types.- 7. Recursion.- 8. Recursive and nonrecursive programs.- 9. Graph algorithms.- 10. Pattern matching.- 11. Set representation.- 12. Hashing.- 13. Sets, trees, and balanced trees.- 14. Context-free grammars.- 15. Left-to-right parsing (LR).- Further reading.- Index.
Herstellerkennzeichnung:
Springer Basel AG in Springer Science + Business Media
Heidelberger Platz 3
14197 Berlin
DE
E-Mail: juergen.hartmann@springer.com
