#1
| |||
| |||
Scholastic Aptitude Test Free Download |
#3
| |||
| |||
Re: scholastic aptitude test free download
As you want here I am giving below Scholastic Aptitude Test practice paper on your demand : This section has Five Questions. Each question is provided with five alternative answers. Only one of them is the correct answer. Indicate the correct answer by A, B, C, D, E. (5x2=10 MARKS) 1. = A) B) -2009 C) D) -1 E) 1 2. Let a, b, c be the lengths of the sides of a triangle ABC. Let , , be positive integers and p = a+ b+ c, q = a+ b+ c and r= a+ b+ c.Then p, q, r are lengths of the sides of a triangle A) only if , , are all distinct B) only if + > , + > , + > C) only if > > D) only if >a, >b, >c E) for all values of , , 3. Let f:R R be defined by f(x) = x2 for all x in R. Let A = {4, 3, 0, -1}. Then A) f -1(A) is not defined as f -1 does not exist B) For any function f: PQ, if T is a subset of Q, then f -1(T) is defined and here f -1(A) = {-2, 2, , - , 0} C) f -1(A) is not defined as ‘-1’ has no pre-image under the function f D) f -1(A) = f (A) E) None of these 4. If 1216451*0408832000 is equal to 19!, where * denotes a digit, then the missing digit represented by * is A) 0 B) 4 C) 2 D) 5 E) 7 5. A polynomial f(x) is said to be reducible if it can be written as f(x) = g(x)h(x) where deg(g(x)) > 1 and deg(h(x))>1. Otherwise it is said to be irreducible. If f(x) is a polynomial of degree 2009, Choose the correct statement from the following. A) There are infinitely many f(x) that are irreducible B) There are exactly 2009 f(x) that are irreducible C) f(x)=x2009 +1 is an irreducible polynomial D) There exists no f(x) that is irreducible E) none of these Scholastic Aptitude Test practice paper |
|