|
SAMSUNG ALL PAPERS 2005
1.Technical 2.Aptitude
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<100;i++)
for(j=0;i<100;j++)
a[i][j]=0;
for(i=0;i<100;i++)
for(j=0;j<100;j++)
a[j][i]=0
ans: first code
8. int j=3;
int *p=&j;
printf("%d %d", *p++,++*p);
it will not increment j value as ++ is done first on p before *, so
address gets incremented and
garbage value will be there.
9. two questions were asked on doubly linked lists, for deleting a node
like given some piece of code
|
|
