GATE CSE 2015 SET-2
Q21.
In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is TRUE?Q22.
An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum isQ23.
The larger of the two eigenvalues of the matrix \begin{bmatrix} 4 & 5\\ 2&1 \end{bmatrix} is _______.Q24.
Perform the following operations on the matrix \begin{bmatrix} 3 & 4&45 \\ 7& 9& 105\\ 13&2 & 195 \end{bmatrix}. (i) Add the third row to the second row (ii) Subtract the third column from the first column. The determinant of the resultant matrix is___________.Q26.
A computer system implements a 40-bit virtual address, page size of 8 kilobytes, and a 128-entry translation look-aside buffer (TLB) organized into 32 sets each having four ways. Assume that the TLB tag does not store any process id. The minimum length of the TLB tag in bits is _________.Q27.
A computer system implements 8 kilobyte pages and a 32-bit physical address space. Each page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the maximum size of the page table of a process is 24 megabytes, the length of the virtual address supported by the system is _____ bits.Q28.
Consider six memory partitions of sizes 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250 KB, where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB, 210 KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?Q29.
The number of states in the minimal deterministic finite automaton corresponding to the regular expression (0+1)*(10) is __________.Q30.
Consider a processor with byte-addressable memory. Assume that all registers, including Program Counter (PC) and Program Status Word (PSW), are of size 2 bytes. A stack in the main memory is implemented from memory location (0100)_{16} and it grows upward. The stack pointer (SP) points to the top element of the stack. The current value of SP is (016E)_{16}. The CALL instruction is of two words, the first word is the op-code and the second word is the starting address of the subroutine (one word = 2 bytes). The CALL instruction is implemented as follows: Store the current value of PC in the stack Store the value of PSW register in the stack Load the starting address of the subroutine in PC The content of PC just before the fetch of a CALL instruction is (5FA0)_{16}. After execution of the CALL instruction, the value of the stack pointer is