UGC NET Computer Science : June 2012 - Paper 2 (Solved Papers)
Question 1 |
A / B+ tree index is to be built on the name attribute of the relation STUDENT. Assume that all students names are of length 8 bytes, disk block are of size 512 bytes and index pointers are of size 4 bytes. Given this scenario what would be the best choice of the degree (i.e. the number of pointers per node) of the B+ tree ?
42 | |
16 | |
43 | |
44 |
Question 2 |
The Inorder traversal of the tree will yield a sorted listing of elements of tree in
Heaps | |
Binary tree | |
None of the above | |
Binary search tree |
Question 3 |
Mobile IP provides two basic functions.
Agent discovery and registration | |
Route discovery and registration | |
None of the above | |
IP binding and registration |
Question 4 |
Pre-emptive scheduling is the strategy of temporarily suspending a gunning process
when it requests I/O | |
before the CPU time slice expires | |
to avoid collision | |
to allow starving processes to run |
Question 5 |
In round robin CPU scheduling as time quantum is increased the average turnaround time
increases | |
remains constant | |
decreases | |
varies irregularly |