March 13, 2025

GATE 2011

Question 24 A computer handles several interrupt sources of which the following are relevant for this question. . Interrupt from CPU temperature sensor (raises interrupt if […]
March 13, 2025

GATE 2011

Question 30 Consider an instruction pipeline with four stages (S1, S2, S3 and S4) each with combinational circuit only. The pipeline registers are required between each […]
March 13, 2025

GATE 2010

Question 18 Consider a B+-tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any […]
March 13, 2025

GATE 2010

Question 23 Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared […]
March 13, 2025

GATE 2010

Question 43 Which of the following functional dependencies hold for relations R(A, B, C) and S(B, D, E): B -> A A -> C The relation […]
March 13, 2025

GATE 2010

Question 45 The following program consists of 3 concurrent processes and 3 binary semaphores.The semaphores are initialized as S0 = 1, S1 = 0, S2 = […]
March 14, 2025

GATE 2009

Question 4 Consider the binary relation R = {(x, y), (x, z), (z, x), (z, y)} on the set {x, y, z}. Which one of the […]
March 14, 2025

GATE 2009

Question 16 Which one of the following is FALSE? A There is unique minimal DFA for every regular language. B Every NFA can be converted to […]
March 14, 2025

GATE 2009

Question 42 Which of the following statements are TRUE? I.There exist parsing algorithms for some programming languages whose complexities are less than θ(n3). II.A programming language […]
March 14, 2025

GATE 2008

Question 11 Which of the following describes a handle (as applicable to LR-parsing) appropriately? A It is the position in a sentential form where the next […]
March 14, 2025

GATE 2009

Question 24 The binary operation □ is defined as follows Which one of the following is equivalent to P ∨ Q ? A ¬Q□¬P B P□¬Q […]
March 14, 2025

GATE 2009

Question 32 In the following process state transition diagram for a uniprocessor system, assume that there are always some processes in the ready state: Now consider […]