1. 1 = 2 2n-1 find n= ?

8 n-3

2. 6x-3 = 36 x-5 Find x

3. A-B = 8

A2+B2 = 120 Find A&B

4. b = 1-21/2

a= 1+2 1/2 Find a2 + b2

5. 870695 how much to be subtracted to be divisible by 8

6. 1 2 3 ? 4 9 5 ? 2 find the digits at ? for sum is divisible by ----

7. Raju five year older than Susan. Rithesh 2 years older than Susan. Rithesh is 13 years now. Find Raju's after 2 year

8. Population before 3 years is b after 3 years is C. Find population of present

9. A. a + (a-b) /e *(a-b)2 + (a-b)2

B. d= a-b

a +d /e *d + d*d

Which one A or B is faster

Which one A or B user more memory

10. In as stack

Push (1)

Push (2)

Pop

Push (5)

Push (6)

Pop

What is the Resultant stack : Ans : 5 1

^

top

11. A man bought coffees at 3 for a rupee. How many for a rupee must be sell to gain 50 %.

12. Data sufficiency Questions were there.

13. An amount was deposited after 8 years will become double, then what is the amount.

14. What should be multiplied with 54000 to get a perfect cube.

15. int operation (inta, intb)

ifo (a>b)

return operation (b,a);

else

return a;

what is the result produced by this function ?

Ans : minimum (a, b)

16. Complexity of a function which finds the sum of the square of the diagonal elements of a matrix :

Options : (1) O(n) (2) O(n2) (3) O(nlogn) (4) none of these

17. 334 last digit of it (334)

option : 3, 9, 1, 7

18. 235 divided by 5. Find remainder.

19. Least perfect square number divisible by 3,4,5, 6 & 8 is

20. H.C.F of 2 numbers is 11 & their LCM is 693. If one no. is 77 find other :

21. Find the largest number of 4 digits exactly divisible by 12,15, 18 & 27.

22. How many 4 digit numbers can be formed from the digits 1, 2, 3, 4, 5, 6, 7 such that number digit is repeated.

23. 4 cards are drawn from a pack of 52 cards such that 1 card is a spade & a is a heart. How many ways.

24. If play can be written as:-

QKBX then GEME can be written as :

25. Find the next

B2E5 F6I9 ?

26. If the selling price is Rds.2400 and if he made 33.33 % profit what is his cost price ?

27. 6 9 15 24 36

28. A sorting technique which compare adjacent values Bubble sort

29. A condition used in Binary search but not in linear search ordering

30. Pass by value & pass by reference Questions :

Find o/p

void main () int cal c (int a, int b)

{ int a=5, b=10 c, { a= a+2 :

c = calc (a, b); b= b+3;

print c ; return (a+b);

} }

31. Application of Stock : recussion

32. DFS uses Stock

33. Find o/p of a,b, c, e &g are given.

a + b*d/c - e+g

& a+b*d/(c-e)+g

34. Length is 4 times breadth of a rectangular plot. Area is 2500 find length.

35. Marked price is 400. 10% discount given. still makes 12 % profit find cost price

36. A number is to be divided by 4/5. By mistake it was divided by 5/4 & obtained 81 more than original answer. Find correct answer.

37. x is 50 feet away from y in west. x then walked 10 feet south. then walked 50 feet east. How far should y travel to reach x

38. 'A' was facing north. He turned 270o anti colckwise then 45o clockwise. Then again 135o anticlockwise. Where is he facing now.

8 n-3

2. 6x-3 = 36 x-5 Find x

3. A-B = 8

A2+B2 = 120 Find A&B

4. b = 1-21/2

a= 1+2 1/2 Find a2 + b2

5. 870695 how much to be subtracted to be divisible by 8

6. 1 2 3 ? 4 9 5 ? 2 find the digits at ? for sum is divisible by ----

7. Raju five year older than Susan. Rithesh 2 years older than Susan. Rithesh is 13 years now. Find Raju's after 2 year

8. Population before 3 years is b after 3 years is C. Find population of present

9. A. a + (a-b) /e *(a-b)2 + (a-b)2

B. d= a-b

a +d /e *d + d*d

Which one A or B is faster

Which one A or B user more memory

10. In as stack

Push (1)

Push (2)

Pop

Push (5)

Push (6)

Pop

What is the Resultant stack : Ans : 5 1

^

top

11. A man bought coffees at 3 for a rupee. How many for a rupee must be sell to gain 50 %.

12. Data sufficiency Questions were there.

13. An amount was deposited after 8 years will become double, then what is the amount.

14. What should be multiplied with 54000 to get a perfect cube.

15. int operation (inta, intb)

ifo (a>b)

return operation (b,a);

else

return a;

what is the result produced by this function ?

Ans : minimum (a, b)

16. Complexity of a function which finds the sum of the square of the diagonal elements of a matrix :

Options : (1) O(n) (2) O(n2) (3) O(nlogn) (4) none of these

17. 334 last digit of it (334)

option : 3, 9, 1, 7

18. 235 divided by 5. Find remainder.

19. Least perfect square number divisible by 3,4,5, 6 & 8 is

20. H.C.F of 2 numbers is 11 & their LCM is 693. If one no. is 77 find other :

21. Find the largest number of 4 digits exactly divisible by 12,15, 18 & 27.

22. How many 4 digit numbers can be formed from the digits 1, 2, 3, 4, 5, 6, 7 such that number digit is repeated.

23. 4 cards are drawn from a pack of 52 cards such that 1 card is a spade & a is a heart. How many ways.

24. If play can be written as:-

QKBX then GEME can be written as :

25. Find the next

B2E5 F6I9 ?

26. If the selling price is Rds.2400 and if he made 33.33 % profit what is his cost price ?

27. 6 9 15 24 36

28. A sorting technique which compare adjacent values Bubble sort

29. A condition used in Binary search but not in linear search ordering

30. Pass by value & pass by reference Questions :

Find o/p

void main () int cal c (int a, int b)

{ int a=5, b=10 c, { a= a+2 :

c = calc (a, b); b= b+3;

print c ; return (a+b);

} }

31. Application of Stock : recussion

32. DFS uses Stock

33. Find o/p of a,b, c, e &g are given.

a + b*d/c - e+g

& a+b*d/(c-e)+g

34. Length is 4 times breadth of a rectangular plot. Area is 2500 find length.

35. Marked price is 400. 10% discount given. still makes 12 % profit find cost price

36. A number is to be divided by 4/5. By mistake it was divided by 5/4 & obtained 81 more than original answer. Find correct answer.

37. x is 50 feet away from y in west. x then walked 10 feet south. then walked 50 feet east. How far should y travel to reach x

38. 'A' was facing north. He turned 270o anti colckwise then 45o clockwise. Then again 135o anticlockwise. Where is he facing now.

## No comments:

## Post a Comment