Abstract Algebra Algebra Algebraic Geometry Algebraic Topology Applied Mathematics Arithmetic Geometry Basic Algebra Basic Mathematics Calculus Category Theory Classical Analysis Combinatorics Commutative Algebra Complex Algebra Complex Analysis Differential Algebra Differential Analysis Differential Calculus Differential Equations Differential Geometry Differential Topology Discrete Mathematics Elliptic Curves Fourier Analysis Functional Analysis Fractals Fractional Calculus Geometric Algebra Geometry Geometric Topology Groups Theory Graph Theory Harmonic Analysis Higher Algebra History of Mathematics Homological Algebra Integral Calculus K-theory Lie Algebra Linear Algebra Mathematical Analysis Mathematical Series Modern Geometry Multivairable Calculus Number Theory Numerical Analysis Probability Theory Real Analysis Rings and Fileds Riemannian Geometry Theorems in Calculus Topology Trigonometry Set Theory Constants & Numerical Sequences
Discrete Mathematics for Computer Science
The goal of this lecture note is to introduce students to ideas and techniques from discrete mathematics that are widely used in Computer Science. This note covers the following topics: Propositional logic, Induction, Strong induction, Structural induction, Proofs about algorithms, Algebraic algorithms, Number theory, RSA, Basics of counting, basic probability,Conditional probability, Linearity of expectation, variance.
Author(s): Mike Clancy, David Wagner
NA Pages 
Discrete Mathematics by Oscar Levin
This note explains the following topics: introduction to preliminaries, Counting, Sequences, Symbolic logic and proofs, Graph theory, Additional topics.
Author(s): University of Northern Colorado
414 Pages
Lecture Notes on Discrete Mathematics
This note explains the following topics: number systems, Propositions and logical operations, Sets, Relations and diagraphs, Recurrence relations, Classification of languages.
Author(s): NA
177 Pages
An Active Introduction to Discrete Mathematics and Algorithms
This note covers proof methods, Programming fundamentals and algorithms, Logic, Sets, Functions and relations, Sequences and summations, Algorithm analysis, Recursion, Recurrences and mathematical induction, Counting, Graph theory.
Author(s): Charles A Cusack and David A Santos
515 Pages
Digital Notes On Discrete Mathematics
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
88 Pages
Discrete Structures by Allen Gehret
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.
Author(s): Allen Gehret, UCLA
119 Pages
Lecture Notes On Discrete Mathematical Structures iare
The contents include: Mathematical Logic, Relations, Algebraic structures, Recurrence Relation, Graph Theory.
Author(s): Mrs. B Pravallika, Assistant Professor,Information Technology, Institute of Aeronautical Engineering
95 Pages
Elements of Discrete Mathematics by Richard Hammack
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.
Author(s): Richard Hammack
479 Pages
Discrete Mathematics II Set Theory for Computer Science
The aim of this note is to introduce fundamental concepts and techniques in set theory in preparation for its many applications in computer science. Topics covered includes: Mathematical argument, Sets and Logic, Relations and functions, Constructions on sets, Well-founded induction.
Author(s): Glynn Winskel
112 Pages
Discrete Structures Lecture Notes by Vladlen Koltun
This lecture note describes the following topics: Sets and Notation, Induction, Proof Techniques, Divisibility, Prime Numbers, Modular Arithmetic, Relations and Functions, Mathematical Logic, Counting, Binomial Coefficients, The Inclusion-Exclusion Principle, The Pigeonhole Principle, Asymptotic Notation, Graphs, Trees, Planar Graphs.
Author(s): Vladlen Koltun
89 Pages
Discrete Mathematics Lecture Notes Incomplete Preliminary Version
This note covers the following topics: Logic, Asymptotic Notation, Convex Functions and Jensen’s Inequality, Basic Number Theory, Counting, Binomial coefficients, Graphs and Digraphs, Finite Probability Space, Finite Markov Chains.
Author(s): Laszlo Babai
96 Pages
A Collection of Short Lectures on Discrete Mathematics
This note covers the following topics: Boolean Logic, Sets, Predicate Logic, Sequences, Recursion, Mathematical Induction, Relations, Functions, Naming Systems, Number Systems, Proofs.
Author(s): William D Shoaff
NA Pages
Lecture Notes in Discrete Mathematics
This note covers the following topics: fundamentals of mathematical logic , fundamentals of mathematical proofs , fundamentals of set theory , relations and functions , introduction to the Analysis of Algorithms, Fundamentals of Counting and Probability Theory and Elements of Graph Theory.
Author(s): Marcel B. Finan, Arkansas Tech University
224 Pages
Discrete Mathematics for Computer Science
The goal of this lecture note is to introduce students to ideas and techniques from discrete mathematics that are widely used in Computer Science. This note covers the following topics: Propositional logic, Induction, Strong induction, Structural induction, Proofs about algorithms, Algebraic algorithms, Number theory, RSA, Basics of counting, basic probability,Conditional probability, Linearity of expectation, variance.
Author(s): Mike Clancy, David Wagner
NA Pages
Introduction to Finite Mathematics
This note covers the following topics: Compound Statements, Sets and subsets, Partitions and counting, Probability theory, Vectors and matrices, Linear programming and the theory of games, Applications to behavioral science problems.
Author(s): John G. Kemeny, J. Laurie Snell, and Gerald L. Thompson
NA Pages
Fundamental Problems in Algorithmic Algebra
This book explains the following topics: Arithmetic, The Greatest Common Divisor, Subresultants, Modular Techniques, Fundamental Theorem of Algebra, Roots of Polynomials, Sturm Theory, Gaussian Lattice Reduction, Lattice Reduction and Applications, Linear Systems, Elimination Theory, Groebner Bases, Bounds in Polynomial Ideal Theory and Continued Fractions.
Author(s): Chee Yap
NA Pages
Basics of Algebra and Analysis for Computer Science
Currently this section contains no detailed description for the page, will update this page soon.
Author(s): NA
NA Pages