## GATE | GATE CS 2019 | Question 59

What is the minimum number of 2-input NOR gates required to implement 4-variable function expressed in sum-of-minterms from as f = Σ(0, 2, 5, 7,… Read More »

## GATE | GATE CS 2019 | Question 58

Consider that 15 machines need to be connected in a LAN using 8-port Ethernet switches. Assume that these switches do not have any separate up… Read More »

## GATE | GATE CS 2019 | Question 57

Let Σ be the set of all bijections from {1, …, 5} to {1, …, 5}, where id denotes the identity function, i.e. id(j) =… Read More »

## GATE | GATE CS 2019 | Question 56

Suppose Y is distributed uniformly in the open interval (1, 6). The probability that the polynomial 3×2 + 6xY + 3Y + 6 has only… Read More »

## GATE | GATE CS 2019 | Question 55

Let T be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves a and b of… Read More »

## GATE | GATE CS 2019 | Question 54

A certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses… Read More »

## GATE | GATE CS 2019 | Question 53

Consider the following matrix: The absolute value of the product of Eigenvalues of R is _________ . Note: This was Numerical Type question. (A) 12… Read More »

## GATE | GATE CS 2019 | Question 52

Consider the augmented grammar given below: S′ → S S → ⏐id L → L, S⏐S Let I0 = CLOSURE ({[S′ → S]}). The number… Read More »

## GATE | GATE CS 2019 | Question 51

The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointer The disk block size is 4 kB… Read More »

## GATE | GATE CS 2019 | Question 50

Consider the following four processes with arrival times (in milliseconds) and their length of CPU burst (in milliseconds) as shown below: These processes are run… Read More »

## GATE | GATE CS 2019 | Question 49

Consider the following statements: I. The smallest element in a max-heap is always at a leaf node. II. The second largest element in a max-heap… Read More »

## GATE | GATE CS 2019 | Question 48

Consider the following snapshot of a system running n concurrent processes. Process i is holding Xi instances of a resource R, 1 ≤ i ≤… Read More »

## GATE | GATE CS 2019 | Question 47

Let G be any connection, weighted, undirected graph: I. G has a unique minimum spanning tree if no two edges of G have the same… Read More »

## GATE | GATE CS 2019 | Question 46

There are n unsorted arrays: A1, A2, ….,An. Assume that n is odd. Each of A1, A2, …., An contains n distinct elements. There are… Read More »

## GATE | GATE CS 2019 | Question 45

Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let X1, X2, X3, X4, X5 and X6 be the… Read More »