‘Copyright of this book isreserved by Gujarat Secondary and Higher Secondary Education Board, Gandhinagar. No reproduction ofthis book in whole or in part, or in any form is permitted without written permission ofthe Secretary, Gujarat Seconclary and Higher Secondary Education Board, Gandhinagar. Gujarat Secondary and Higher Secondary Education Board, Gandhinagar QUESTION BANK MATHEMATICS Price: ~ 100.00 Published by : Secretary Gujarat Secondary and Higher Secondary Education Board, GandhinagarContribution Dr. Hasmukh Adhiya (LAS) ‘Shri RR. Varsani AS) ShriH. K-Patel (GA.S) ShriM. I oshi (GE.S) Coordination 1 Shri. K. Patel 2 Shri. A.Vankar 5. Shri GM. Rupareliya Expert Teachers ‘Shri Patimal B, Purohit (Convinet) ‘Shi Rameshehandra V. Vaishnav (Cosine) ‘Shi Kania N. Papa ‘Shi Vijykumar #.Dhandhaia Dr Manoj R Jovan ‘Shri Rameshanda D, Modha ‘Shri Bharaibhai H Patel ‘Shri Popatbhai P. Past Sti Gautam 3. Pac Som M.S. Pil ‘Shyi Ritesh ¥ Shahg ‘Shi Ashokbbai V, Pandya ‘Sori. K.Patel Shri PP Patel ‘Shri MaheshbaiB, Patel Shri Jayanti D. Khunt Shri NavojbhaiB. Ganga Shi Mayjthi M,Sudana ‘Shri Pankaj. Dave ‘Shri Jayanti J Patel ‘ShyiJayadan D. Pandya ‘Shri Mitesh C Shah ‘Shyi Robinkumar A, Parmar Shri Sharad B.Bakotra Principal Secretary, Education Department Gandhinagar Chairman ,GSRHLS.E, Bord, Gandhinagar Dy. Chairman, GS&HS B. Bord, Gandhinagar Secretary , GS&H.S.E, Bord, Gandhinagar OSD. GS&HSE. Boed, Gandhinagar Assistant Sceretary (Retd.), GS&H.S.B, Bord, Gandhinagar Assistant Secretary, GS&HS.E, Bord, Gandhinagar ‘St. Xaviers School Surat Sardar Pate & Swami Vivekanand Highschool, Maninags, Ahmedabad S.F.A. Convent School, Navsari R.PTP High School Valabhvidhyanagar, Anand D.N High School, Anand ‘Swami Vivekanand Vidhyavar, Se 12, Gandhinagar ‘Aash Secondary School, ijapur, Dist Mehsana CN. Vidhyalaya, Ambavad, Ahmedabed 1M. K, Higher Sccondary, Law Garden, Ahmedabad ‘est High School, Maninagar, Ahmedabad -Muktajivan High Schoo, Isanpur, Ahmedabad ‘Vidhyanaga High School, Ushmanpura, Ahmedabad ‘Shri M.B, Karnavat High School, Palanpur Dist. Banaskantha Shri K.C.Kethari High School, Surat (CU Shah Higher Secondary School, Ashram Road, Ahmedabad ‘Shri RK. Gharshala Vinaymandit, Bhavnagar “Zaverchand Meghani High Schoo, Bagasar, Dist. Ame ‘Shi Sardar Pat! Vidhyamandic (Mave, Rajat CU Shah Higher Secondary School, Ashram Road, Ahmedabad Sheth C.M. High School, Sec. 13, Gandhinagar .N High School, Anand 4H. &D. Parekh High School, Kheda Kasturba Kanya Vidhyalaya, Anand. Saint Xaviers High School, Adipur, KutchPREFACE Uptil now , the Students had to appear in various entrance examinations for engineering and medical courses after std-12. The burden of examinations on the side of the students was increasing day-by-day. For alleviating this difficulty faced by the students, from the current year, the Ministry of Human Resource Development , Government of India, has Introduced a system of examination covering whole country. For entrance to engineering colleges, JEE(Main) and JEE(Advanced) examinations will be held by the CBSE. The Government of Gujarat has except the new system and has decided to follow the examinations to be held by the CBSE, Necessary information pertaining to the proposed JEE (Main) and JEE(Advanced) examination is avilable on CBSE website www.chse.nic.n anditis requested that the parents and students may visit this website and obtain latest information — guidance and prepare for the proposed examination accordingly. The detailed information about the syllabus of the proposed examination, method of entrances inthe examination /centers/ placescities ofthe examinations et. is available on the said website. You are requested to go through the same carefully. The information booklet in Gujarati for JE Main) examination booklet has been brought out by the Board for Students and the beneficieries and a copy of this has been already sent to all the schools of the state, You are requested to take full advantage ofthe same also However, itis very essential to visit the above CBSE website from time to time for the latest information ~ guidance . An bumble effort has been made by the Gujarat secondary and Higher Secondary Education Boards, Gandhinagar for JEE and NEET examinations considering the demands of the students and parents ,a question bank hasbeen prepared by the expert teachers of the science stream in the state. The MCQ type Objective questions in this Question Bank will provide best guidance tothe students and we hope that it will be helpful for the JBE and NEET examinations, It may please be noted that this “Question Bank” is only for the guidance of the Students and itis not a necessary to believe that questions given in it will be asked in the examinations. This Question Bank is only for the guidance and practice of the Students. We hope that this Question Bank will be useful and guiding forthe Students appearing in JEE and NEET entrance examinations. We have taken all the care to make this Question Bank error free, however, if any error or omission is found, you are requested to refer to the text— books. MAL. Joshi R.R. Varsani (IAS) Date: 02/01/2013 Secretary Chairman,Unit-1 Unit-2 Unit-3 Unit-4 Unit-5 Unit-6 Unit-7 Unit-8 Unit-9 PARI Sets, Relation and Functions ‘Complex Numbers Matrices & Determinants Permutation adn Combination Principle of Mahtematical Induction Binomial Theorem Sequences & Series Limit & Continuity Indefinite and Definite IntegrationUnit - 1 Sets, Relation and Funct Important Points 1, Sets : set is an undefined terms in mathemetics. set means a well-defined collection of objects. Set is denoted by A, B, C, X, Y, Z, ... ete. The objects in a set are called elements of the sets are denoted by a, b, c, x, y, z ete. If x is a member of set A, then we write x € A, which is read as x belongs to A. 2. Methods of expressing a set There are two methods of expressing a set. (1) Listing Method (Roster From) : In this method elements of the set are explicity written (listed) separated by commas (2) Property Method (set Builder Form) : In this method a set is expressed by ‘some common characteristic property p(x) of elemernts x of the set. We have the notation {x | p(x) = (atThe property of x} which is read as the set of all x possesing given propety p(x). 3. Types of sets (1) Singleton set : A set consisting of only one elements is called a singleton set. (2) Empty set : A set which does not contain any element is called an empty set A set which is not empty is called a non-empty set. (3) Universal set : Generally when we consider many sets of similar nature the elements in the sets are selected from a definite set. This set is called the universal and it is denoted by U. Sub set : A set A is said to be subset of a set B if every element of A is also an element set B If a set A is a subset of a set B then B is called super set of A (4) Power set : For any set A, the set consisting of all the subsets of A is called the power set of A and it is denoted by P(A) (5) Equal sets : Two sets A and B are said to be equal sets, if they have the same elements Thus if for all x if x © A, then x € B and if for all x, if x € B then xe A, then A= B, In other words if Ac B and Bc A, then A= B (6) Finite and infinite sets = (1) Finite set : A set is said to be finite if it has finit (2) Infinite set : A set is said to be infinite if it has an infinite number of elements. Operations on sets : (7) Union of sets : Let A, B € P(U) The set consisting of all elements of U which are in A or in B is called the union of sets A and B and it is denoted by A U B. The operation of taking the union of two sets is called the union operation. ae @LD Aa number of elementsThus, AUB = [xiv € Aorx€ B) (8) Intersection of Sets : Let A, B € P(U) Then the set consisting of all elements of U which are in both A and B is called the intersection set of sets A and B and is denoted by AO B. The operation of fining the intersection of two sets is called the intersection operation. Thus, ANB = {xlr € Aand xe B) (9) An Important Resut For union : () AUBe PU) Q)ACAUB,BCAUB G)AUA=A (@) IfACB and CCD then (AUB) CBUD) (5) Commutative law AUB =BUA (6) (AUB) UC = AUB UC) Associative law MAUO=A (8) AUU=U (10) For Intersection () ANBe PU) 2) (ANB) CA (ANB)CB @)ANA=A (4) IFAC B, CCD then (AN) CBAD) (5) AQ B=B OA Commutatinve law (©) AN BAC =(ANB) AC Associatative law MANO=6 (8) ANU=A (11) Distrbutive laws : (M ANBLO=(AnB LANG Q)AVBAC)=(AUB)A(AUO) joints sets : Non-empty sets A and B are said to be disjoint if their intersection is the empty set, If A and B are disjoint sets then A. B = (13) Complementation : For A € P(U) the set consting of all those elements of U which are notin A, is called complement of A and is denoted by A The operation of finding the complement of a set is called complementaion operation, Here. A’ = {lve U and x @ A} (14) Difference set : For the sets A, B € P(U) the set consisting of all elements of A which are not in B, is called the difference set A and B, This set is denoted by A~B. The operation of taking the difference of two sets is called the difference operation. a2)(15) Symmetric Difference set : For sets, A, B € P(U) the set consisting of all elements which are in the set A or in the set B, but not in both is called symmetric difference of the set A and B. Symmetric difference of two sets is denoted by AAB. (16) Cartesian Product of Sets : Let A and B be two non-empty sets. Then the set of all ordered pairs (x, y), where x € A, y € B is called cartesian product of A and B and cartesian product of A and B is denoted byA x B (read : “A crooss B") Thus, Ax B = {(x, ylve A, y © B) If A or B or both are empty sets then we take A x B = 6 Also Ax A = A? An Important Result : () IfACB thenAU BandANB=A Q) ANA’=6. AUA' =U, g=UU'=6, (AY=A GB) A- AB’ and B-A= A’(\B (4) A-BcAandB-ACB (3) A'=U-A (6) If AcB then B'cA’ @) AAB=(AUB)-(ANB)=(A-B)U (B-A) (17) Number of Elements of a Finite set n(A) denotes the number of elements in a finite set A An Importantan result : (1) n(AUB) = n(A) + n(B) A, B are disjoints sets n(A UB UC) =n(A) + n(B) + n(C) A,B, C are disjoint sets 2) mA UB) =n(A) +B) — (A 9B) n(AUB UC) =a(A) +n(B) + n(C) = nA MB) = n(B AC) = nC MA) + nA ABAC) 3) mCANB') = mA) ~ nA 9 BY (4) n(A'NB) = n(B) — n(A 9 B) (5) n(A UB) = n( ANB’) + n(A'B) + 2(A 9 B) (6) (Ax B) = n(B x A) = (A) - 1B) (1) Ax Bx C)=n(A) -n(B)-(C) (8) (Ax A) = (n(A)PL bhi Relations Relation : For any non-empty sets A and B, a subset of Ax B is called a relation from AtoB. IFS is a relation in Ai.e. SCA XA and (x, y) € S, we say x is related to y by S or xSy Some verious types of relation, (1) Void or Empty relation : A relation in the set A with no elements is called an empty relation, § CA A, @ is a relation called empty relation. (2). Universal Relation : A relation in the set A which is A x A itself is called a universal relation. (3) Reflexive Relation : If S is a relation in the set A and aSa, Va € Ai.e. (a, a) € S,ae A, we say S is a reflexive relation (4) Symmetric Relation + If S is a relation in a set A and if aSb = bSa ice. (a, b) € S= (b,a) € SV a,b © A. We say S is a symmetric realtion in A. (5) Transitive Relation : If S is a relation in the set A and if aSb and bSe => aSe Va,b,ce Ai, (a, b) € Sand (b,c) € $= (a,c) SV a,b,c A, thus wwe say that S is a transitive relation in A. Equivalence Relation : Ifa relation S in a set Ais reflexive, symmetric and transitive is called an equivalence relation in A. IFS is equivalence relation and (x, y) € $ then x ~ y. Antisymmetric Relation : If S ia a relation in A and if (a, b) € S and (b, a) € S = a =bV a,b, € Athen S is said be an antisymmetric relation. Equivalence Classes : Let A be an equivalence relation in A. let a € A, then the subset, {x € A, xSa) is said to be equivalence class corresponding to a. Remamber : If A has m and B has n elements then A x B has mn odered pairs <. No of subsets of A x B is 2" ++ Total no, of relations from A to B= 2" A relation R is a set is said to be identify relation if R = (a, a); a € A} Indentify relation on a non-empty set is an equivalence relation, Universal relation on a non-empty set is an universal relation, Indentify relation on a non-empty y set is anti-symmetric,Function Funetion : Let A and B be two non-empty sets and fc (Ax B) and f# 4. Then f A Bis said to be a function. if V x € A. there corresponds a unique ordered pair (x, y) € f. The set A is called the domain and B is called the codomain of the function, > The domain and range of a function f : A> B are denoted by Dyand R, respectively. Equal Funetions : Two function are said to be equal if their domains, codomains and graphs (set of ordered pairs) or formula (if any) are equal. Fora function f : A B, fix) is said to be value of fat x or image of x under. and xis called pre image of (x) Some Special Functions : (1) _Indentity Function : Let A be a non-empty set. The function f : A> A defined by (fit) = x x € Ais called the identity function on A. (2) Constant Function : A function whose range is singleton is called a constant function. (3) Modulus Function : The function f: R > R defined by jx) =l is called modulus, function where |x| (4) Signum Function : The function f : R -> R defined by foo) = is called signum function. (3) Polynominal Function : Let a function g be defined as g : R > R g(x) = a,x"4a,, 181 +. + ay x + do, di, #0 Then g is called polynominal function, @) (6) Rational Function : A function h(x), which can be expressed as (x) = io where f(s) and g(x) are polynominal function of x defined ina domain where g(x) #0 is called a rational function, (7) Greatest Integer Function : The function f : R - R defined by f(x) = [x], assumes. the value of the greatest integer, less than or equal to x, [x] is also the greatest integer not exceeding x this function is called the greatests integet function. This function is also called ‘Floor’ function (8) Ceiling Function : ¢ : R > R given by g(x) = [x] = least integer not less than x. This function is called ‘ceiling’ function. (9) One-One Function : If f: A —> B is a function and if WV x),.x9 € A, xy # x2 = fix) # foxy), we say f: A> B is a one-one function, also called injective function, (10) Many-one function : If f: A — B is a function and if Sx,x) € A such that x, # x9 and fix,) = fox), then f : A > B is said to be a many-one function. (11) On to fun If the range of the function f: A B is B we say that fis on onto EDfunction or surjective function or more If Ry= fA) = B then, f is on to. (12) Composite Function : If f: A—> B and g : B —> C are two function their composite function gof : A C is defined by gof(x) = g(f)) Iff: A> Band g : C+ Dare functions anf RC D, gof : A> D is defined by gof(x) g(x) Inverse Function : If f: A B is a function and if there exists a function g : B > A such that gof = I, and fog = Ip we say g : B —> Ais the inverse function of f: A — B and denoted by Some Important Formula If f: A= B has inverse g : B > A then f: A > B is one-one and onto. If f is one-one and onto it has an iverse g : BA fA Bis one-one and onto if and only if (exists. Iff: A> Band g : BC are one-one and onto, gof : A> C is one-one and onto and (gof}"! = flo gt Inverse -Triogonometric Function. tide Function Domain Range (1) fe) = sin x E11 [#4] (2) fix) = cos! x Hu 3) fx) = tan! x R (4) fix) = cot! x R (5) fla) = sec“! x (+s, =I] UL, 29) (6) fix) = cosec! x Ge, 1] U EL, ©) Formula for domain of function. (1) DF * 8) =D) 9 Deg) (2) Dif) = Di) 9 Dig) f ) (4) = DNA Dig 9 {x: glx) #0} @) D(vF) = DM q te: fw) > 0} (5) D(fog) = D(g) where (fog)(x) (g(x)