Fundamentals of discrete math for computer science: a problem-solving primer

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Jenkyns, Tom A.; Stephenson, Benjamin David
Series: Undergraduate topics in computer science
Edition: 2ed.
Publisher: Springer
Year: 2018

Language: English
Pages: 518
Tags: Computer science.;Computer science -- Mathematics.;Computer software.;Computational complexity.;Computers -- Programming -- Algorithms.;Algorithms & data structures.;Computers -- Data Processing.;Discrete mathematics.

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