1.A coffee shop blends 2 kinds of coffee,putting in 2 parts
of a 33p. a gm. grade to 1 part of a 24p. a gm.If the mixture is changed to 1
part of the 33p. a gm. to 2 parts of the less expensive grade,how much will the
shop save in blending 100 gms.
a) Rs.90
b) Rs.1.00
c) Rs.3.00
d) Rs.8.00
Ans.C
2.There are 200 questions on a 3 hr examination. Among these
questions are 50 Mathematics problems. It is suggested that twice as much time
be spent on each maths problem as for each other question. How many minutes
should be spent on Mathematics problems
a) 36
b) 72
c) 60
d) 100
Ans.B
3. If a car starts from A towards B with some velocity due
to some problem in the engine after travelling 30km.If the car goes with 4/5 th
of its actuval velocity the car reaches B 45min later to the actual time. If
the car engine fails ofter travelling 45km, the car reaches the destination B
36min late to the actual time, what is the initial velocity of car and what is
the distance between A and B in km
(a) 40 & 100
(b) 10 & 150
(c) 20 & 130
(d) 50
Ans.C
4. Two trains are travelline at equilateral .Train A is
travelling in the direction of earths spin.Other train B is travelling in
opposite direction of earths spin.Which trains wheels will wear first?and why?
(a) Train B
(c) none of these
(d) Train A
Ans. A
5.A monkey starts climbing up a tree 20ft. tall. Each
hour, it hops 3ft. and slips back 2ft. How much time would
it take
the monkey to reach the top?
Ans.18 hours.
6. What is the missing number in this series? 8 2
14 6 11 ? 14 6 18 12
Ans. 9
7. From 5 different green balls, four different blue
balls and three different red balls, how many combinations
of balls
can be chosen taking at least one green and one blue ball?
Ans. 3720.
8. Three pipes, A, B, & C are attached to a tank. A
&
B can fill it in 20 & 30 minutes respectively while C
can empty it
in 15 minutes.If A, B & C are kept open successively for
1 minute
each, how soon will the tank be filled?
Ans. 167 minutes.
Technical Section :
1. If h is any hashing function and is used to hash n keys
in to a table of size m, where n<=m, the expected number of collisions
involving a particular key x is :
(A) less than 1. (B) less than n.
(C) less than m. (D) less than n/2.
Ans:A
2. Let A be an adjacency matrix of a graph G. The th ij
entry in the matrix K A , gives
(A) The number of paths of length K from vertex Vi to vertex
Vj.
(B) Shortest path of K edges from vertex Vi to vertex Vj.
(C) Length of a Eulerian path from vertex Vi to vertex Vj.
(D) Length of a Hamiltonian cycle from vertex Vi to vertex
Vj.
Ans:B
3. The OS of a computer may periodically collect all the
free memory space to form contiguous block of free space. This is called
(A) Concatenation (B) Garbage collection
(C) Collision (D) Dynamic Memory Allocation
Ans:B
4. main()
{
int i=_l_abc(10);
printf(“%d\n”,–i);
} int _
l_abc(int i)
{
return(i++);
}
Answer:
9
Explanation:
return(i++) it will first return i and then increments. i.e.
10 will be returned.
5. main()
{
char *p;
int *q;
long *r;
p=q=r=0;
p++;
q++;
r++;
printf(“%p…%p…%p”,p,q,r);
}
Answer:
0001…0002…0004
Explanation:
++ operator when applied to pointers increments address
according to their
corresponding data-types.
6. main()
{
char c=’ ‘,x,convert(z);
getc(c);
if((c>=’a’) && (c<=’z’))
x=convert(c);
printf(“%c”,x);
} convert(z)
{
return z-32;
}
Answer:
Compiler error
