Table of Content

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 ?
A
43
B
16
C
44
D
42
Question 2
The Inorder traversal of the tree will yield a sorted listing of elements of tree in
A
Binary search tree
B
None of the above
C
Heaps
D
Binary tree
Question 3
Mobile IP provides two basic functions.
A
None of the above
B
Route discovery and registration
C
Agent discovery and registration
D
IP binding and registration
Question 4
Pre-emptive scheduling is the strategy of temporarily suspending a gunning process
A
before the CPU time slice expires
B
to avoid collision
C
to allow starving processes to run
D
when it requests I/O
Question 5
In round robin CPU scheduling as time quantum is increased the average turnaround time
A
remains constant
B
varies irregularly
C
decreases
D
increases