## GATE | GATE-CS-2007 | Question 85

Consider the data given in above question. Suppose that the robot is not allowed to traverse the line segment from (4,4) to (5,4). With this… Read More »

## GATE | GATE-CS-2007 | Question 84

Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit… Read More »

## GATE | GATE-CS-2007 | Question 83

Consider the data given in above question. Least Recently Used (LRU) page replacement policy is a practical approximation to optimal page replacement. For the above… Read More »

## GATE | GATE-CS-2007 | Question 82

A process has been allocated 3 page frames. Assume that none of the pages of the process are available in the memory initially. The process… Read More »

## GATE | GATE-CS-2007 | Question 81

Consider the data given in above question. Which of the following lines of the data cache will be replaced by new blocks in accessing the… Read More »

## GATE | GATE-CS-2007 | Question 80

Consider a machine with a byte addressable main memory of 216 bytes. Assume that a direct mapped data cache consisting of 32 lines of 64… Read More »

## GATE | GATE-CS-2007 | Question 79

For the correct answer strings to above question, how many derivation trees are there? (A) 1 (B) 2 (C) 3 (D) 4 Answer: (B) Explanation:… Read More »

## GATE | GATE-CS-2007 | Question 78

Consider the CFG with {S,A,B) as the non-terminal alphabet, {a,b) as the terminal alphabet, S as the start symbol and the following set of production… Read More »

## GATE | GATE-CS-2007 | Question 77

Suppose the letters a, b, c, d, e, f have probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/32 respectively. What is the average length of Huffman… Read More »

## GATE | GATE-CS-2007 | Question 76

Suppose the letters a, b, c, d, e, f have probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/32 respectively. Which of the following is the Huffman… Read More »

## GATE | GATE-CS-2007 | Question 75

Consider the automata given in previous question. The minimum state automaton equivalent to the above FSA has the following number of states (A) 1 (B)… Read More »

## GATE | GATE-CS-2007 | Question 74

Consider the following Finite State Automaton. The language accepted by this automaton is given by the regular expression   (A) A (B) B (C) C… Read More »

## GATE | GATE-CS-2007 | Question 73

Consider the data given in above questions. Assume that the memory is byte addressable and the word size is 32 bits. If an interrupt occurs… Read More »

## GATE | GATE-CS-2007 | Question 72

Consider the data given in above question. Assume that the memory is word addressable. After the execution of this program, the content of memory location… Read More »

## GATE | GATE-CS-2007 | Question 71

Consider the following program segment. Here R1, R2 and R3 are the general purpose registers. Assume that the content of memory location 3000 is 10… Read More »