55,70 €*
Versandkostenfrei per Post / DHL
Lieferzeit 1-2 Wochen
This updated and enhanced new edition also includes new material on directed graphs, and on drawing and coloring graphs, in addition to more than 100 new exercises (with solutions to selected exercises).
Topics and features: assumes no prior mathematical knowledge, and discusses concepts in programming as and when they are needed; designed for both classroom use and self-study, presenting modular and self-contained chapters that follow ACM curriculum recommendations; describes mathematical processes in an algorithmic manner, often supported by a walkthrough demonstrating how the algorithm performs the desired task; includes an extensive set of exercises throughout the text, together with numerous examples, and shaded boxes highlighting key concepts; selects examples that demonstrate a practical use for the concept in question.
Students embarking on the start of their studies of computer science will find this book to be an easy-to-understand and fun-to-read primer, ideal for use in a mathematics course taken concurrently with their first programming course.
This updated and enhanced new edition also includes new material on directed graphs, and on drawing and coloring graphs, in addition to more than 100 new exercises (with solutions to selected exercises).
Topics and features: assumes no prior mathematical knowledge, and discusses concepts in programming as and when they are needed; designed for both classroom use and self-study, presenting modular and self-contained chapters that follow ACM curriculum recommendations; describes mathematical processes in an algorithmic manner, often supported by a walkthrough demonstrating how the algorithm performs the desired task; includes an extensive set of exercises throughout the text, together with numerous examples, and shaded boxes highlighting key concepts; selects examples that demonstrate a practical use for the concept in question.
Students embarking on the start of their studies of computer science will find this book to be an easy-to-understand and fun-to-read primer, ideal for use in a mathematics course taken concurrently with their first programming course.
Dr. Tom Jenkyns is a retired Associate Professor from the Department of Mathematics and the Department of Computer Science at Brock University, Canada.
Dr. Ben Stephenson is a Teaching Professor in the Department of Computer Science at the University of Calgary, Canada.
Highly accessible and easy to read, introducing concepts in discrete mathematics without requiring a university-level background in mathematics
Ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations
Contains examples and exercises throughout the text, and highlights the most important concepts in each section
Algorithms, Numbers and Machines.- Sets, Sequences and Counting.- Boolean Expressions, Logic and Proof.- Searching and Sorting.- Graphs and Trees.- Relations: Especially on (Integer) Sequences.- Sequences and Series.- Generating Sequences and Subsets.- Discrete Probability and Average Case Complexity.- Turing Machines.
| Erscheinungsjahr: | 2018 |
|---|---|
| Genre: | Informatik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Taschenbuch |
| Seiten: | 528 |
| Reihe: | Undergraduate Topics in Computer Science |
| Inhalt: |
xiii
512 S. 120 s/w Illustr. 512 p. 120 illus. |
| ISBN-13: | 9783319701509 |
| ISBN-10: | 3319701509 |
| Sprache: | Englisch |
| Herstellernummer: | 978-3-319-70150-9 |
| Ausstattung / Beilage: | Paperback |
| Einband: | Kartoniert / Broschiert |
| Autor: |
Stephenson, Ben
Jenkyns, Tom |
| Auflage: | 2nd ed. 2018 |
| Hersteller: |
Springer International Publishing
Undergraduate Topics in Computer Science |
| Maße: | 235 x 155 x 29 mm |
| Von/Mit: | Ben Stephenson (u. a.) |
| Erscheinungsdatum: | 08.05.2018 |
| Gewicht: | 0,791 kg |
Dr. Tom Jenkyns is a retired Associate Professor from the Department of Mathematics and the Department of Computer Science at Brock University, Canada.
Dr. Ben Stephenson is a Teaching Professor in the Department of Computer Science at the University of Calgary, Canada.
Highly accessible and easy to read, introducing concepts in discrete mathematics without requiring a university-level background in mathematics
Ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations
Contains examples and exercises throughout the text, and highlights the most important concepts in each section
Algorithms, Numbers and Machines.- Sets, Sequences and Counting.- Boolean Expressions, Logic and Proof.- Searching and Sorting.- Graphs and Trees.- Relations: Especially on (Integer) Sequences.- Sequences and Series.- Generating Sequences and Subsets.- Discrete Probability and Average Case Complexity.- Turing Machines.
| Erscheinungsjahr: | 2018 |
|---|---|
| Genre: | Informatik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Taschenbuch |
| Seiten: | 528 |
| Reihe: | Undergraduate Topics in Computer Science |
| Inhalt: |
xiii
512 S. 120 s/w Illustr. 512 p. 120 illus. |
| ISBN-13: | 9783319701509 |
| ISBN-10: | 3319701509 |
| Sprache: | Englisch |
| Herstellernummer: | 978-3-319-70150-9 |
| Ausstattung / Beilage: | Paperback |
| Einband: | Kartoniert / Broschiert |
| Autor: |
Stephenson, Ben
Jenkyns, Tom |
| Auflage: | 2nd ed. 2018 |
| Hersteller: |
Springer International Publishing
Undergraduate Topics in Computer Science |
| Maße: | 235 x 155 x 29 mm |
| Von/Mit: | Ben Stephenson (u. a.) |
| Erscheinungsdatum: | 08.05.2018 |
| Gewicht: | 0,791 kg |
Ähnliche Produkte
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 2-3 Wochen
Lieferzeit 1-2 Wochen
Lieferzeit 4-7 Werktage
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
Aktuell nicht verfügbar