Scribd Logo
Upload

Welcome to Scribd!

  • 72 views

    Imcs-Ols: MCA (Revised) / BCA (Revised) Term-End Examination June, 2017

    Uploaded by

    hemali
    This document is an exam for a Discrete Mathematics course consisting of 5 questions with multiple parts each. It covers topics like logic, sets, permutations, probability, and mathematical induction. The exam has a total of 50 maximum marks and is 2 hours long. Question 1 is compulsory while students must attempt 3 questions from the remaining 4.

    Copyright:

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

    Imcs-Ols: MCA (Revised) / BCA (Revised) Term-End Examination June, 2017

    Uploaded by

    hemali
    72 views4 pages
    This document is an exam for a Discrete Mathematics course consisting of 5 questions with multiple parts each. It covers topics like logic, sets, permutations, probability, and mathematical induction. The exam has a total of 50 maximum marks and is 2 hours long. Question 1 is compulsory while students must attempt 3 questions from the remaining 4.

    Original Description:

    Assignment

    Original Title

    mcs-013

    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 an exam for a Discrete Mathematics course consisting of 5 questions with multiple parts each. It covers topics like logic, sets, permutations, probability, and mathematical induction. The exam has a total of 50 maximum marks and is 2 hours long. Question 1 is compulsory while students must attempt 3 questions from the remaining 4.

    Copyright:

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

    Imcs-Ols: MCA (Revised) / BCA (Revised) Term-End Examination June, 2017

    Uploaded by

    hemali
    This document is an exam for a Discrete Mathematics course consisting of 5 questions with multiple parts each. It covers topics like logic, sets, permutations, probability, and mathematical induction. The exam has a total of 50 maximum marks and is 2 hours long. Question 1 is compulsory while students must attempt 3 questions from the remaining 4.

    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 Imcs-ols I


    MCA (Revised) / BCA (Revised)
    Term-End Examination
    03701. June, 2017

    MCS-013 : DISCRETE MATHEMATICS

    Time : 2 hours Maximum Marks : 50

    Note : Question number 1 is compulsory. Attempt any


    three questions from the rest.

    (a) Negate the following :


    (i) (Vx By) (P(x) V Q(y))
    (Vx Vy) (P(x) A Q(y))
    (b) Write the contrapositive, converse and
    inverse of the conditional statement "The
    home team wins whenever it is raining."
    (c) Prove that if x2 — 4 = 0, then x # 0 by
    contradiction method. 3
    (d) Draw Venn Diagram to show the following
    set operations :
    (i) A U B
    (ii) A c B
    (iii) (A U B) nC
    MCS-013 P.T.O.
    (e) A box contains 10 chocolates. Find the
    number of n ordered samples of
    (i) size 3 with replacement, and
    (ii) size 3 without replacement.
    (f) How many solutions does x 1 + x2 + x3 = 11
    have where x i, x2 and x3 are non-negative
    integers with x 1 5 3, x2 5 4, x3 5 6 ?

    2. (a) Two dice, one red and one white are rolled.
    What is the probability that the white dice
    turns up a smaller number than the red
    dice ?
    (b) Four boys picked up 30 mangoes. In how
    many ways can they divide them if all the
    mangoes be identical ?
    (c) Find the Boolean expression for the
    following circuit :
    A

    C
    (d) How many words of three distinct letters
    can be formed from the letters of the word
    LAND ?
    MCS-013 2
    3. (a) Find the composition of the following two
    permutations and show that it is not
    commutative :
    f= r 1 2 3 4 1 2 3 4)
    (2 1 4 3) g = (3 2 1 4)
    (b) Given S = {1, 2, ..., 10} and a relation R on
    S where
    R = {(x, y) I x + y = 101.
    Find whether R has the following
    properties or not ?
    (i) Reflexive
    (ii) Transitive
    (iii) Symmetric
    (c) Show that the functions f(x) = x 3 and
    g(x) = x1/3 for all x E R are inverse of each
    other. 3
    (d) Under what conditions on sets A and B is
    AxB=BxA? 2

    4. (a) Find DNF of (p V q) <-> (p V q). 4

    (b) How many five-digit numbers are even ?


    How many five-digit numbers are
    composed of only odd digits ?
    (c) Draw the circuit for the following Boolean
    expression : Y = AB'C + AC' + B'C, using
    logic gates. 3

    MCS-013 3 P.T.O.
    5. (a) Construct truth table to check whether the
    following is a tautology or a contingency or
    a contradiction : 4
    (i) (p A q) (p v q)

    (ii) ((— q A p) A q)

    (b) If the temperature is — 6°, then it is cold.


    Write the
    (i) converse, and
    (ii) contrapositive. 2

    (c) Show that


    1 1 1
    + +
    1.2 2.3 n.(n+1) n+1

    by mathematical induction.

    MCS-013 4 10,000

    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