Provided by www.YuvaJobs.com - New Delhi ,25 October 2010 There were 2 sections 1. Technical 2. Aptitude Technical was a bit difficult than aptitude. In technical there were mainly questions on Datastructures, OS and Networks. Networks questions were mainly from datalink layer and network layer. DS questions were on linkedlists,binary trees and hashing. OS questions were on paging and schduling. In aptitude they have asked to arrange sentences in order, questions based on passage and some direct aptitude. Some questions I have in mind are, I am giving answers after the question itself: 1. what is the size of IPv6 ---16 bytes 2.how many possible trees are there such that both preorder and postorder traversal are same if there are n nodes in a binary tree ---0 3. four ques were given on error detection and control, like CRC code,hamming code etc.. 4.which protocol is used to convert the ethernet address to IP address --- RARP 5.which is undeterminnistic network structure among 802.3,802.4,802.5 --802.4 6. some nodes were given and they are inserted into a binary search tree, which is the root --- 8 7. which of the two codes executes fast for(i=0;i