Recent questions tagged gatecse-2020 / GATE Overflow for GATE CSE

18 votes

5 answers

31

GATE CSE 2020 | Question: 21
A direct mapped cache memory of $1$ MB has a block size of $256$ bytes. The cache has an access time of $3$ ns and a hit rate of $94 \%$. During a cache miss, it takes $2$0 ns to bring the first word of a block from the main memory, while ... word takes $5$ ns. The word size is $64$ bits. The average memory access time in ns (round off to $1$ decimal place) is______.

A direct mapped cache memory of $1$ MB has a block size of $256$ bytes. The cache has an access time of $3$ ns and a hit rate of $94 \%$. During a cache miss, it takes $2...

Arjun

15.6k views

Arjun asked Feb 12, 2020

36 votes

2 answers

32

GATE CSE 2020 | Question: 22
Consider the following C program. #include <stdio.h> int main () { int a[4] [5] = {{1, 2, 3, 4, 5}, {6, 7,8, 9, 10}, {11, 12, 13, 14, 15}, {16, 17,18, 19, 20}}; printf(“%d\n”, *(*(a+**a+2)+3)); return(0); } The output of the program is _______.

Consider the following C program.#include <stdio.h int main () { int a[4] [5] = {{1, 2, 3, 4, 5}, {6, 7,8, 9, 10}, {11, 12, 13, ...

Arjun

23.5k views

Arjun asked Feb 12, 2020

24 votes

2 answers

33

GATE CSE 2020 | Question: 23
Consider a double hashing scheme in which the primary hash function is $h_1(k)= k \text{ mod } 23$, and the secondary hash function is $h_2(k)=1+(k \text{ mod } 19)$. Assume that the table size is $23$. Then the address returned by probe $1$ in the probe sequence (assume that the probe sequence begins at probe $0$) for key value $k=90$ is_____________.

Consider a double hashing scheme in which the primary hash function is $h_1(k)= k \text{ mod } 23$, and the secondary hash function is $h_2(k)=1+(k \text{ mod } 19)$. Ass...

Arjun

13.8k views

Arjun asked Feb 12, 2020

19 votes

2 answers

34

GATE CSE 2020 | Question: 24
Consider the following grammar. $S \rightarrow aSB \mid d$ $B \rightarrow b$ The number of reduction steps taken by a bottom-up parser while accepting the string $aaadbbb$ is ___________.

Consider the following grammar.$S \rightarrow aSB \mid d$$B \rightarrow b$The number of reduction steps taken by a bottom-up parser while accepting the string $aaadbbb$ ...

Arjun

12.5k views

Arjun asked Feb 12, 2020

17 votes

3 answers

35

GATE CSE 2020 | Question: 25
Assume that you have made a request for a web page through your web browser to a web server. Initially the browser cache is empty. Further, the browser is configured to send $\textsf{HTTP}$ requests in non-persistent mode. The web ... small images.The minimum number of $\textsf{TCP}$ connections required to display the web page completely in your browser is__________.

Assume that you have made a request for a web page through your web browser to a web server. Initially the browser cache is empty. Further, the browser is configured to s...

Arjun

15.3k views

Arjun asked Feb 12, 2020

31 votes

7 answers

36

GATE CSE 2020 | Question: 26
Which of the following languages are undecidable? Note that $\left \langle M \right \rangle$ indicates encoding of the Turing machine M. $L_1 = \{\left \langle M \right \rangle \mid L(M) = \varnothing \}$ ... $L_1$, $L_3$, and $L_4$ only $L_1$ and $L_3$ only $L_2$ and $L_3$ only $L_2$, $L_3$, and $L_4$ only

Which of the following languages are undecidable? Note that $\left \langle M \right \rangle$ indicates encoding of the Turing machine M.$L_1 = \{\left \langle M \right \r...

Arjun

14.5k views

Arjun asked Feb 12, 2020

15 votes

3 answers

37

GATE CSE 2020 | Question: 27
Let $A$ and $B$ be two $n \times n$ matrices over real numbers. Let rank($M$) and $\text{det}(M)$ denote the rank and determinant of a matrix $M$, respectively. Consider the following statements. $\text{rank}(AB) = \text{rank }(A) \text{rank }(B)$ ... Which of the above statements are TRUE? I and II only I and IV only II and III only III and IV only

Let $A$ and $B$ be two $n \times n$ matrices over real numbers. Let rank($M$) and $\text{det}(M)$ denote the rank and determinant of a matrix $M$, respectively. Consider...

Arjun

10.1k views

Arjun asked Feb 12, 2020

15 votes

4 answers

38

GATE CSE 2020 | Question: 28
Consider the Boolean function $z(a,b,c)$. Which one of the following minterm lists represents the circuit given above? $z=\sum (0,1,3,7)$ $z=\sum (1,4,5,6,7)$ $z=\sum (2,4,5,6,7)$ $z=\sum (2,3,5)$

Consider the Boolean function $z(a,b,c)$. Which one of the following minterm lists represents the circuit given above?$z=\sum (0,1,3,7)$$z=\sum (1,4,5,6,7)$$z=\sum (2,4,5...

Arjun

8.0k views

Arjun asked Feb 12, 2020

27 votes

4 answers

39

GATE CSE 2020 | Question: 29
Consider three registers $R1$, $R2$, and $R3$ that store numbers in $\textsf{IEEE-754}$ single precision floating point format. Assume that $R1$ and $R2$ contain the values (in hexadecimal notation) $\textsf{0x42200000}$ ... what is the value stored in $R3$? $\textsf{0x40800000}$ $\textsf{0xC0800000}$ $\textsf{0x83400000}$ $\textsf{0xC8500000}$

Consider three registers $R1$, $R2$, and $R3$ that store numbers in $\textsf{IEEE-754}$ single precision floating point format. Assume that $R1$ and $R2$ contain the valu...

Arjun

18.5k views

Arjun asked Feb 12, 2020

21 votes

3 answers

40

GATE CSE 2020 | Question: 30
A computer system with a word length of $32$ bits has a $16$ MB byte- addressable main memory and a $64$ KB, $4$-way set associative cache memory with a block size of $256$ ... set. $A3$ and $A4$ are mapped to the same cache set. $A1$ and $A3$ are mapped to the same cache set.

A computer system with a word length of $32$ bits has a $16$ MB byte- addressable main memory and a $64$ KB, $4$-way set associative cache memory with a block size of $25...

Arjun

16.3k views

Arjun asked Feb 12, 2020

38 votes

5 answers

41

GATE CSE 2020 | Question: 31
Let $G = (V, E)$ be a weighted undirected graph and let $T$ be a Minimum Spanning Tree (MST) of $G$ maintained using adjacency lists. Suppose a new weighed edge $(u, v) \in V \times V$ is added to $G$. The worst case time complexity of determining if $T$ is still an MST ... $\Theta (\mid E \mid \mid V \mid) \\$ $\Theta(E \mid \log \mid V \mid) \\$ $\Theta( \mid V \mid)$

Let $G = (V, E)$ be a weighted undirected graph and let $T$ be a Minimum Spanning Tree (MST) of $G$ maintained using adjacency lists. Suppose a new weighed edge $(u, v) ...

Arjun

19.1k views

Arjun asked Feb 12, 2020

33 votes

4 answers

42

GATE CSE 2020 | Question: 32
Consider the following languages. $\begin{array}{ll} L_1= \{ wxyx \mid w,x,y \in (0+1)^{+} \} \\ L_2= \{xy \mid x,y \in (a+b)^{*}, \mid x \mid=\mid y \mid, x \neq y \} \end{array}$ ... context- free but not regular and $L_2$ is context-free. Neither $L_1$ nor $L_2$ is context- free. $L_1$ context- free but $L_2$ is not context-free.

Consider the following languages.$$\begin{array}{ll} L_1= \{ wxyx \mid w,x,y \in (0+1)^{+} \} \\ L_2= \{xy \mid x,y \in (a+b)^{*}, \mid x \mid=\mid y \mid, x \neq y \} \e...

Arjun

18.1k views

Arjun asked Feb 12, 2020

19 votes

2 answers

43

GATE CSE 2020 | Question: 33
Consider the productions $A \rightarrow PQ$ and $A \rightarrow XY$. Each of the five non-terminals $A, P, Q, X,$ and $Y$ has two attributes: $s$ is a synthesized attribute, and $i$ ... Only Rule $1$ is $L$-attributed. Only Rule $2$ is $L$-attributed. Neither Rule $1$ nor Rule $2$ is $L$-attributed.

Consider the productions $A \rightarrow PQ$ and $A \rightarrow XY$. Each of the five non-terminals $A, P, Q, X,$ and $Y$ has two attributes: $s$ is a synthesized attribu...

Arjun

9.2k views

Arjun asked Feb 12, 2020

19 votes

3 answers

44

GATE CSE 2020 | Question: 34
Each of a set of $n$ processes executes the following code using two semaphores $a$ and $b$ initialized to $1$ and $0$, respectively. Assume that $\text{count}$ is a shared variable initialized to $0$ ... all processes execute CODE SECTION P mutually exclusively. It ensures that at most $n-1$ processes are in CODE SECTION P at any time.

Each of a set of $n$ processes executes the following code using two semaphores $a$ and $b$ initialized to $1$ and $0$, respectively. Assume that $\text{count}$ is a shar...

Arjun

13.7k views

Arjun asked Feb 12, 2020

8 votes

1 answer

45

GATE CSE 2020 | Question: 35
Consider the following five disk five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time. $(P, 155), (Q,85), (R,110),(S, 30), (T,115)$ Assume the head is positioned at ... ,but before $T$. The head reverses its direction of movement between servicing of $Q$ and $P$. $R$ is serviced before $P$.

Consider the following five disk five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time.$(P, 155...

Arjun

5.3k views

Arjun asked Feb 12, 2020

17 votes

3 answers

46

GATE CSE 2020 | Question: 36
Consider a relational table $R$ that is in $3NF$, but not in BCNF. Which one of the following statements is TRUE? $R$ has a nontrivial functional dependency $X \rightarrow A$, where $X$ is not a superkey and $A$ is a prime attribute. $R$ has a ... a non-prime attribute and $X$ is a proper subset of some key A cell in $R$ holds a set instead of an atomic value.

Consider a relational table $R$ that is in $3NF$, but not in BCNF. Which one of the following statements is TRUE?$R$ has a nontrivial functional dependency $X \rightarrow...

Arjun

6.8k views

Arjun asked Feb 12, 2020

20 votes

5 answers

47

GATE CSE 2020 | Question: 37
Consider a schedule of transactions $T_1$ and $T_2$ ...

Consider a schedule of transactions $T_1$ and $T_2$:$\begin{array}{|c|c|c|c|c|c|c|c|c|c|c|} \hline T_1 & RA & & & RC & & WD & & WB & \text{Commit} & \\ \hline T_2 & & R...

Arjun

11.8k views

Arjun asked Feb 12, 2020

29 votes

2 answers

48

GATE CSE 2020 | Question: 38
An organization requires a range of IP address to assign one to each of its $1500$ computers. The organization has approached an Internet Service Provider (ISP) for this task. The ISP uses CIDR and serves the requests from the available IP address space $202.61.0.0/17$. The ... $\text{III}$ only $\text{III}$ and $\text{IV}$ only $\text{I}$ and $\text{IV}$ only

An organization requires a range of IP address to assign one to each of its $1500$ computers. The organization has approached an Internet Service Provider (ISP) for this ...

Arjun

24.5k views

Arjun asked Feb 12, 2020

42 votes

9 answers

49

GATE CSE 2020 | Question: 39
Which one of the following predicate formulae is NOT logically valid? Note that $W$ is a predicate formula without any free occurrence of $x$. $\forall x (p(x) \vee W) \equiv \forall x \: ( px) \vee W$ ... $\exists x(p(x) \rightarrow W) \equiv \forall x \: p(x) \rightarrow W$

Which one of the following predicate formulae is NOT logically valid?Note that $W$ is a predicate formula without any free occurrence of $x$.$\forall x (p(x) \vee W) \equ...

Arjun

17.2k views

Arjun asked Feb 12, 2020

39 votes

6 answers

50

GATE CSE 2020 | Question: 40
Let $G = (V,E)$ be a directed, weighted graph with weight function $w: E \rightarrow \mathbb{R}$. For some function $f: V \rightarrow \mathbb{R}$, for each edge$(u,v)\in E$, define ${w}'(u,v)$ as $w(u,v)+f(u)-f(v)$. Which one of the ... from $s$ to $u$ in the graph obtained by adding a new vertex $s$ to $G$ and edges of zero weight from $s$ to every vertex of $G$

Let $G = (V,E)$ be a directed, weighted graph with weight function $w: E \rightarrow \mathbb{R}$. For some function $f: V \rightarrow \mathbb{R}$, for each edge$(u,v)\in ...

Arjun

18.1k views

Arjun asked Feb 12, 2020

29 votes

4 answers

51

GATE CSE 2020 | Question: 41
In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported elements is $k$. $\Theta (\log n)$ $\Theta (\log n +k)$ $\Theta (k \log n)$ $\Theta ( n \log k)$

In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported ...

Arjun

21.9k views

Arjun asked Feb 12, 2020

28 votes

8 answers

52

GATE CSE 2020 | Question: 42
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.

The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.

Arjun

16.5k views

Arjun asked Feb 12, 2020

25 votes

4 answers

53

GATE CSE 2020 | Question: 43
Consider a non-pipelined processor operating at $2.5$ GHz. It takes $5$ clock cycles to complete an instruction. You are going to make a $5$- stage pipeline out of this processor. Overheads associated with pipelining force you to ... , the speedup achieved by the pipelined processor over the non-pipelined processor (round off to $2$ decimal places) is_____________.

Consider a non-pipelined processor operating at $2.5$ GHz. It takes $5$ clock cycles to complete an instruction. You are going to make a $5$- stage pipeline out of this p...

Arjun

16.5k views

Arjun asked Feb 12, 2020

24 votes

6 answers

54

GATE CSE 2020 | Question: 44
A processor has $64$ registers and uses $16$-bit instruction format. It has two types of instructions: I-type and R-type. Each I-type instruction contains an opcode, a register name, and a $4$-bit immediate value. Each R-type instruction ... two register names. If there are $8$ distinct I-type opcodes, then the maximum number of distinct R-type opcodes is _______.

A processor has $64$ registers and uses $16$-bit instruction format. It has two types of instructions: I-type and R-type. Each I-type instruction contains an opcode, a re...

Arjun

28.8k views

Arjun asked Feb 12, 2020

24 votes

2 answers

55

GATE CSE 2020 | Question: 45
For $n>2$, let $a \in \{0,1\}^n$ be a non-zero vector. Suppose that $x$ is chosen uniformly at random from $\{0,1\}^n$. Then, the probability that $\displaystyle{} \Sigma_{i=1}^n a_i x_i$ is an odd number is______________

For $n>2$, let $a \in \{0,1\}^n$ be a non-zero vector. Suppose that $x$ is chosen uniformly at random from $\{0,1\}^n$. Then, the probability that $\displaystyle{} \Sigm...

Arjun

12.3k views

Arjun asked Feb 12, 2020

38 votes

3 answers

56

GATE CSE 2020 | Question: 46
Consider the following C functions. int fun1(int n) { static int i= 0; if (n > 0) { ++i; fun1(n-1); } return (i); } int fun2(int n) { static int i= 0; if (n>0) { i = i+ fun1 (n) ; fun2(n-1) ; } return (i); } The return value of $\text{fun}2 (5)$ is _________

Consider the following C functions.int fun1(int n) { static int i= 0; if (n 0) { ++i; fun1(n-1); } return (i); }int fun2(int n) { static int i= ...

Arjun

23.4k views

Arjun asked Feb 12, 2020

28 votes

6 answers

57

GATE CSE 2020 | Question: 47
Consider the array representation of a binary min-heap containing $1023$ elements. The minimum number of comparisons required to find the maximum in the heap is ___________.

Consider the array representation of a binary min-heap containing $1023$ elements. The minimum number of comparisons required to find the maximum in the heap is _________...

Arjun

15.0k views

Arjun asked Feb 12, 2020

18 votes

4 answers

58

GATE CSE 2020 | Question: 48
Consider the following C functions. int tob (int b, int* arr) { int i; for (i = 0; b>0; i++) { if (b%2) arr [i] = 1; else arr[i] = 0; b = b/2; } return (i); } int pp(int a, int b) { int arr[20]; int i, tot = 1, ex, len; ex = a; len = tob(b ... ; i<len ; i++) { if (arr[i] ==1) tot = tot * ex; ex= ex*ex; } return (tot) ; } The value returned by $pp(3,4)$ is _______.

Consider the following C functions.int tob (int b, int* arr) { int i; for (i = 0; b>0; i++) { if (b%2) arr [i] = 1; else arr[i] = 0; b = b/2; } ret...

Arjun

11.4k views

Arjun asked Feb 12, 2020

8 votes

4 answers

59

GATE CSE 2020 | Question: 49
Consider a graph $G = (V,E)$, where $V = \{v_1,v_2, \dots ,v_{100}\}$, $E = \{(v_i,v_j) \mid 1\leq i < j \leq 100\}$, and weight of the edge $(v_i,v_j)$ is $\mid i – j \mid$. The weight of minimum spanning tree of $G$ is _________

Consider a graph $G = (V,E)$, where $V = \{v_1,v_2, \dots ,v_{100}\}$, $E = \{(v_i,v_j) \mid 1\leq i < j \leq 100\}$, and weight of the edge $(v_i,v_j)$ is $\mid i – j ...

Arjun

9.8k views

Arjun asked Feb 12, 2020

14 votes

3 answers

60

GATE CSE 2020 | Question: 50
Consider the following set of processes, assumed to have arrived at time $0$. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR, assume that the processes are scheduled in the order$P_1, P_2, P_3, P_4$ ... of the difference between the average turnaround times (in ms) of SJF and RR (round off to $2$ decimal places is_______

Consider the following set of processes, assumed to have arrived at time $0$. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR...

Arjun

10.4k views

Arjun asked Feb 12, 2020

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true