Provided by www.YuvaJobs.com -  Whole Testpaper        


Aptitude 

1. There were 36 chairs. how many ways can they be placed such that all rows have equal no. of chairs and at least three chairs are there in each row and there are at least three rows.
5 ways.

2. There are 27 balls, of which 1 is heavier. given a balance how many times you need to weigh to find out the odd ball.
3 Weighs.

3. Product of three consecutive nos. 210. What is the sum of two least numbers
11

4. If the area of the sqaure is increased by 69 % how much the length of the side will increase?
30%

5. if the sum of five consecutive nos. 35? how many prime nos are there :
2 primes.

6. if the length of the rectangle is reduced by 20% and breath is increased by 20 % what is the net change ?
4 % decrease

7. A question on sets. There are some 20 Basketball players & 30 Football players, and 25 cricket players. 1 of them plays all the three games. 8 of them plays atleast two games. They are 50 altogether. How many of them plays none of the games.

8. A question on directions. B is 20 miles east of A. D is 30 miles east of C. E is 10 miles north of D. C is 20 miles north of B. How far E is from A? Some 3 questions on Reasoning like,

9. If you say that giving stock options to employees increases the  productivity of the company, which of the following sentences support it. A) Giving stock options increases the morale of the employees


Technical

1.A Circuit with nand gates. (ans. may be XOR)

2.CMRR. relates to (options not in order)
voltage follower
non inverting amplifier
inverting amplifier
integrator

3. Given a circuit , give the ouput.
(ans. may be triangular wave.)

4. o/p of an assembly code.
multiply by 11.

5. how to handle asynchronous events.
a) polling
b) interrupt
etc.

6. Whether all recusive pgm can be writtten iteratively?

7. What data structes you will use if you want to go to first record from the last and vice versa?
doubly linked circular list

8. Given 10000 nos. and 48MB Memory. What is the complexity of the efficient sorting algo.? (the algo. is not mentioned)O(N)

9. Given a C code and ask what it does?
code was something similar to Bubble sort and that particular code does the sorting in Desending order and the complexity
is O(n^2)(which is the next question).


10.
A code like this is given.
a. for(i=0;i0;i--)
Assuming no code optimization and assume that the microprocessor
has flags etc. which one is correct.

b will execute faster.

11. If there are too many page faults what is the problem?

12. To ensure one pgm. doesnt corrupt other pgm. in a Multi-pgm enviornment
what you should do?

13. Which one you will use to implement critical section?
Binary Semaphore

14. Which one is not needed for Multi-processing. enviornment?
options are: virtual memory,security,time sharing,none of theabove.

15. Which one is not done by Data link layer ?
bit stuffing, LRC,CRC,parity check

16. Which one is not related to Data link layer?

17. Which one is not suitable for client-server application?
tcp/ip,message passing,rpc,none of the above.

18. What is SQL.
Procedural Relational DB Query Language.

19. Indexing in databases give you options were like 1.efficient deleting and inserting
2.efficient deleting.
etc.

20. int a=1,b=2,c=3;
printf("%d,%d",a,b,c);
What is the output?

21. Scope of Static Variable ............
in a file.

22. for(i=0; i