Placement Section
Company Names
Miscellaneous Section
Advertisements
Copyright ©2007 AMROOD
|
CHATARGEE [1] | [2]
- Exam Place : Not Given
- Date : Not Given
- Submitted By : Vinay Rathod, Delhi
- Rating : 2 out of 5
75 Questions to be done in 75 Minutes
There were 3 sections. The first section had 20 questions, second section had 40 questions and
third section had 15 questions. I'm giving some of the questions here.
Aptitude Questions, Section I
1 There are 5 medicines which are to be tested........
Conditions are
1. p is stronger than q
2. r is less than s
3. q....
Ans: 1.p is more stronger
2.statement 1234
3.there are atleast 4 medicines in every test less than m
(all these are different correct ans for Q1. passage
2 There are 6 persons k,l,m,n,o,p to give seminar
Conditions are
1. 3 persons should give before lunch and 3 after lunch
2. l should immediately precede the seminar of m
3. There should be no gap between l and m .....
Ans: 1. L position is 2
2 m pos is 5
3. k pos is 4
3 A is daughter of Y, Z is father of Y. Q is son of Z,
1.if T is son of Y, then
Ans: T and A brother/sister
2. if m is brother of T, then
Ans :Z is grandfather of M and M & A are brother/sister
3. if Q is son of Z them
Ans: Q & Y are brothers
4 If speed of ongoing train is 24 and while return is 48
avg = ----
Ans:32
Aptitude Questions, Section II
1 0.23 + 0.02323 + 0.002323.... == ???
2 0.4 + 0.44 + 0.444 ..... = ???
3 1,2,2,4,8,?
Ans:32
4 55*55*55+45*45*45/55*55-55*45+45*45
Ans:100
5 4^^61 + 4^^62 + 4^^63 + 4^^64 . this sum is divisible by which of the following ?
Ans:17
6. There are 12 fig series ( simple from RS. AGARWAL)
Programming Language Questions, Section III
1 What will be output of the following algorithm
start
n=3
do while( n<=6 )
n=n-1;
n=n*(n+1)
end
2 If max() gives max of 3 nos, and min() min of 3 then nos......
Ans : 3
3 There is a flow chart consisting n, sum, and count a condition is that : n > 10
Ans: sum=45, n=11;
|
|
|
|
|
