Discrete Structures

IIT Madras Course , Prof. Kamala Krithivasan

228 students enrolled

Overview

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 - Trees and Graphs - Special Properties of Relations - Closure of Relations - Order Relations - Order and Relations and Equivalence Relations - Equivalence relations and partitions - Functions - Pigeonhole Principle - Permutations and combinations - Generating Functions - Recurrence Relations - Algebras - Finite State Automaton - Lattices

Lecture 33: Recurrence Relations - 2

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 (2 Ratings)

        Lecture Details

        Discrete Mathematical Structures, Recurrence Relations, Lecture 33

        LECTURES



        Review


        3.5

        2 Rates
        5
        50%
        1
        2
        50%
        1

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