Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    June 2020

    Uploaded by

    plant cancer
    This document is the exam for the course MCS-013 Discrete Mathematics. It contains 6 questions with multiple parts each. The exam has a total of 50 maximum marks and is 2 hours long. Question 1 is compulsory, while students must attempt any 3 questions from the remaining questions 2 through 5.

    Copyright:

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

    June 2020

    Uploaded by

    plant cancer
    12 views4 pages
    This document is the exam for the course MCS-013 Discrete Mathematics. It contains 6 questions with multiple parts each. The exam has a total of 50 maximum marks and is 2 hours long. Question 1 is compulsory, while students must attempt any 3 questions from the remaining questions 2 through 5.

    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 is the exam for the course MCS-013 Discrete Mathematics. It contains 6 questions with multiple parts each. The exam has a total of 50 maximum marks and is 2 hours long. Question 1 is compulsory, while students must attempt any 3 questions from the remaining questions 2 through 5.

    Copyright:

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

    June 2020

    Uploaded by

    plant cancer
    This document is the exam for the course MCS-013 Discrete Mathematics. It contains 6 questions with multiple parts each. The exam has a total of 50 maximum marks and is 2 hours long. Question 1 is compulsory, while students must attempt any 3 questions from the remaining questions 2 through 5.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 4

    No.

    of Printed Pages : 4 MCS-013


    M. C. A.B. C. A. REVISED
    (MCA/BCA)
    Term-End Examination
    June, 2020
    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) Check whether the following formula is


    tautology, contradiction or contingency : 5

    ((13 Q).-± v v (ID)

    (b) Two finite sets have x and y number of


    elements. The total number of subsets of
    the first set is four times the total number
    of subsets of second set. Find out the value
    of x — y. 4

    P. T. O.
    [2] MCS-013

    (c) In a group of 400 people 250 can speak in


    English only and 70 can speak Hindi only.3

    (i) How many can speak English ?

    (ii) How many can speak Hindi ?

    (iii) How many can speak both English


    and Hindi ?

    (d) If f A —> B and g : B —> C are injective


    function, then gof: A —> C is an injective
    function. Prove or disprove. 3
    (e) Use the method of proof by contradiction to
    show that x e R. if x 3 + 4x = 0 , then x = O.
    3
    (f) Three persons enter in a railway
    compartment. If there are 5 seats vacant,
    in how many ways they can take these
    seats ? 2

    2. (a) Given : 5
    A = {1, 3, 5, 7}

    B = {2, 3, 5, 8}

    List the elements of (A x B) x (B — A).

    Is (A x B) (B — A) a subset of A x B ?
    [3] MCS-013

    (b) Prove that : 5


    n+lcr (0 5
    n Cr ner-1 = r n) .

    3. (a) Show that in any set of eleven integers


    there are two which are divisible by 10, by
    applying pigeonhole principle. 3
    (b) How many solutions are there of : 4
    x+y+z=17
    subject to the constraints :
    x 1
    y 2

    z2 3.
    (c) If : 3
    1
    P (A) = —
    4

    P (B) = —
    5

    and P (A u B) = 1—
    2
    find :
    (i) • P (A n B)

    P (A n H)

    P. T. O.
    141 MCS-013

    4. (a) Five balls are drawn from a bag containing


    6 white and 4 black balls. What; is the
    probability that 3 are white and 2 black ? 3

    (b) From the digit 1, 2, 3, 4, 5, 6, how many


    three digit odd numbers can be formed
    when
    (i) repetition of digit is allowed ? 2
    (ii) repetition of digit is not allowed ? 2
    (c) How many numbers divisible by 2 lying
    between 50,000 and 70,000 can be formed
    from the digits 3, 4, 5, 6, 7, 8, 9, no digit
    being repeated in any number. 3
    5. (a) Show that : 4
    1.2 + 2.3 + n (n + 1) — n (n + 1) (n + 2)
    3
    (b) Write the negation of the following
    statement : 2
    If it is raining, then the game is cancelled.
    (c) Draw the circuit represented by the
    following Boolean function : 4
    f : xy +

    MCS-013
    364o

    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