Mathematics - Functions
Practise 39 BITSAT previous year questions on Functions, compiled from papers spanning 2009 to 2024. Each question is pulled directly from the actual exam paper it appeared in, so you're practising in the exact style and difficulty BITSAT tests.
Functions has been asked in 15 of the 16 years of BITSAT papers analysed (2009–2024), with 39 questions in all. 51% of them were easy, 44% moderate and 5% tough. Most of its questions came from 2024, with 9 questions that year. In the last three years (2022–2024) it had 13 questions across 6 papers, about 2.2 per paper.
The chapter's 10 topics are not weighted equally: Composite Function (8 questions, 21%), Domain (7 questions, 18%), and Types of Function (Mapping) (6 questions, 15%) have been asked the most. Composite Function has also led over the last five years, with 5 questions. Domain has produced the most tough questions (1).
- 1The domain of the real valued function is2024 (Memory Based Paper 1)Domain
- 2If a function defined by is a bijection, then2024 (Memory Based Paper 1)Types of Function (Mapping)
- 3, then is invertible if2024 (Memory Based Paper 1)Periodicity
- 4Let the function be given by . Then, g is2024 (Memory Based Paper 1)Odd and Even Functions
- 5, where x is not an integral multiple of and [.] denotes the greatest integer function, is2024 (Memory Based Paper 2)Odd and Even Functions
- 6The function defined by is2024 (Memory Based Paper 2)Types of Function (Mapping)
- 7If are defined by , then is equal to2024 (Memory Based Paper 2)Composite Function
- 8Let denote the greatest integer . If and , then the value of is2024 (Memory Based Paper 3)Composite Function
- 9Number of real solution of is equal to2024 (Memory Based Paper 3)Number of Solutions
- 10If , then (fof of) is2023 (Memory Based Paper 1)Composite Function
- 11The domain of the function is2023 (Memory Based Paper 2)Domain
- 12Consider the function in defined as , then is equal to2023 (Memory Based Paper 2)Inverse of a Function
- 13If and then is equal to2022Composite Function
- 14The domain of the function is given by2021Domain
- 15Let denote the greatest integer . If and then the value of is2020Composite Function
- 16The domain of the function is2020Domain
- 17Number of solution of the equation | cos x | = 2 [ x ] are (where | x | , [ x ] are modulus and greatest integer function respectively).2019Number of Solutions
- 18The inverse of the function f x = log a x + x 2 + 1 (where, a 0 , a 1 ) is2018Inverse of a Function
- 19Let f : R R be a function satisfying f x + y = f x + 2 y 2 + k x y for all x , y R . If f 1 = 2 and f 2 = 8 , then f x is equal to2018Functional Equation
- 20Let A = - 1 , 1 and f : A A be defined as f x = x x for all x A , then f x is2017Types of Function (Mapping)
- 21If a function f : R R satisfy the equation f ( x + y ) = f ( x ) + f ( y ) , x , y and the function f ( x ) is continuous at x = 0 , then2017Functional Equation
- 22Let then fof provided that:2016Composite Function
- 23Match List I with List II and select the correct answer using the code given below the lists: \( {array}{l|l} {List I} & {List II} \\ {(A)} 2016Number of Solutions
- 24The period of is2015Periodicity
- 25The domain of the function2015Domain
- 26The domain of the function is2014Domain
- 27Let be a function defined by where then2014Types of Function (Mapping)
- 28If is an even function and is an odd function, then the function fog is2012Odd and Even Functions
- 29If \(f(x)\) is a function that is odd and even simultaneously, then \( {f}(3)- {f}(2)\) is equal to2011Odd and Even Functions
- 30If \(f(x)= \{ {array}{l}x ; { when } x { is rational } \\ 1-x ; { when } x { is irrational } {array} .\), then fof \((x)\) is given as2011Composite Function
- 31If \(f(x)= {1-x}{1+x}\) the domain of \(f^{-1}(x)\) is2011Inverse of a Function
- 32A black die and a white die are rolled. Find the probability that the number shown by the black die will be more than twice that shown by th2010Types of Function (Mapping)
- 33Let \(E=\{1,2,3,4\}\) and \(F=\{1,2\}\). Then the number of onto functions from \( {E}\) to \( {F}\) is2010Composite Function
- 34The range of the function \(f(x)= {x^2-x+1}{x^2+x+1}\) where \( {x} {R}\), is2009Range
- 35If \( ( {z}_1 )= (z_2 )\), then2009Range
- 36Find the vertex of the parabola \(x^2-8 y-x+19=0\).2009Identical Functions
- 37Given below is a frequency distribution with median 46 . In this distribution, some of the frequencies are missing : Determine the missing f2009Types of Function (Mapping)
- 38If \(y=e^{-x} x\) and \(y_4+k y=0\), where \(y_4= {d^4 y}{d x^4}\), then \(k=\)2009Domain
- 39The value of \( _{x 0} { (4^x-1 )^3}{ {x^2}{4} (1+3 x)}\), is2009Periodicity
Frequently Asked Questions
1.How many questions are available for Functions?
This chapter includes 39 questions compiled from BITSAT papers spanning 2009 to 2024.
2.Are these questions only from BITSAT, or from other exams too?
These are BITSAT questions specifically for the Functions chapter. Questions from other exams like JEE Main or NTA Abhyas (JEE Main) are organised separately under their respective exam sections.
3.Is Functions an important chapter for BITSAT Mathematics?
Functions has appeared in 15 of the 16 years of BITSAT papers covered here, with 39 questions across 18 papers - about 2 per paper it appears in.
4.What is the difficulty level of Functions questions in BITSAT?
Of the 39 questions analysed for this chapter, 51% are easy, 44% moderate and 5% tough. 2024 had the most, with 9 questions.
5.Which topics in Functions should I focus on?
These topics have carried the most weightage in Functions:
- Composite Function - 8 questions (21%)
- Domain - 7 questions (18%)
- Types of Function (Mapping) - 6 questions (15%)
- Domain has produced the most tough questions (1).
6.Is Functions's weightage in BITSAT going up or down?
Across all 18 papers analysed, Functions has averaged about 2.2 questions per paper. In the last three years (2022–2024), that average has stayed about the same, at about 2.2 questions per paper. Use the year-wise numbers on this page for the exact trend before you decide how much time to give it.