Scribd Logo
Upload

Welcome to Scribd!

  • 15 views

    MCQ Funcrion and Relation

    Uploaded by

    Harish Karthik
    Maths Mcq test class 12

    Copyright:

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

    MCQ Funcrion and Relation

    Uploaded by

    Harish Karthik
    15 views5 pages
    Maths Mcq test class 12

    Original Title

    MCQ_Funcrion_and_relation[1]

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Maths Mcq test class 12

    Copyright:

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

    MCQ Funcrion and Relation

    Uploaded by

    Harish Karthik
    Maths Mcq test class 12

    Copyright:

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

    ROCKFORD SENIOR SECONDARY SCHOOL-HOSUR

    IMAGINE, INNOVATE, INSPIRE

    Mathematics -XII
    MCQ:20 marks
    1.The function f : A → B defined by f(x) = 4x + 7, x ∈ R is
    (a) one-one
    (b) Many-one
    (c) Odd
    (d) Even
    2. The smallest integer function f(x) = [x] is
    (a) One-one
    (b) Many-one
    (c) Both (a) & (b)
    (d) None of these
    3. The function f : R → R defined by f(x) = 3 – 4x is
    (a) Onto
    (b) Not onto
    (c) None one-one
    (d) None of these

    4. A relation R in a set A is called _______, if (a1, a2) ∈ R implies (a2, a1) ∈ R, for all a1, a2 ∈
    A.

    (a) symmetric

    (b) transitive

    (c) equivalence

    (d) non-symmetric

    5. Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then R
    is

    (a) Reflexive and symmetric

    (b) Transitive and symmetric

    (c) Equivalence

    (d) Reflexive, transitive but not symmetric


    6. The maximum number of equivalence relations on the set A = {1, 2, 3} are

    (a) 1

    (b) 2

    (c) 3

    (d) 5

    7. If set A contains 5 elements and the set B contains 6 elements, then the number of one-one
    and onto mappings from A to B is

    (a) 720

    (b) 120

    (c) 0

    (d) none of these

    8. Let f : [2, ∞) → R be the function defined by f(x) = x2 – 4x + 5, then the range of f is

    (a) R

    (b) [1, ∞)

    (c) [4, ∞)

    (d) [5, ∞)

    9. Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1,3)}.
    Then R is

    (a) reflexive but not symmetric

    (b) reflexive but not transitive

    (c) symmetric and transitive

    (d) neither symmetric, nor transitive

    10. If f: R → R be given by f(x) = (3 – x3)1/3, then fof(x) is

    (a) x1/3
    (b) x3

    (c) x

    (d) (3 – x3)

    11. Let f : A → B and g : B → C be the bijective functions. Then (g ∘ f)–1 is

    (a) f–1 ∘ g–1

    (b) f ∘ g

    (c) g–1 ∘ f–1

    (d) g ∘ f

    12. Let f : R → R be defined by f(x) = x2 + 1. Then, pre-images of 17 and – 3, respectively,


    are

    (a) φ, {4, – 4}

    (b) {3, – 3}, φ

    (c) {4, –4}, φ

    (d) {4, – 4}, {2, – 2}

    13. Let f : R → R be defined by f(x) = 3x – 4. Then f–1 (x) is given by

    (a) (x + 4)/3

    (b) (x/3) – 4

    (c) 3x + 4

    (d) None of these

    14. Let A = {1, 2, 3}. Then the number of relations containing (1, 2) and (1, 3), which are
    reflexive and symmetric but not transitive is

    (a) 1

    (b) 2

    (c) 3
    (d) 4

    15. An Equivalence relation is always symmetric.


    a) True
    b) False

    16. Which of the following relations is symmetric but neither reflexive nor transitive
    for a set A = {1, 2, 3}.
    a) R = {(1, 2), (1, 3), (1, 4)}
    b) R = {(1, 2), (2, 1)}
    c) R = {(1, 1), (2, 2), (3, 3)}
    d) R = {(1, 1), (1, 2), (2, 3)}

    17. Let R be a relation in the set N given by R={(a,b): a+b=5, b>1}. Which of the
    following will satisfy the given relation?
    a) (2,3) ∈ R
    b) (4,2) ∈ R
    c) (2,1) ∈ R
    d) (5,0) ∈ R

    18. Let f:R->R be defined as f(x)=x4, then

    a) f is one-one

    b) f is many-one onto

    c) f is one-one but not onto

    d) f is neither one-one nor not onto

    19) The function f : R → R defined by f(x) = 1-6x is


    (a) Onto
    (b) Not onto
    (c) None one-one
    (d) None of these

    20) Let f:R->R be defined as f(x)=x2+3x-27, then

    a) f is one-one

    b) f is many-one onto

    c) f is one-one but not onto


    d) f is neither one-one nor not onto

    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