Logo

Notes on Discrete Mathematics

Notes on Discrete Mathematics
by


Number of pages: 154

Description:
These notes are intended to be a summary of the main ideas in course CS 310: Mathematical Foundations of Computer Science which covers fundamental concepts and tools in discreet mathematics with emphasis on their applications to computer science. Topics include logic and Boolean circuits; sets, functions, relations, databases, and finite automata: deterministic algorithms, randomized algorithms, and analysis techniques based on counting methods and recurrence equations; trees and more general graphs.

Download or read it online for free here:
Download link
(1MB, PDF)

Similar books

Book cover: Discrete MathematicsDiscrete Mathematics
- Wikibooks
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. This book will help you think well about discrete problems: problems where tools like calculus fail because there's no continuity.
(11332 views)
Book cover: Temporal NetworksTemporal Networks
by - arXiv
In this review, the authors present the emergent field of temporal networks, and discuss methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamic systems.
(8814 views)
Book cover: Applied Discrete StructuresApplied Discrete Structures
by - Lulu.com
Applied Discrete Structures is a two semester undergraduate text in discrete mathematics, focusing on the structural properties of mathematical objects. These include matrices, functions, graphs, trees, lattices and algebraic structures.
(5348 views)
Book cover: Discrete Mathematics with AlgorithmsDiscrete Mathematics with Algorithms
by - J. Wiley
This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs...
(6462 views)