Algorithms and Programming [recurso electrónico] : Problems and Solutions / by Alexander Shen.

Por: Shen, Alexander [author.]Colaborador(es): SpringerLink (Online service)Tipo de material: TextoTextoSeries Springer Undergraduate Texts in Mathematics and TechnologyEditor: New York, NY : Springer New York : Imprint: Springer, 2010Edición: 2Descripción: XII, 272 p. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9781441917485Tema(s): Mathematics | Computer science | Computer software | Computer science -- Mathematics | Algorithms | Mathematics | Algorithms | Programming Techniques | Computational Mathematics and Numerical Analysis | Algorithm Analysis and Problem ComplexityFormatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 518.1 Clasificación LoC:QA76.9.A43Recursos en línea: Libro electrónicoTexto
Contenidos:
Variables, expressions, assignments -- Generation of combinatorial objects -- Tree traversal (backtracking) -- Sorting -- Finite-state algorithms in text processing -- Data types -- Recursion -- Recursive and non-recursive programs -- Graph algorithms -- Pattern matching -- Games analysis -- Optimal coding -- Set representation. Hashing -- Sets, trees, and balanced trees -- Context-free grammars -- Left-to-right parsing (LR).
En: Springer eBooksResumen: "Algorithms and Programming" is primarily intended for a first year undergraduate course in programming. Structured in a problem-solution format, the text motivates the student to think through the programming process, thus developing a firm understanding of the underlying theory. Although a moderate familiarity with programming is assumed, the book is easily utilized by students new to computer science. The more advanced chapters make the book useful for a graduate course in the analysis of algorithms and/or compiler construction. New to the second edition are added chapters on suffix trees, games and strategies, and Huffman coding as well as an appendix illustrating the ease of conversion from Pascal to C. The material covers such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms, and much more. Reviews of the 1st Edition: "The book is addressed both to ambitious students and instructors looking for interesting problems [and] fulfills this task perfectly, especially if the reader has a good mathematical background." — Zentralblatt MATH "This book is intended for students, engineers, and other people who want to improve their computer skills.... The chapters can be read independently. Throughout the book, useful exercises give readers a feeling for how to apply the theory." — Computing Reviews "Overall...the book is well done. I recommend it to teachers and those wishing to sharpen their data structure and compiler skills." — SIGACT News
Star ratings
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca actual Colección Signatura Copia número Estado Fecha de vencimiento Código de barras
Libro Electrónico Biblioteca Electrónica
Colección de Libros Electrónicos QA76.9 .A43 (Browse shelf(Abre debajo)) 1 No para préstamo 371425-2001

Variables, expressions, assignments -- Generation of combinatorial objects -- Tree traversal (backtracking) -- Sorting -- Finite-state algorithms in text processing -- Data types -- Recursion -- Recursive and non-recursive programs -- Graph algorithms -- Pattern matching -- Games analysis -- Optimal coding -- Set representation. Hashing -- Sets, trees, and balanced trees -- Context-free grammars -- Left-to-right parsing (LR).

"Algorithms and Programming" is primarily intended for a first year undergraduate course in programming. Structured in a problem-solution format, the text motivates the student to think through the programming process, thus developing a firm understanding of the underlying theory. Although a moderate familiarity with programming is assumed, the book is easily utilized by students new to computer science. The more advanced chapters make the book useful for a graduate course in the analysis of algorithms and/or compiler construction. New to the second edition are added chapters on suffix trees, games and strategies, and Huffman coding as well as an appendix illustrating the ease of conversion from Pascal to C. The material covers such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms, and much more. Reviews of the 1st Edition: "The book is addressed both to ambitious students and instructors looking for interesting problems [and] fulfills this task perfectly, especially if the reader has a good mathematical background." — Zentralblatt MATH "This book is intended for students, engineers, and other people who want to improve their computer skills.... The chapters can be read independently. Throughout the book, useful exercises give readers a feeling for how to apply the theory." — Computing Reviews "Overall...the book is well done. I recommend it to teachers and those wishing to sharpen their data structure and compiler skills." — SIGACT News

19

Con tecnología Koha