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: Applied Finite MathematicsApplied Finite Mathematics
by - Connexions
Applied Finite Mathematics covers topics including linear equations, matrices, linear programming (geometrical approach and simplex method), the mathematics of finance, sets and counting, probability, Markov chains, and game theory.
(12954 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.
(12420 views)
Book cover: generatingfunctionologygeneratingfunctionology
by - A K Peters, Ltd.
The book about main ideas on generating functions and some of their uses in discrete mathematics. Generating functions are a bridge between discrete mathematics and continuous analysis. The book is suitable for undergraduates.
(22100 views)
Book cover: A Spiral Workbook for Discrete MathematicsA Spiral Workbook for Discrete Mathematics
by - Open SUNY Textbooks
This textbook covers the standard topics in discrete mathematics: logic, sets, proof techniques, basic number theory, functions, relations, and elementary combinatorics. It explains and clarifies the unwritten conventions in mathematics.
(7458 views)