Similar Topics

3.2k+ articles

GATE-GATE CS 2018

50+ articles

GATE CS 2018

50+ posts

Popular articles

Recent articles

GATE | GATE CS 2018 | Question 65

Last updated: 01 September 2021

A lexical analyzer uses the following patterns to recognize three tokens T1, T2, and T3 over the alphabet {a,b,c}. T1: a?(b∣c)*a T2: b?(a∣c)*b T3: c?(b∣a)*c Note that ‘x?’ ...read more

GATE-GATE CS 2018

GATE | GATE CS 2018 | Question 61

Last updated: 22 November 2021

The instruction pipeline of a RISC processor has the following stages: Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Writ ...read more

GATE-GATE CS 2018

GATE | GATE CS 2018 | Question 60

Last updated: 04 April 2019

Consider the weights and values of items listed below. Note that there is only one unit of each item. The task is to pick a subset of these items such that the...read more

GATE-GATE CS 2018

Similar Topics

3.2k+ articles

GATE-GATE CS 2018

50+ articles

GATE | GATE CS 2018 | Question 57

Last updated: 09 March 2018

The number of possible min-heaps containing each value from {1, 2, 3, 4, 5, 6, 7} exactly once is _______. Note -This was Numerical Type question. ( ...read more

GATE-GATE CS 2018

GATE | GATE CS 2018 | Question 55

Last updated: 09 March 2018

In a system, there are three types of resources: E, F and G. Four processes P0, P1, P2 and P3 execute concurrently. At the outset, the processes have declared their maximu...read more

GATE-GATE CS 2018

GATE | GATE CS 2018 | Question 45

Last updated: 16 August 2021

The size of the physical address space of a processor is 2P bytes. The word length is 2W bytes. The capacity of cache memory is 2N bytes. The size of each cache block is 2 ...read more

GATE-GATE CS 2018

GATE | GATE CS 2018 | Question 39

Last updated: 30 September 2021

A processor has 16 integer registers (R0, R1, … , R15) and 64 floating point registers (F0, F1, … , F63). It uses a 2-byte instruction format. There are four categories of ...read more

GATE-GATE CS 2018

GATE | GATE CS 2018 | Question 37

Last updated: 23 February 2018

Consider an IP packet with a length of 4,500 bytes that includes a 20-byte IPv4 header ans 40-byte TCP header. The packet is forwarded to an IPv4 router that supports a Ma ...read more

GATE-GATE CS 2018

GATE | GATE CS 2018 | Question 32

Last updated: 14 November 2018

Consider a long-lived TCP session with an end-to-end bandwidth of 1 Gbps (= 109 bits-per-second). The session starts with a sequence number of 1234. The minimum time (in s ...read more

GATE-GATE CS 2018

GATE | GATE CS 2018 | Question 30

Last updated: 25 February 2018

Consider a system with 3 processes that share 4 instances of the same resource type. Each process can request a maximum of K instances. Resource instances can be requested ...read more

GATE-GATE CS 2018

GATE | GATE CS 2018 | Question 28

Last updated: 11 October 2021

The set of all recursively enumerable languages is (A) closed under complementation.(B) closed under intersection.(C) a subset of the set of all recursive languages.(D) an ...read more

GATE-GATE CS 2018

GATE | GATE CS 2018 | Question 24

Last updated: 23 February 2018

In an Entity-Relationship (ER) model, suppose R is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in R and that ...read more

GATE-GATE CS 2018

GATE | GATE CS 2018 | Question 20

Last updated: 12 August 2021

The postorder traversal of a binary tree is 8, 9, 6, 7, 4, 5, 2, 3, 1. The inorder traversal of the same tree is 8, 6, 9, 4, 7, 2, 5, 1, 3. The height of a tree is the len...read more

GATE-GATE CS 2018

GATE | GATE CS 2018 | Question 19

Last updated: 07 September 2021

Which one of the following statements is FALSE?(A) Context-free grammar can be used to specify both lexical and syntax rules.(B) Type checking is done before parsing.(C) H ...read more

GATE-GATE CS 2018

GATE | GATE CS 2018 | Question 11

Last updated: 12 August 2021

A queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let n denote the number of nodes i ...read more

GATE-GATE CS 2018