Fundamentals of Discrete Math for Computer Science
A Problem-Solving Primer
(Sprache: Englisch)
This book offers an engaging introduction to traditional topics in discrete mathematics, in a manner designed to appeal to computer science students. Presents detailed walkthroughs of several algorithms, along with exercises and practical examples throughout.
Leider schon ausverkauft
versandkostenfrei
Buch
54.99 €
27 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Fundamentals of Discrete Math for Computer Science “
This book offers an engaging introduction to traditional topics in discrete mathematics, in a manner designed to appeal to computer science students. Presents detailed walkthroughs of several algorithms, along with exercises and practical examples throughout.
Klappentext zu „Fundamentals of Discrete Math for Computer Science “
This textbook provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Clearly structured and interactive in nature, the book presents detailed walkthroughs of several algorithms, stimulating a conversation with the reader through informal commentary and provocative questions. Features: no university-level background in mathematics required; ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations; describes mathematical processes in an algorithmic manner; contains examples and exercises throughout the text, and highlights the most important concepts in each section; selects examples that demonstrate a practical use for the concept in question.
Inhaltsverzeichnis zu „Fundamentals of Discrete Math for Computer Science “
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.
Autoren-Porträt von Tom Jenkyns, Ben Stephenson
Dr. Tom Jenkyns is an Associate Professor in the Department of Mathematics and the Department of Computer Science at Brock University, Canada.Dr. Ben Stephenson is an Instructor in the Department of Computer Science at the University of Calgary, Canada.
Bibliographische Angaben
- Autoren: Tom Jenkyns , Ben Stephenson
- 2012, 2013., 416 Seiten, 143 Schwarz-Weiß-Abbildungen, Maße: 15,9 x 24,2 cm, Kartoniert (TB), Englisch
- Verlag: Springer
- ISBN-10: 1447140680
- ISBN-13: 9781447140689
Sprache:
Englisch
Rezension zu „Fundamentals of Discrete Math for Computer Science “
From the reviews:Prof. Vladik Kreinovich, University of Texas at El Paso, TX, USA
Excerpts from full review posted Dec 28 2012 to Computing Reviews [Review #: CR140786]
This book is specifically aimed at CS students. The authors include the same discrete math topics that other books have, but, in contrast to most existing books, they introduce each topic with a clear (and entertaining) CS motivation...
The book covers the usual discrete math topics ...in a very entertaining way...
Each section is well written, with a highlighted subsection on the most important ideas and plenty of exercises. I highly recommend this book to everyone. It can be used in two different ways. The easiest way is to teach only the topics that are usually taught in discrete math classes (and ignore the other parts of the book). Alternatively, you could cover the whole book and, if needed, rearrange the other classes to avoid duplication. No matter how you use this book, its highly entertaining presentation of the material will undoubtedly make the class a success.
"Jenkyns (Brock Univ., Canada) and Stephenson (Univ. of Calgary, Canada) have written an introductory textbook on discrete mathematics for computer science majors. The volume's ten chapters cover the standard topics taught in such courses at the freshman or sophomore level ... . In comparison with other introductory discrete mathematics textbooks, this work has a very strong emphasis on algorithms, proofs of algorithmic correctness, and the analysis of worst-case and average-case complexity. ... Summing Up: Recommended. Lower-division undergraduates." (B. Borchers, Choice, Vol. 50 (9), May, 2013)
Kommentar zu "Fundamentals of Discrete Math for Computer Science"
0 Gebrauchte Artikel zu „Fundamentals of Discrete Math for Computer Science“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Fundamentals of Discrete Math for Computer Science".
Kommentar verfassen