Tom Jenkyns, Ben Stephenson

Fundamentals of Discrete Math for Computer Science (eBook, PDF)

A Problem-Solving Primer

• Format: PDF

Produktbeschreibung

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

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer International Publishing
• Seitenzahl: 512
• Erscheinungstermin: 3. Mai 2018
• Englisch
• ISBN-13: 9783319701516
• Artikelnr.: 52517312

Autorenporträt

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.

Inhaltsangabe

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.