Saturday, 9 February 2013

Discrete Mathmatics Notes & PPT

Discrete Math
Instructor : Zeph Grunschlag


Topics
Lecture Download
Introduction: course policies; Overview, Logic,   Propositionsppt
Tautologies, Logical Equivalencesppt
Predicates and Quantifiers: "there exists" and   "for all"ppt
Sets: curly brace notation, cardinality, containment,   empty set {, power set P(S), N-tuples and Cartesian product. Set Operations:   set operations union and disjoint union, intersection, difference,   complement, symmetric differenceppt
Functions: domain, co-domain, range; image, pre-image;   one-to-one, onto, bijective, inverse; functional composition and   exponentiation; ceiling and floor. Sequences, Series, Countability:   Arithmetic and geometric sequences and sums, countable and uncountable sets,   Cantor's diagonilation argument.ppt
Big-Oh, Big-Omega, Big-Theta: Big-Oh/Omega/Theta notation,   algorithms, pseudo-code, complexity.ppt
Integers: Divisors Primality Fundamental Theorem of   Arithmetic. Modulii: Division Algorithm, Greatest common divisors/least   common multiples, Relative Primality, Modular arithmetic, Caesar Cipher,ppt
Number Theoretic Algorithms: Euclidean Algorithm for GCD;   Number Systems: Decimal, binary numbers, others bases;ppt
RSA Cryptography: General Method, Fast Exponentiation,   Extended Euler Algorithm, Modular Inverses, Exponential Inverses, Fermat's   Little Theorem, Chinese Remainder Theoremppt
Proof Techniques.ppt
Induction Proofs: Simple induction, strong induction,   program correctnessppt
Recursion: Recursive Definitions, Strings, Recursive   Functions.ppt
Counting Fundamentals: Sum Rule, Product Rule,   Inclusion-Exclusion, Pigeonhole Principle Permutations.ppt
r-permutations: P(n,r), r-combinations:   C(n,r), Anagrams, Cards and Poker; Discrete probability: NY   State Lotto, Random Variables, Expectation, Variance, Standard Deviation.ppt
Stars and Bars.ppt
Recurrence Relations: linear recurrence relations with   constant coefficients, homogeneous and non-homogeneous, non-repeating and   repeating roots; Generelized Includsion-Exclusion: counting onto functions,   counting derangementsppt
Representing Relations: Subsets of Cartesian products,   Column/line diagrams, Boolean matrix, Digraph; Operations on Relations:   Boolean, Inverse, Composition, Exponentiation, Projection, Joinppt
Graph theory basics and definitions: Vertices/nodes,   edges, adjacency, incidence; Degree, in-degree, out-degree; Degree,   in-degree, out-degree; Subgraphs, unions, isomorphism; Adjacency matrices.   Types of Graphs: Trees; Undirected graphs; Simple graphs, Multigraphs,   Pseudographs; Digraphs, Directed multigraph; Bipartite; Complete graphs,   cycles, wheels, cubes, complete bipartite.ppt
Connectedness, Euler and Hamilton Pathsppt
Planar Graphs, Coloringppt
Reading Period. Review session TBA.ppt



Discrete Structure
Instructor: Manfred Huber
Textbook: Mathematical Structures for Computer Science 6th edition
Download slides from here
Class
Readings
Lecture Topics
2
1.1, Notes
Statements and Symbolic Representation
3
1.2, Notes
Propositional Logic
4
1.3, Notes
Quantifiers, Predicates, and Validity
5
1.4, Notes
Predicate Logic
6
  
Formal Logic continued
7
2.1, Notes
Proof Techniques
8
2.1
Proof Techniques
9
2.2, Notes
Induction
10
2.4, Notes
Recursion and Recurrence Relations
3.1, Notes
Sets
12
3.2, 3.3, Notes
Counting
13
3.4, Notes
Permutations and Combinations
15
  
Combinatorics continued
16
4.1, Notes
Relations
17
4.2
Relations and Topological Sorting
18
4.4, Notes
Relations & Functions
19
Functions
20
  
Orders of Magnitude
21
4.6, Notes
Matrices




DISCRETE MATHEMATICS PPT

INSTRUCTOR: Ruay-Shiung Chang

Textbook: Discrete and Combinatorial Mathematics:
An Applied Introduction, by Ralph Grimaldi, 4th edition

SLIDES:

1. Fundamental Principle of Counting (PowerPoint File)
2. Fundamentals of Logic (PowerPoint File)
3. Set Theory (PowerPoint File)
4. Properties of the Integers: Mathematical Induction (PowerPoint File)
5. Relations and Functions (PowerPoint File)
6. Languages: Finite State Machines (PowerPoint File)
7. Relations: The Second Time Around (PowerPoint File)
8. The principle of Inclusion and Exclusion (PowerPoint File)
9. Generating Functions (PowerPoint File)
10. Recurrence Relations (PowerPoint File)
11. An Introduction to Graph Theory (PowerPoint File) 

Discrete Mathematics
TopicReadingSlides
Propositional Logic
lec 1
Propositions, QuantifiersNotes:   Ch 1lec 2
Quanifiers and PredicatesNotes:   Ch 2lec 3
Proof TechniquesNotes:   Ch 3lec 4
SetsNotes:   Ch 4lec 5
More SetsNotes:   Ch 4lec 6
FunctionsNotes:   Ch 4lec 7
Algorithms and ComplexityNotes:   Ch 4.1 - 4.12lec 8
Summations and Hotel InfinityNotes:   Ch 6lec 9
Summations and Hotel InfinityNotes:   Ch 4.15, 6.2-6.3lec 10
Infinite Cardinality, InductionNotes:   Ch 6lec 11
Strong Induction and Recursive DefinitionsNotes:   Ch 7lec 12
Inductive definitions, AlgorithmsNotes:   Ch 7lec 13
Algorithms, Counting  Notes:   Ch 8lec 14
Permutations, Combinations, and PHPlec 15
Binomial Theorem, Generalized Permutations and   Combinationslec 16
more counting and Probabilitylec 17
Probabilitylec 18
Expectation and Variancelec 19
Recurrenceslec 20
Annihilatorslec 21
Annihilators, etc.recurrences   handoutlec 22
Divide and Conquer Recurrencesrecurrences   handoutlec 23
Relationslec 24
Equivalence Relationslec 25
Partial Orderslec 26
Graphslec 27



Lecture notes.
        * Sets
        * Relations
        * Functions and Algorithms
        * Logic and Propositional Calculus
        * Vectors and Matrices
        * Counting and combinatorial problems
        * Probabilities
        * Graph Theory
        * Properties of Integers
        * Algebraic Systems
        * Ordered sets and Lattices
        * Languages, grammers and mac

No comments:

Post a Comment