Scribd Logo
Upload

Welcome to Scribd!

  • 16 views

    June 2021

    Uploaded by

    plant cancer
    This document contains a term-end examination for a Discrete Mathematics course. It consists of 5 questions testing concepts in logic, sets, functions, probability, and number theory. Question 1 has 6 parts testing logical equivalence, mathematical induction, injective functions, logical equivalence of statements, probability, and counting arrangements. Questions 2-5 contain additional parts testing topics like integer partitions, Boolean logic circuits, Boolean expressions, relations vs. functions, committee formations, and properties of probability and logic.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    June 2021

    Uploaded by

    plant cancer
    16 views3 pages
    This document contains a term-end examination for a Discrete Mathematics course. It consists of 5 questions testing concepts in logic, sets, functions, probability, and number theory. Question 1 has 6 parts testing logical equivalence, mathematical induction, injective functions, logical equivalence of statements, probability, and counting arrangements. Questions 2-5 contain additional parts testing topics like integer partitions, Boolean logic circuits, Boolean expressions, relations vs. functions, committee formations, and properties of probability and logic.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains a term-end examination for a Discrete Mathematics course. It consists of 5 questions testing concepts in logic, sets, functions, probability, and number theory. Question 1 has 6 parts testing logical equivalence, mathematical induction, injective functions, logical equivalence of statements, probability, and counting arrangements. Questions 2-5 contain additional parts testing topics like integer partitions, Boolean logic circuits, Boolean expressions, relations vs. functions, committee formations, and properties of probability and logic.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    16 views3 pages

    June 2021

    Uploaded by

    plant cancer
    This document contains a term-end examination for a Discrete Mathematics course. It consists of 5 questions testing concepts in logic, sets, functions, probability, and number theory. Question 1 has 6 parts testing logical equivalence, mathematical induction, injective functions, logical equivalence of statements, probability, and counting arrangements. Questions 2-5 contain additional parts testing topics like integer partitions, Boolean logic circuits, Boolean expressions, relations vs. functions, committee formations, and properties of probability and logic.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 3

    No.

    of Printed Pages : 3 MCS-013

    MCA (Revised) / BCA (Revised)


    Term-End Examination
    June, 2021

    MCS-013 : DISCRETE MATHEMATICS

    Time : 2 hours Maximum Marks : 50

    Note : Question no. 1 is compulsory. Attempt any three


    questions from the rest.

    1. (a) Write the truth value of the conjunction of :


    ‘‘The earth is round’’ and ‘‘3 > 4’’. 2

    (b) Use Mathematical Induction to prove that :


    1 1 1 1
    1+ + + ... 2–  n  N. 4
    4 9 2 n
    n

    (c) If f : R  R is a function such that


    f(x) = 3x – 2, prove that f is injective. Also
    find the inverse of f. 5

    (d) Show that p(q  r) and (p  q)  (p  r)


    are logically equivalent. 3

    MCS-013 1 P.T.O.
    (e) A and B are two mutually exclusive events
    such that P(A) = 0.4 and P(B) = 0.2. What
    is the probability that :
    (i) A does not occur ?
    (ii) A or B does not occur ?
    (iii) Either A or B does not occur ? 3
    (f) Find the number of ways of placing
    n people in n – 1 rooms, no room being
    empty. 3
    2. (a) What is integer partition ? Write down all
    the partitions of 8. Also find P84 and P87 . 4

    (b) Find Boolean Expression for the following


    logical circuit : 4

    (c) Let two functions be such that f(x) = x2 + 2


    and g(x) = 2x. Define fog and gof. 2

    3. (a) Reduce the following Boolean Expression to


    simpler form : 4
    E(X1, X2, X3) = (X1  X2  X3)  (X1  X2) 
    (X2  X3)

    (b) Show that ~(p  q)  p is a tautology. 2

    (c) Prove that 2 is irrational. 4

    MCS-013 2
    4. (a) What is Relation ? How is relation different
    from function ? Explain any two properties
    of relations with an example. 5

    (b) A company has the following professionals :


    Project Leaders – 5, Team Leaders – 6,
    System Architects – 3.

    Find how many different committees can be


    formed of 10 professionals, each containing
    at least 2 Project Leaders, at least 3 Team
    Leaders and at least 1 System Architect. 3

    (c) Find the dual of A  B  C. 2

    5. (a) Explain the Identity Laws of Boolean


    Algebra. 2

    (b) State and prove the Addition Theorem of


    Probability. 4

    (c) Verify that p  q  ~ p is a contradiction. 2

    (d) What is Exclusive Disjunction ? Write truth


    table for p  q. 2

    MCS-013 3 P.T.O.

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy