Discrete Structures for Computer Science: Counting, Recursion, and Probability (Michiel Smid)

 
0.0 (0)
Discrete Structures for Computer Science: Counting, Recursion, and Probability (Michiel Smid)

A thorough introduction to some of the most exciting and stunning regions of discrete mathematical structures is provided in this book.

The book begins with a chapter on sets before moving on to logical examples, applications of the inclusion and exclusion principle, and lastly the pigeonhole concept.

A study of the fundamental properties of graphs, trees, and lattices is provided, along with computational techniques that include the mathematical introduction principle. Additionally, several essential conclusions about groups, rings, fields, and vector spaces are provided. These conclusions are intentionally treated simply because they serve as the cornerstone for students of discrete mathematics. There is also a discussion of a few solutions to systems of linear equations.

The goal of the author is to revolutionize the way logic and discrete mathematics are taught in computer science and mathematics. Unlike most publications, which consider logic as just another subject to be studied, this one is distinct in that it is willing to take the subject further. The text presents logic as a fundamental tool that may be used in virtually every other context.

Ebook Details

Author(s)
About the Authors
At Carleton University in Ottawa, Canada's School of Computer Science, Michiel Smid teaches computer science.
Published
Published Date / Year
(Creative Commons Licensed. July 22, 2019)
License(s)
CC BY-SA 4.0
eBook Format
PDF (404 pages)
Language
English

Similar Programming & Computer Books

Apprendre l'informatique sans ordinateur - Learn computer science without a computer
In this free programming book, the author describes how to Learn computer science without a computer.  
Dictionary of Programming Languages (Neal Ziring)
The Dictionary of Programming Languages is an online reference guide to computer coding techniques put together to educate and enhance your understanding of computer science history. Over 120 words...
Logic and the Foundations of Game and Decision Theory (Giacomo Bonanno, et al)
The Foundations of Game Theory and Decision Making Logic The present collection provides a vibrant and comprehensive overview of a fascinating and quickly developing field, and theory is a...
An Architecture for Combinator Graph Reduction (Philip J. Koopman, Jr.)
The outcomes of research using an abstract machine and cache simulation for decreasing combinator graphs are provided. For similar types of combinator graphs on comparable types of hardware, the...
Applied Combinatorics on Words (M. Lothaire)
This volume's goal is to provide a comprehensive analysis of some of the main areas in which combinatorics is applied. Core algorithms for text processing, natural language processing, audio...
A = B (Marko Petkovsek, et al)
Mathematicians and computer scientists who deal on combinatorics and finite mathematics will find this book interesting. It offers a ground-breaking approach to examining intricate summaries. ...
You might think of this open-source book as a lesson and a collection of notes on convex sets, polytopes, polyhedra, combinatorial topology, Voronoi Diagrams, and Delaunay triangulations. It is...
The GNU C Programming Tutorial (Mark Burgess)
This free programming book serves as a tutorial for the GNU C Library and the programming language C. Additionally, you need have access to a machine running a GNU...
The C Programming Language, 2nd Edition (Brian W. Kernighan, et al)
Almost all of the C programmers I like learnt the language from this free programming book. This volume is succinct and strong (if somewhat risky), much like C itself,...
QBasic (Faraaz Damji, et al)
For novices, Microsoft QuickBasic and QBasic are particularly well-liked programming languages. Although its lack of power precludes many of the applications used today, it is a priceless teaching tool....

Others Programming Books by Michiel Smid

Introduction to Theory of Computation (Anil Maheshwari, et al)
This textbook covers computational complexity, automata theory, and formal languages. This book successfully juggles an analytical approach to computer theory with an intuitive one.

Others Programming Books by Carleton University

Introduction to Theory of Computation (Anil Maheshwari, et al)
This textbook covers computational complexity, automata theory, and formal languages. This book successfully juggles an analytical approach to computer theory with an intuitive one.

User reviews

There are no user reviews for this listing.
Ratings
Rate this Book
Comments