# Category Archives: GATE

Which of the following option is correct ? (A) A predictive parser needs backtracking. (B) A predictive parser does not needs backtracking. (C) A predictive… Read More
Let δ denote the transition function and α denoted the extended transition function of the NFA whose transition table is given below: Then, δˆ(q0, 00101)… Read More
Which of the following two code segments is faster? Assume that compiler makes no optimizations. Code-1: /* FIRST */ for(i=0;i<10;i++)   for(j=0;j<100;j++)     //do something Code-2: /*… Read More
Consider a system having a clock rate of 2 ns and miss penalty of 50 clock cycles. while accessing the data, 1% of instructions and… Read More
Consider the following system: Process Allocation Maximum Available A B C A B C A B C P0 0 1 2 2 2 3 x… Read More
Consider the following function implemented in C: void printxy(int x, int y) { int *ptr; ptr = &x; y = *ptr; *ptr = 1; printf("%d,%d",… Read More
Which of the following is/are shared by all the threads in a process? I. Program Counter II. Stack III. State IV. Registers (A) I and… Read More
An algebraic structure (L, ∨, ∧), consisting of a set L and two binary operations ∨, and ∧, on L is a lattice if the… Read More
How many factors of 1080 are perfect squares ? (A) 4 (B) 6 (C) 8 (D) 5 Answer: (A) Explanation: 1080 = 23 * 33… Read More
Consider the following statements: S1: Even though CLR parser does not have RR conflict but LALR may contain RR conflict. S2: Every SLR grammar is… Read More
Consider the same code as given in below question. The function print() receives root of a Binary Search Tree (BST) and a positive integer k… Read More
G2, G3 are four variables functions which are represented as the sum-of-minterms Y = (F1 + F2) ⊕ F3, which of the following correctly represents… Read More
Consider the following non-deterministic finite automaton (NFA) over the alphabet Σ = {0, 1}. Language of the above NFA is (A) (2n + 1) mod… Read More
Consider the following statements: I. Given a graph G = (V, E) with distinct positive edge weights, the Bellman-Ford algorithm and Dijkstra’s algorithm can produce… Read More
Identity the language generated by following grammar where S is the start variable. S → AB A → aAb | ε B → bBc |… Read More