Scribd Logo
Upload

Welcome to Scribd!

  • 32 views

    MCA (Revised) / BCA (Revised) Term-End Examination December, 2018

    Uploaded by

    Deepak Kumar
    1. The document is a 3 page exam for a Discrete Mathematics course consisting of 5 multiple choice questions. It covers topics like sets, logic, probability, combinatorics, and number theory. Students have 2 hours to complete the exam which is out of 50 total marks. 2. Question 1 has 5 compulsory sub-questions related to sets, logic, and counting principles. Questions 2-5 each have 2 sub-questions testing knowledge of logic circuits, probability, combinatorics, functions, and number theory concepts. Full worked solutions are required. 3. The exam thoroughly tests understanding of core discrete math concepts and problems solving abilities.

    Copyright:

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

    MCA (Revised) / BCA (Revised) Term-End Examination December, 2018

    Uploaded by

    Deepak Kumar
    32 views3 pages
    1. The document is a 3 page exam for a Discrete Mathematics course consisting of 5 multiple choice questions. It covers topics like sets, logic, probability, combinatorics, and number theory. Students have 2 hours to complete the exam which is out of 50 total marks. 2. Question 1 has 5 compulsory sub-questions related to sets, logic, and counting principles. Questions 2-5 each have 2 sub-questions testing knowledge of logic circuits, probability, combinatorics, functions, and number theory concepts. Full worked solutions are required. 3. The exam thoroughly tests understanding of core discrete math concepts and problems solving abilities.

    Original Description:

    Question paper

    Original Title

    MCS-013 D18_compressed

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. The document is a 3 page exam for a Discrete Mathematics course consisting of 5 multiple choice questions. It covers topics like sets, logic, probability, combinatorics, and number theory. Students have 2 hours to complete the exam which is out of 50 total marks. 2. Question 1 has 5 compulsory sub-questions related to sets, logic, and counting principles. Questions 2-5 each have 2 sub-questions testing knowledge of logic circuits, probability, combinatorics, functions, and number theory concepts. Full worked solutions are required. 3. The exam thoroughly tests understanding of core discrete math concepts and problems solving abilities.

    Copyright:

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

    MCA (Revised) / BCA (Revised) Term-End Examination December, 2018

    Uploaded by

    Deepak Kumar
    1. The document is a 3 page exam for a Discrete Mathematics course consisting of 5 multiple choice questions. It covers topics like sets, logic, probability, combinatorics, and number theory. Students have 2 hours to complete the exam which is out of 50 total marks. 2. Question 1 has 5 compulsory sub-questions related to sets, logic, and counting principles. Questions 2-5 each have 2 sub-questions testing knowledge of logic circuits, probability, combinatorics, functions, and number theory concepts. Full worked solutions are required. 3. The exam thoroughly tests understanding of core discrete math concepts and problems solving abilities.

    Copyright:

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

    No.

    of Printed Pages : 3 1MCS-013(S)

    MCA (Revised) / BCA (Revised)


    Term-End Examination
    r. . . I 1 •11 1

    December, 2018

    MCS-013(5) : DISCRETE MATHEMATICS

    Time : 2 hours Maximum Marks : 50

    Note : Question number 1 is compulsory. Attempt any


    three questions from the rest.

    1. (a) Find the dual of


    (i) An(BnC).(AnB)nCand
    (ii) (A U B) n (A U C). 4
    (b) Give the geometric representation of
    R x (2). R is the set of Real Numbers.
    (c) Find the number of distinct sets of 5 cards
    that can be dealt from a deck of 52 cards.
    (d) Find the number of ways of placing
    n people in (n — 1) rooms, no room being
    empty. 4
    (e)
    Verify that p A q A (- p) is a contradiction
    and p co-* p v q is a tautology. 4
    MCS-013(S) 1 P.T.O.
    2. (a) Prove that if x, y E I such that xy is odd,
    then both x and y are odd, by proving its
    contrapositive. I is the set of Integers. 5

    (b) Design a logic circuit to operate a light


    bulb by two switches x i and x2.

    3. (a) A box contains 3 red, 3 blue and 4 white


    socks. In how many ways can 8 socks be
    pulled out of the box, one at a time, if order
    is important ? 5

    (b) Suppose 5 points are chosen at random


    within or on the boundary of an equilateral
    triangle of side 1 metre.
    Show how we can find two points at a
    1 5
    distance of at most — metre.
    2

    4. (a) Find the boolean expression for the


    following circuit : 4

    MCS-01 3(S) 2
    (b) Find the inverse of the following function : 3
    f(x) .= X3 — 3

    (c) State and explain Pigenhole principle. 3

    5. (a) A car manufacturer has 5 service centres in


    a city. 10 identical cars were served in
    these centres for a particular mechanical
    defect. In how many ways could the cars
    have been distributed at the various
    centres ? 6

    (b) Show that V5 is irrational. 4

    MCS-013(S) 3 14,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