Discrete Mathematical Structures

IIT Madras Course , Prof. Kamala Krithivasan

468 students enrolled

Overview

What is Discrete Mathematics - Propositional Logic - Predicates & Quantifiers - Logical Inference - Resolution Principles & Application to PROLOG - Methods of Proof- Normal Forms - Proving programs correct - Sets - Induction - Set Operations on Strings Over an Alphabet - Relations - Graphs - Trees - Special Properties of Relations - Closure of Relations - Order and Relations and Equivalence Relations: Equivalence relations and partitions - Functions - Pigeon hole Principle - Permutations and combinations - Generating Functions- Recurrence Relations - Algebras - Finite State Automaton - Lattices

Lecture 1: What is Discrete Mathematics

Up Next
You can skip ad in
SKIP AD >
Advertisement
      • 2x
      • 1.5x
      • 1x
      • 0.5x
      • 0.25x
        EMBED LINK
        COPY
        DIRECT LINK
        PRIVATE CONTENT
        OK
        Enter password to view
        Please enter valid password!
        0:00
        3.5 (94 Ratings)

        Lecture Details

        Discrete Mathematical Structures

        LECTURES



        Review


        3.5

        94 Rates
        5
        44%
        41
        4
        17%
        16
        3
        9%
        8
        2
        10%
        9
        1
        21%
        20

        Comments Added Successfully!
        Please Enter Comments
        Please Enter CAPTCHA
        Invalid CAPTCHA
        Please Login and Submit Your Comment