Discrete Mathematics - IN SEM for SPPU 19 Course (SE - I - Comp.- 210241)

Discrete Mathematics - IN SEM for SPPU 19 Course (SE - I - Comp.- 210241) (Paperback, Dr.H.R.Bhapkar, Dr. Rajesh N. Phursule)

Share

Discrete Mathematics - IN SEM for SPPU 19 Course (SE - I - Comp.- 210241)  (Paperback, Dr.H.R.Bhapkar, Dr. Rajesh N. Phursule)

Be the first to Review this product
Special price
₹91
125
27% off
i
Available offers
  • Special PriceGet extra 27% off (price inclusive of cashback/coupon)
    T&C
  • Bank Offer5% cashback on Flipkart Axis Bank Credit Card upto ₹4,000 per statement quarter
    T&C
  • Bank Offer5% cashback on Axis Bank Flipkart Debit Card up to ₹750
    T&C
  • Bank OfferFlat ₹10 Instant Cashback on Paytm UPI Trxns. Min Order Value ₹500. Valid once per Paytm account
    T&C
  • Delivery
    Check
    Enter pincode
      Delivery by31 Jul, Thursday
      ?
    View Details
    Highlights
    • Binding: Paperback
    • Publisher: Technical Publications
    • ISBN: 9789333202763
    • Edition: 1st, 2020
    • Pages: 206
    Services
    • Cash on Delivery available
      ?
    Seller
    TechnicalPublications
    3.9
    • 7 Days Replacement Policy
      ?
  • See other sellers
  • Description
    Unit I Set Theory and Logic Introduction and significance of Discrete Mathematics, Sets – Naïve Set Theory (Cantorian Set Theory), Axiomatic Set Theory, Set Operations, Cardinality of set, Principle of inclusion and exclusion, Types of Sets - Bounded and Unbounded Sets, Diagonalization Argument, Countable and Uncountable Sets, Finite and Infinite Sets, Countably Infinite and Uncountably Infinite Sets, Power set, Propositional Logic - logic, Propositional Equivalences, Application of Propositional Logic - Translating English Sentences, Proof by Mathematical Induction and Strong Mathematical Induction. (Chapters - 1, 2, 3) Unit II Relations and Functions Relations and their Properties, n-ary relations and their applications, Representing relations, Closures of relations, Equivalence relations, Partial orderings, Partitions, Hasse diagram, Lattices, Chains and Anti-Chains, Transitive closure and Warshall‘s algorithm. Functions - Surjective, Injective and Bijective functions, Identity function, Partial function, Invertible function, Constant function, Inverse functions and Compositions of functions, The Pigeonhole Principle. (Chapters - 4, 5)
    Read More
    Specifications
    Book Details
    Publication Year
    • 2020 july
    Number of Pages
    • 206
    University Books Details
    Stream
    • comp
    Degree/Diploma
    • Degree
    Additional Features
    Age Group
    • 18-58
    Be the first to ask about this product
    Safe and Secure Payments.Easy returns.100% Authentic products.
    You might be interested in
    Medical And Nursing Books
    Min. 50% Off
    Shop Now
    Popular Psychology Books
    Min. 50% Off
    Shop Now
    Finance And Accounting Books
    Min. 50% Off
    Shop Now
    Language And Linguistic Books
    Min. 50% Off
    Shop Now
    Back to top