Buch, Englisch, 272 Seiten, Format (B × H): 183 mm x 241 mm, Gewicht: 688 g
Reihe: Springer Undergraduate Texts in Mathematics and Technology
Problems and Solutions
Buch, Englisch, 272 Seiten, Format (B × H): 183 mm x 241 mm, Gewicht: 688 g
Reihe: Springer Undergraduate Texts in Mathematics and Technology
ISBN: 978-1-4419-1747-8
Verlag: Springer US
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering Objektorientierte Softwareentwicklung
- Mathematik | Informatik Mathematik Mathematische Analysis Moderne Anwendungen der Analysis
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik Mathematik Operations Research Graphentheorie
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Netzwerkprogrammierung
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik
Weitere Infos & Material
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).
