Fundamentals of Discrete Math for Computer Science A Problem-Solving Primer /

• Κύριοι συγγραφείς: Jenkyns, Tom (Συγγραφέας), Stephenson, Ben (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: London : Springer London : Imprint: Springer, 2013.
• Σειρά: Undergraduate Topics in Computer Science,
• Θέματα: Computer science.; Algorithms.; Computer science > Mathematics.; Computer Science.; Discrete Mathematics in Computer Science.; Algorithm Analysis and Problem Complexity.

An understanding of discrete mathematics is essential for students of computer science wishing to improve their programming competence. Fundamentals of Discrete Math for Computer Science provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner spe...

Πίνακας περιεχομένων:

• 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.