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

• Main Authors: Jenkyns, Tom. (Author), Stephenson, Ben. (Author)
• Corporate Author: SpringerLink (Online service)
• Format: Electronic
• Language: English
• Published: London : Springer London : Imprint: Springer, 2013.
• Series: Undergraduate Topics in Computer Science,
• Subjects: Computer science.; Computer software.; Computational complexity.; Computer Science.; Discrete Mathematics in Computer Science.; Algorithm Analysis and Problem Complexity.
• Online Access: https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-1-4471-4069-6

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

Table of Contents:

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