Algorithms and Programming is primarily intended for use in a first-year undergraduate course in programming. It is structured in a problem-solution formatthat 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 asuseful 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 sourceof problems for a variety of courses. This second edition contains problems from new topics including suffix trees, games and strategies, and Huffman coding Good undergraduate introduction to programming course, especially one which is mathematically motivated May also be used as a textbook in a graduate course on the analysis of algorithms and/or compiler construction The 'problem and solution' style makes the reader think through the programming process, makingthe book ideal for students in the classroom setting or for self study INDICE: 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.
- ISBN: 978-1-4419-1747-8
- Editorial: Springer
- Encuadernacion: Cartoné
- Páginas: 272
- Fecha Publicación: 01/01/2010
- Nº Volúmenes: 1
- Idioma: Inglés