JNU CS M.Phil 2019 Shift1
Question 1 
Consider a B+ tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in a nonroot node?
1  
2  
3  
4 
Question 2 
Which of the following sorting algorithms has the lowest worst case complexity?
Merge sort  
Bubble sort  
Quick sort  
Selection sort 
Question 3 
The postfix expression for the infix expression A + B * (C + D)/ F + D * E is
AB + CD + *F / D + E *  
ABCD + *F / + DE* +  
A*B + CD / F*DE ++  
A + *BCD / F*DE ++ 
Question 4 
Consider the process of inserting an element into a Max Heap, where the Max Heap is represented by an array. Suppose, we perform binary search on the path from the new leaf to the root for finding the position of newly inserted element, the number of comparisons performed is
O(log_{2} n)  
O(log_{2} log_{2} n)
 
O(n)
 
O(n log_{2} n) 
Question 5 
The following program
main ()
{ printf(“%u”, main);}
is
printing a garbage number  
giving an execution error  
printing of starting address of the main function  
having an infinite loop 
Question 6 
Consider the following program fragment
int v=3, *pv=&v;
printf(“%d, %d”, v, *pv);
The output will be
an error message  
3, address of v  
3, 3  
None of above 
Question 7 
The operation of a staircase switch best explains the
or operation  
and operation  
exclusive nor operation  
exclusive or operation

Question 8 
The only state transition that is initiated by the user process itself is
block  
dispatch  
wakeup  
None of the above 
Question 9 
What is the correct matching for the following pairs?
(A) Disk Scheduling (I) Round robin
(B) Batch Processing (II) SCAN
(C) Time sharing (III) LIFO
(D) Interrupt Processing (IV) FIFO
AIII, BIV, CII and DI  
AIV, BIII, CII and DI
 
AII, BIV, CI and DIII  
AII, BI, CIV and DIII 
Question 10 
A system has 3 processes and is sharing 4 resources. If each process needs a maximum of 2 units then, deadlock
can never occur
 
may occur  
has to occur  
all of the above 
Question 11 
A process refers to 5 pages, A, B, C, D and E in the order
A→B→C→D→A→B→E→A→B→C→D→E. If the page replacement algorithm is FIFO, the number of pages transfers with an empty internal store of 3 frames are:
8  
10  
9  
7 
Question 12 
In an entity relationship, y is the dominant entity and x is the subordinate entity. Which of the following is a correct statement?
Operationally, if y is deleted, so is x  
Operationally, if x is deleted, so is y  
Operationally, if x is deleted, y remains the same  
x is existence dependent on y 
Question 13 
Given the functional dependencies
X → W; X → Y; X → Z; Z → PQ
Which of the following does not hold?
X → Z  
X → WY  
W → Z  
None of the above 
Question 14 
If P and Q are predicates and P is the relational algebra expression, then which of the following equivalences are not valid?
Question 15 
Which one of the following statements is false?
Any relation with two attributes is in BCNF  
Any relation in which every key has only one attribute is in 2NF
 
A prime attribute can be transitively dependent on a key in a 3NF relation  
A prime attribute can be transitively dependent on a key in a BCNF relation 
Question 16 
(100000)_{2} is Hexadecimal is:
10  
20  
80  
100 
Question 17 
If negative numbers are stored in 2’s complement form, the range of numbers that can be stored in 8 bits is
128 to +128  
127 to +128  
128 to +127  
127 to +127 
Question 18 
Which of the following is the minimum error code?
Octal code  
Binary code
 
Gray code  
Excess3 code 
There are 18 questions to complete.