Mindtree Placement Papers from DAIICT

January 20, 2008

Result gets out at 12 midnight. this paper was conducted at DA-IICT on
18/07/05. There were 14 question in objective plus one C program in the
software stream. plus there were separate papers for VLSO AND DSP
students.

In the Software stream , of the 14 question 2 question were repeated,
meaning that there were only 12 quesions in all

1.what is not common among threads in aa proocess.??
code, stack, heap, libraries, noen of the above

2.process address space includes which of the following componenets??
<memory>heap, user stack , shared libraries, all of the above

3. some file transfer is in progress. the connection break s and then
later after some time is restored. then on the file transfer continues
from the point where it left off, which OSI layer handles this?
presentation, application, TCP, IP, Sesssion

4. Sliding window protocol is best for
transmission, reception , error and flow control, Duplication
detection, all

5. FTP works at which layer?
presentation , application, IP, Data link. noe\ne

6. size of ’0′, “0″, ‘\0′,0(stored as an int)?
1,2,1,4;
2,8,1,2;
1,1,1,1;
2,2,0,4;
none

7. Virtual memory depends on
Address Lines, Data bus, disk space , all, none

8. Which of the followiun is the fastest IPC mechanism???
pipes, FIFO, Semaphores, Shared memories, None

9. Which of the followiun is the fastest IPC mechanism???
pipes, FIFO, Semaphores, Shared Message queues, None

Note that 8 and 9 are same questions(almost) but they were asked as
such

10. Semaphores ARe used for (Synchronisation among)
a. processes
b. threads.
c. Interrupt ahndlers
d. One more choice

11. if(n & (n-1))
return false;
else
return true;

what does the code snippet above do???
a. check if the no is divisible by 2
b. check if the no is not Divisible by 2
c. check if no is a multiple of 2
d. check if the no is a power of 2
e. none


Related Posts

Enter your email address:

Delivered by FeedBurner