JNU CS M.Phil 2019 Shift-1

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 non-root node?
A
1
B
2
C
3
D
4
Question 2
Which of the following sorting algorithms has the lowest worst case complexity?
A
Merge sort
B
Bubble sort
C
Quick sort
D
Selection sort
Question 3
The postfix expression for the infix expression A + B * (C + D)/ F + D * E is
A
AB + CD + *F / D + E *
B
ABCD + *F / + DE* +
C
A*B + CD / F*DE ++
D
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
A
O(log2 n)
B
O(log2 log2 n)
C
O(n)
D
O(n log2 n)
Question 5

The following program
       
main ()

        { printf(“%u”, main);}

is
A
printing a garbage number
B
giving an execution error
C
printing of starting address of the main function
D
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
A
an error message
B
3, address of v
C
3, 3
D
None of above
Question 7
The operation of a staircase switch best explains the
A
or operation
B
and operation
C
exclusive nor operation
D
exclusive or operation
Question 8
The only state transition that is initiated by the user process itself is
A
block
B
dispatch
C
wakeup
D
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
A
A-III, B-IV, C-II and D-I
B
A-IV, B-III, C-II and D-I
C
A-II, B-IV, C-I and D-III
D
A-II, B-I, C-IV and D-III
Question 10
A system has 3 processes and is sharing 4 resources. If each process needs a maximum of 2 units then, deadlock
A
can never occur
B
may occur
C
has to occur
D
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:
A
8
B
10
C
9
D
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?
A
Operationally, if y is deleted, so is x
B
Operationally, if x is deleted, so is y
C
Operationally, if x is deleted, y remains the same
D
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?
A
X → Z
B
X → WY
C
W → Z
D
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?
A
B
C
D
Question 15
Which one of the following statements is false?
A
Any relation with two attributes is in BCNF
B
Any relation in which every key has only one attribute is in 2NF
C
A prime attribute can be transitively dependent on a key in a 3NF relation
D
A prime attribute can be transitively dependent on a key in a BCNF relation
Question 16
(100000)2 is Hexadecimal is:
A
10
B
20
C
80
D
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
A
-128 to +128
B
-127 to +128
C
-128 to +127
D
-127 to +127
Question 18
Which of the following is the minimum error code?
A
Octal code
B
Binary code
C
Gray code
D
Excess-3 code
There are 18 questions to complete.

Access quiz wise question and answers by becoming as a solutions adda PRO SUBSCRIBER with Ad-Free content

If you have registered and made your payment please contact solutionsadda.in@gmail.com to get access