This is a course
note on discrete mathematics as used in Computer Science. Topics covered
includes: Mathematical logic, Set theory, The real numbers, Induction and
recursion, Summation notation, Asymptotic notation, Number theory, Relations,
Graphs, Counting, Linear algebra, Finite fields.
This
note explains the following topics: introduction to preliminaries, Counting, Sequences, Symbolic logic
and proofs, Graph theory, Additional topics.
This note explains the following topics: number systems,
Propositions and logical operations, Sets, Relations and diagraphs, Recurrence
relations, Classification of languages.
This note explains the following topics related to Discrete
Mathematics : Mathematical Logic, Relations, Algebraic structures,
Elementary Combinatorics, Recurrence Relation, Graph Theory.
Author(s): Malla Reddy College Of Engineering
and Technology
This PDF covers the following topics related to Discrete
Mathematics : Introduction, Sets, Functions, Counting, Relations, Sequences,
Modular Arithmetic, Asymptotic Notation, Orders.
Author(s): Andrew D. Ker, Oxford University Computing
Laboratory
This PDF covers the following
topics related to Discrete Mathematics : Introduction, Propositional Logic,
Sets, and Induction, Relations, Functions, Counting, Sequences, Graphs and
trees, A glimpse of infinity.
This book covers the following topics: Discrete
Systems,Sets, Logic, Counting, Discrete Probability, Algorithms, Quantified
Statements, Direct Proof, Proofs Involving Sets, Proving Non-Conditional
Statements, Cardinality of Sets, Complexity of Algorithms.