Similar Topics

3.2k+ articles

80+ articles

GATE-GATE-CS-2006

70+ posts

Popular articles

Recent articles

GATE | GATE-CS-2006 | Question 65

Last Updated: 14 February 2018

Consider three processes, all arriving at time zero, with total execution time of 10, 20 and 30 units, respectively. Each process spends the first 20% of execution time d ...read more

GATE-GATE-CS-2006

GATE | GATE-CS-2006 | Question 63

Last Updated: 28 June 2021

A computer system supports 32-bit virtual addresses as well as 32-bit physical addresses. Since the virtual address space is of the same size as the physical address space ...read more

GATE-GATE-CS-2006

GATE | GATE-CS-2006 | Question 62

Last Updated: 28 June 2021

A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside buffer (TLB) which can hold a total of 128 page table entries a ...read more

GATE-GATE-CS-2006

Similar Topics

3.2k+ articles

80+ articles

GATE | GATE-CS-2006 | Question 60

Last Updated: 17 September 2021

Consider the following C code segment.for (i = 0, in; i++){ for (j=0; jn; j++) { if (i%2) { x += (4*j + 5*i); y += (7 + 4*j); } ...read more

GATE-GATE-CS-2006

GATE | GATE-CS-2006 | Question 59

Last Updated: 15 September 2021

Consider the following translation scheme.S → ERR → *E{print("*");}R | εE → F + E {print("+");} | FF → (S) | id {print(id.value);}Here id is a token that represents an int...read more

GATE-GATE-CS-2006

GATE | GATE-CS-2006 | Question 58

Last Updated: 15 September 2021

Consider the following grammar:S → FRR → S | εF → idIn the predictive parser table, M, of the grammar the entries M[S, id] and M[R, $] respectively.(A) {S → FR} and {R → ...read more

GATE-GATE-CS-2006

GATE | GATE-CS-2006 | Question 49

Last Updated: 28 June 2021

An implementation of a queue Q, using two stacks S1 and S2, is given below:[sourcecode language="C"]void insert(Q, x) { push (S1, x);} void delete(Q){ if(stack-empty(S ...read more

GATE-GATE-CS-2006

GATE | GATE-CS-2006 | Question 46

Last Updated: 28 June 2021

Station A needs to send a message consisting of 9 packets to Station B using a sliding window (window size 3) and go-back-n error control strategy. All packets are ready a ...read more

GATE-GATE-CS-2006

GATE | GATE-CS-2006 | Question 45

Last Updated: 28 June 2021

Two computers C1 and C2 are configured as follows. C1 has IP address 203.197.2.53 and netmask 255.255.128.0. C2 has IP address 203.197.75.201 and netmask 255.255.192.0. wh ...read more

GATE-GATE-CS-2006

GATE | GATE-CS-2006 | Question 32

Last Updated: 28 June 2021

Consider the following statements about the context free grammarG = {S → SS, S → ab, S → ba, S → Ε}I. G is ambiguousII. G produces all strings with equal number of a’s and...read more

GATE-GATE-CS-2006

GATE | GATE-CS-2006 | Question 85

Last Updated: 15 October 2019

Consider the following log sequence of two transactions on a bank account, with initial balance 12000, that transfer 2000 to a mortgage payment and then apply a 5% interes ...read more

GATE-GATE-CS-2006

GATE | GATE-CS-2006 | Question 11

Last Updated: 28 June 2021

Consider a weighted complete graph G on the vertex set {v1, v2, ..vn} such that the weight of the edge (vi, vj) is 2|i-j|. The weight of a minimum spanning tree of G is: ( ...read more

GATE-GATE-CS-2006

GATE | GATE-CS-2006 | Question 85

Last Updated: 28 June 2021

A CPU has 24-bit instructions. A program starts at address 300 (in decimal). Which one of the following is a legal program counter (all values in decimal)?(A)400(B)500(C)6 ...read more

GATE-GATE-CS-2006

GATE | GATE-CS-2006 | Question 85

Last Updated: 28 July 2021

Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6, respectively. How many context switches are needed if the op ...read more

GATE-GATE-CS-2006

GATE | GATE-CS-2006 | Question 1

Last Updated: 28 June 2021

Consider the polynomial p(x) = a0 + a1x + a2x2 + a3x3 , where ai ≠ 0 ∀i. The minimum number of multiplications needed to evaluate p on an input x is: (A) 3(B) 4(C) 6(D) 9 ...read more

GATE-GATE-CS-2006