|
21.merge sort time complexity ( O(n log n) )
22.program on swaping ( 10,5 ) given values are not changed
23.routers used (in network layer )
24.packets are formed ( in network layer )
25.heap ( priority queue )
26.copy constructor ( constant reference )
27.while following sorting algorithem has average sorting behavior (heap
sort )
28.in binary search tree which traversal is used for getting ascending
order values (inorder )
29.device drivers is used ( tool for a i/o devices) i am not sure
30. irrevalent to unix command ( getty)
31.fork in unix (system call used to create process)
32.make (creation of more than one file )
33.in unix .profile contains ( start up program)
34.in unix echo is used for ( answer C)
35.in unix 'ls 'stores contents in( inode block)
QUANTITATIVE SECTION
1.In a class composed of x girls and y boys what part of the class is composed of
girls
A.y/(x + y)
B.x/xy
C.x/(x + y)
D.y/xy
Ans.C
|
|
