Similar Topics

3.2k+ articles

GATE-GATE-CS-2017 (Set 1)

50+ articles

GATE-CS-2017 (Set 1)

50+ posts

Popular articles

Recent articles

GATE | GATE-CS-2017 (Set 1) | Question 65

Last updated: 30 September 2021

Instruction execution in a processor is divided into 5 stages. Instruction Fetch(IF), Instruction Decode (ID), Operand Fetch(OF), Execute(EX), and Write Back(WB), Th ...read more

GATE-CS-2017 (Set 1)

GATE-GATE-CS-2017 (Set 1)

GATE | GATE-CS-2017 (Set 1) | Question 63

Last updated: 28 June 2021

Recall that Belady’s anomaly is that the pages-fault rate may increase as the number of allocated frames increases. Now consider the following statements:S1: Random page r ...read more

GATE-CS-2017 (Set 1)

GATE-GATE-CS-2017 (Set 1)

GATE | GATE-CS-2017 (Set 1) | Question 56

Last updated: 29 September 2021

A cache memory unit with capacity of N words and block size of B words is to be designed. If it is designed as direct mapped cache, the length of the TAG field is 10 bits. ...read more

GATE-CS-2017 (Set 1)

GATE-GATE-CS-2017 (Set 1)

Similar Topics

3.2k+ articles

GATE-GATE-CS-2017 (Set 1)

50+ articles

GATE | GATE-CS-2017 (Set 1) | Question 46

Last updated: 28 June 2021

In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps of transactions T1 and T2 ...read more

GATE-CS-2017 (Set 1)

GATE-GATE-CS-2017 (Set 1)

GATE | GATE-CS-2017 (Set 1) | Question 44

Last updated: 28 June 2021

In a RSA cryptosystem a particular A uses two prime numbers p = 13 and q =17 to generate her public and private keys. If the public key of Ais 35. Then the p ...read more

GATE-CS-2017 (Set 1)

GATE-GATE-CS-2017 (Set 1)

GATE | GATE-CS-2017 (Set 1) | Question 37

Last updated: 28 June 2021

Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements:I. M...read more

GATE-CS-2017 (Set 1)

GATE-GATE-CS-2017 (Set 1)

GATE | GATE-CS-2017 (Set 1) | Question 34

Last updated: 01 October 2021

Consider the following context-free grammar over the alphabet ∑ = {a, b, c} with S as the start symbol:S → abScT | abcTT → bT | bWhich of the following represents the lang ...read more

GATE-CS-2017 (Set 1)

GATE-GATE-CS-2017 (Set 1)

GATE | GATE-CS-2017 (Set 1) | Question 31

Last updated: 28 June 2021

Consider the language L given by the regular expression (a + b) *b(a +b) over the alphabet {a, b}. The smallest number of states needed in a deterministic finite-state aut...read more

GATE-CS-2017 (Set 1)

GATE-GATE-CS-2017 (Set 1)

GATE | GATE-CS-2017 (Set 1) | Question 30

Last updated: 13 August 2021

Consider the C code fragment given below.typedef struct node{ int data; node* next ;} node;void join(node* m, node* n){ node* p = n; while (p->next != NULL) ...read more

GATE-CS-2017 (Set 1)

GATE-GATE-CS-2017 (Set 1)

GATE | GATE-CS-2017 (Set 1) | Question 25

Last updated: 13 August 2021

Consider the following functions from positives integers to real numbers10, √n, n, log2n, 100/n.The CORRECT arrangement of the above functions in increasing order of asymp ...read more

GATE-CS-2017 (Set 1)

GATE-GATE-CS-2017 (Set 1)

GATE | GATE-CS-2017 (Set 1) | Question 24

Last updated: 16 August 2021

Consider a two-level cache hierarchy L1 and L2 caches. An application incurs 1.4 memory accesses per instruction on average. For this application, the miss rate of L1 cach...read more

GATE-CS-2017 (Set 1)

GATE-GATE-CS-2017 (Set 1)

GATE | GATE-CS-2017 (Set 1) | Question 20

Last updated: 15 February 2018

Threads of a process share(A) global variables but not heap(B) heap but not global variables(C) neither global variables nor heap(D) both heap and global variables Answer:...read more

GATE-CS-2017 (Set 1)

GATE-GATE-CS-2017 (Set 1)

GATE | GATE-CS-2017 (Set 1) | Question 17

Last updated: 13 August 2021

Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:Note: The height of a tree with a single node is 0.(A) 4 and 15 respectively...read more

GATE-CS-2017 (Set 1)

GATE-GATE-CS-2017 (Set 1)

GATE | GATE-CS-2017 (Set 1) | Question 16

Last updated: 22 July 2021

Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below:If the pre-emptive shortest remaining t...read more

GATE-CS-2017 (Set 1)

GATE-GATE-CS-2017 (Set 1)

GATE | GATE-CS-2017 (Set 1) | Question 15

Last updated: 28 June 2021

The following functional dependencies hold true for the relational schema R{V, W, X, Y, Z}:V - WVW - XY - VXY - ZWhich of the following is irreducible equivalent for this ...read more

GATE-CS-2017 (Set 1)

GATE-GATE-CS-2017 (Set 1)