The size of the physical address space of a processor is 240 bytes. The capacity of cache memory is 512 Kbytes. The word length is 32 bytes. The size of each cache block is 16 words. For a 16-way set-associative cache memory, the length (in number of bits) of the tag field is _______________ .
Consider the following statement:
I. Subroutine call occur only at the place where the programmer has written it.
II. The location of the service routine call is fixed for a particular kind of interrupt.
III. Subroutine call require some enabling command.
IV. Subroutine call and interrupt call both are externally initiated.
Which of the following above statements is not correct?
The SLR parser is similar to LR(0) parser except that the reduced entry.
A general shift reduce parsing is LR parsing is bottom-up parsing where L stands for scanning the input from left to right and R stands for constructing a leftmost derivation in reverse.
The transpose of a matrix is the operation of switching rows and columns. Let r be a real number and A and B be matrices. Then, which of the following property does not hold ?
I. (AT)T = A
II. (A + B)T = BT + ATIII. (AB)T = BTATIV. (rA)T = rAT
Consider the following two statements about database transaction schedules:
I. Timestamp protocol ensures freedom from deadlock as no transaction ever waits, but the schedule may not be cascade free, and may not even be recoverable.
II. Timestamp-ordering concurrency control protocol with Thomas’ Write Rule can generate view serializable schedules that are not conflict serializable.
III. Binary Locking does not guarantee Serializability.
Which of the above statements is/are TRUE?
The line graph L(G) of graph G has a vertex for each edge of G, and two of these vertices are adjacent iff the corresponding edges in G have a common vertex. Then which of the following option is false ?
Eulerian cycles of a graph G translate into Hamiltonian cycles of L(G).
If an edge has a vertex of degree d1 at one end and a vertex of degree d2 at the other, then (d1+d2) will be the degree of its corresponding vertex in the line graph.
If a graph G is regular of degree d, then L(G) will be regular line graph of degree 2(d-1).