Algorithms and Programming is primarily intended for 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. Each chapter is more or less independent, containing 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. An affordable new softcover edition of a bestselling text. 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 INDICE: Variables, expressions, assignments. Generation of combinatorial objects. Tree traversal (backtracking). Sorting. Finite-state algorithms in text processing. Data types. Recursion. Recursive and nonrecursive programs. Graph algorithms. Pattern matching. Set representation. Hashing. Sets, trees, balanced trees. Context-free grammar. Left-to-right parsing (LR). Further reading.
- ISBN: 978-0-8176-4760-5
- Editorial: Birkhaüser
- Encuadernacion: Rústica
- Páginas: 218
- Fecha Publicación: 01/02/2008
- Nº Volúmenes: 1
- Idioma: Inglés