Scribd Logo
Upload

Welcome to Scribd!

  • 2K views

    Discrete Mathematics Prelims Quiz 2 by Bertski

    Uploaded by

    Nicoco Loco
    This document contains a quiz on discrete mathematics with multiple choice questions. Some of the questions covered include: counting the number of 3-letter words that can be formed from a given word without repetition; definitions of factorial and function; possible ranges of functions; combinations vs arrangements; set operations like intersection and union; counting arrangements with restrictions; the additive principle; recursive definitions of functions; and evaluating functions. The document provides the questions and correct answers.

    Copyright:

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

    Discrete Mathematics Prelims Quiz 2 by Bertski

    Uploaded by

    Nicoco Loco
    2K views5 pages
    This document contains a quiz on discrete mathematics with multiple choice questions. Some of the questions covered include: counting the number of 3-letter words that can be formed from a given word without repetition; definitions of factorial and function; possible ranges of functions; combinations vs arrangements; set operations like intersection and union; counting arrangements with restrictions; the additive principle; recursive definitions of functions; and evaluating functions. The document provides the questions and correct answers.

    Original Description:

    AMA Source

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains a quiz on discrete mathematics with multiple choice questions. Some of the questions covered include: counting the number of 3-letter words that can be formed from a given word without repetition; definitions of factorial and function; possible ranges of functions; combinations vs arrangements; set operations like intersection and union; counting arrangements with restrictions; the additive principle; recursive definitions of functions; and evaluating functions. The document provides the questions and correct answers.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    2K views5 pages

    Discrete Mathematics Prelims Quiz 2 by Bertski

    Uploaded by

    Nicoco Loco
    This document contains a quiz on discrete mathematics with multiple choice questions. Some of the questions covered include: counting the number of 3-letter words that can be formed from a given word without repetition; definitions of factorial and function; possible ranges of functions; combinations vs arrangements; set operations like intersection and union; counting arrangements with restrictions; the additive principle; recursive definitions of functions; and evaluating functions. The document provides the questions and correct answers.

    Copyright:

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

    Discrete Mathematics Prelims Quiz 2 by Bertski

    How many 3-letter words with or without meaning, can be formed out of the letters of the
    word, 'LOGARITHMS', if repetition of letters is not allowed?

    Answer: 
    The correct answer is: 720

    Defined as the product of all the whole numbers from 1 to n.

    Answer:
    The correct answer is: factorial

    GIven the function :

              f : Z → Z defined by f  =  3n
    Which of the following is a  possible range of the function?
    The correct answer is: all multiples of three

    IN combinations, the arrangement of the elements is in a specific order.


    The correct answer is 'False'.

    Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}


    Find A ∩ B
    The correct answer is: {3, 4, 5}

    In how many different ways can the letters of the word 'OPTICAL' be arranged so that the
    vowels always come together?
    The correct answer is:
    In how many different ways can the letters of the word 'OPTICAL' be arranged so that the
    vowels always come together?
    Answer : [720]
    Answer the following:

                            f  (1) = 

                           What is the element n in the domain such as f  = 1          

                           Find an element n  of the domain such that f    =  n.    


    The correct answer is:

      Answer the following:


                            f  (1) = [4]

                           What is the element n in the domain such as f  = 1   [2]     

                           Find an element n  of the domain such that f    =  n.    [3]                         

    Out of 7 consonants and 4 vowels, how many words of 3 consonants and 2 vowels can be
    formed?
    The correct answer is: 210

    It is a rule that assigns each input exactly one output


    The correct answer is: function
    Determine the number of elements in A U B.
    The correct answer is: 18

    Rule that states that every function can be described in four ways: algebraically (a formula),
    numerically (a table), graphically, or in words.
    The correct answer is: Rule of four

    people like apples and carrots. Also, four people are such that they like bananas and carrots.

     How many people like apples only? 

     How many people like only one of the three?    


    The correct answer is:
    Let A, B and C represent people who like apples, bananas, and carrots respectively. The number
    of people in A = 10, B = 12 and C = 16. Three people are such that they enjoy apples, bananas as
    well as carrots. Two of them like apples and bananas. Let three people like apples and carrots.
    Also, four people are such that they like bananas and carrots.
     How many people like apples only? [2]
     How many people like only one of the three? [26]

    Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}


    Find A U B
    The correct answer is: {1, 2, 3, 4, 5, 6, 7}

    The ________________________ states that if event A can occur in m ways, and event B can occur
    in n disjoint ways, then the event “A or B” can occur in m + n ways.
    The correct answer is: Additive principle
        Find f (1).
    The correct answer is: 4

    For a function f : N → N, a Answer definition consists of an Answer   together with


    a Answer . 
    The correct answer is:
    For a function f : N → N, a [recursive] definition consists of an [initial condition]  together
    with a [recurrence relation] .

    Additive principle states that if given two sets A and B, we have |A × B| |A| · |B|.
    The correct answer is 'False'.

    Consider the function f : N → N given by f (0) 0 and f (n + 1) f   + 2n + 1. Find f (6).


    The correct answer is: 36
    Given the diagram, answer the following questions :
    How many people takes tea and wine? Answer
    How many people takes coffee but not tea and wine? Answer
    What is the difference of persons who take wine and coffee to the persons who the persons
    who takes tea only? Asnwer
    The correct answer is:

    Given the diagram, answer the following questions :


    How many people takes tea and wine? [32]
    How many people takes coffee but not tea and wine? [45]
    What is the difference of persons who take wine and coffee to the persons who the persons
    who takes tea only? [15]

    You might also like