Recent activity by air1ankit / GATE Overflow for GATE CSE

5 answers

1

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...

15.6k views

commented Mar 1, 2021

9 answers

2

GATE CSE 2019 | Question: 46
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 $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.

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 $T$ are chosen uniformly and independently at ...

30.8k views

commented Jan 7, 2021

3 answers

3

GATE CSE 1997 | Question: 1.5
The correct matching for the following pairs is ... $\text{A-3 B-4 C-1 D-2}$ $\text{A-3 B-4 C-2 D-1}$ $\text{A-4 B-1 C-2 D-3}$

The correct matching for the following pairs is$$\begin{array}{ll|ll}\hline \text{A.} & \text{All pairs shortest path} & \text{1.} & \text{Greedy} \\\hline \text{B.} & \...

5.1k views

commented Mar 25, 2020

3 answers

4

ISRO2018-20
Determine the number of page faults when references to pages occur in the order $1,2,4,5,2,1,2,4.$ Assume that the main memory can accommodate $3$ pages and the main memory already has the pages $1$ and $2,$ with page $1$ brought earlier than page $2.$ (assume LRU i.e., Least-Recently-Used algorithm is applied) $3$ $4$ $5$ None of the above

Determine the number of page faults when references to pages occur in the order $1,2,4,5,2,1,2,4.$ Assume that the main memory can accommodate $3$ pages and the main memo...

2.8k views

commented Jan 9, 2020

3 answers

5

GATE CSE 1987 | Question: 1-IV
The output $F$ of the below multiplexer circuit can be represented by $AB+B\bar{C}+\bar{C}A+\bar{B}\bar{C}$ $A\oplus B\oplus C$ $A \oplus B$ $\bar{A} \bar{B} C+ \bar{A} B \bar{C}+A \bar{B} \bar{C}$

The output $F$ of the below multiplexer circuit can be represented by$AB+B\bar{C}+\bar{C}A+\bar{B}\bar{C}$$A\oplus B\oplus C$$A \oplus B$$\bar{A} \bar{B} C+ \bar{A} B \ba...

4.5k views

comment edited Nov 16, 2019

5 answers

6

GATE CSE 2005 | Question: 59
Consider the grammar: $E \rightarrow E + n \mid E \times n \mid n$ For a sentence $n + n \times n$, the handles in the right-sentential form of the reduction are: $n, E + n$ and $E + n \times n$ $n, E + n$ and $E + E \times n$ $n, n + n$ and $n + n \times n$ $n, E + n$ and $E \times n$

Consider the grammar:$$E \rightarrow E + n \mid E \times n \mid n$$For a sentence $n + n \times n$, the handles in the right-sentential form of the reduction are:$n, E + ...

16.3k views

commented Nov 13, 2019

6 answers

7

GATE CSE 2002 | Question: 2.19
To evaluate an expression without any embedded function calls One stack is enough Two stacks are needed As many stacks as the height of the expression tree are needed A Turing machine is needed in the general case

To evaluate an expression without any embedded function callsOne stack is enoughTwo stacks are neededAs many stacks as the height of the expression tree are neededA Turin...

10.1k views

commented Nov 12, 2019

6 answers

8

GATE CSE 2019 | Question: 36
Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let $X_1, X_2, X_3, X_4, X_5$, and $X_6$ be the placeholders for the non-terminals $D, T, L$ or $L_1$ ... $X_1=T, \: X_2=L, \: X_3=T, \: X_4 = L_1$

Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let $X_1, X_2, X_3, X_4, X_5$, and $X_6$ be the placeholders...

16.6k views

answered Nov 8, 2019

4 answers

9

GATE CSE 2003 | Question: 77
A uni-processor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes ... Static priority scheduling with different priorities for the two processes Round robin scheduling with a time quantum of $5$ $\text{ms}$

A uni-processor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were crea...

19.8k views

commented Oct 11, 2019

6 answers

10

GATE IT 2004 | Question: 67
In a particular Unix OS, each data block is of size $1024$ bytes, each node has $10$ direct data block addresses and three additional addresses: one for single indirect block, one for double indirect block and one for triple indirect block. Also, each block can ... following is approximately the maximum size of a file in the file system? $512$ MB $2$ GB $8$ GB $16$ GB

In a particular Unix OS, each data block is of size $1024$ bytes, each node has $10$ direct data block addresses and three additional addresses: one for single indirect b...

9.3k views

commented Oct 8, 2019

6 answers

11

GATE IT 2007 | Question: 50
Consider the following finite automata $P$ and $Q$ over the alphabet $\{a, b, c\}$. The start states are indicated by a double arrow and final states are indicated by a double circle. Let the languages recognized by them be denoted by $L(P)$ and $L(Q)$ respectively. The automation which recognizes the language $L(P) \cap L(Q)$ is :

Consider the following finite automata $P$ and $Q$ over the alphabet $\{a, b, c\}$. The start states are indicated by a double arrow and final states are indicated by a d...

14.9k views

commented Sep 28, 2019

4 answers

12

GATE IT 2005 | Question: 39
Consider the regular grammar: $S \rightarrow Xa \mid Ya$ $X \rightarrow Za$ $Z \rightarrow Sa \mid \epsilon$ $Y \rightarrow Wa$ $W \rightarrow Sa$ where $S$ is the starting symbol, the set of terminals is $\{a\}$ and the set of non-terminals is ... automaton (DFA) to recognize the same language. What is the minimum number of states required for the DFA? $2$ $3$ $4$ $5$

Consider the regular grammar:$S \rightarrow Xa \mid Ya$$X \rightarrow Za$$Z \rightarrow Sa \mid \epsilon$$Y \rightarrow Wa$$W \rightarrow Sa$where $S$ is the starting sym...

12.1k views

commented Sep 28, 2019

1 answer

13

Peter linz
Minimize this dfa ?figure 2.16

Minimize this dfa ?figure 2.16

1.1k views

commented Sep 27, 2019

2 answers

14

GATE CSE 1999 | Question: 1.4
Consider the regular expression $(0 + 1) (0+1) \dots N$ times. The minimum state finite automaton that recognizes the language represented by this regular expression contains $n$ states $n+1$ states $n+2$ states None of the above

Consider the regular expression $(0 + 1) (0+1) \dots N$ times. The minimum state finite automaton that recognizes the language represented by this regular expression cont...

25.2k views

commented Sep 27, 2019

2 answers

15

GATE IT 2007 | Question: 48
Consider the grammar given below: $S \rightarrow x \ B \mid y \ A$ $A \rightarrow x \mid x \ S \mid y \ A \ A$ $B \rightarrow y \mid y \ S \mid x \ B \ B$ Consider the following strings. $xxyyx$ $xxyyxy$ $xyxy$ $yxxy$ $yxx$ $xyx$ Which of the above strings are generated by the grammar ? i, ii and iii ii, v and vi ii, iii and iv i, iii and iv

Consider the grammar given below:$S \rightarrow x \ B \mid y \ A$$A \rightarrow x \mid x \ S \mid y \ A \ A$$B \rightarrow y \mid y \ S \mid...

7.6k views

commented Sep 25, 2019

5 answers

16

GATE IT 2006 | Question: 34
In the context-free grammar below, $S$ is the start symbol, $a$ and $b$ are terminals, and $\epsilon$ denotes the empty string. $S \to aSAb \mid \epsilon$ $A \to bA \mid \epsilon$ The grammar generates the language $((a + b)^* b)$ $\{a^mb^n \mid m \leq n\}$ $\{a^mb^n \mid m = n)$ $a^* b^*$

In the context-free grammar below, $S$ is the start symbol, $a$ and $b$ are terminals, and $\epsilon$ denotes the empty string.$S \to aSAb \mid \epsilon$$A \to bA \mid \e...

8.0k views

commented Sep 25, 2019

5 answers

17

GATE IT 2007 | Question: 46
The two grammars given below generate a language over the alphabet $\{x, y, z\}$ $G1 : S \rightarrow x \mid z \mid x \ S \mid z \ S \mid y \ B$ $B \rightarrow y \mid z \mid y \ B \mid z \ B$ ... : Every $x$ is followed by at least one $y$ $G1$ : No $y$ appears after any $x$ $G2$ : Every $y$ is followed by at least one $x$

The two grammars given below generate a language over the alphabet $\{x, y, z\}$$G1 : S \rightarrow x \mid z \mid x \ S \mid z \ S \mid y \ B$ ...

5.7k views

commented Sep 25, 2019

4 answers

18

GATE CSE 2003 | Question: 51
Let $G=\left(\left\{S\right\}, \left\{a,b\right\},R,S\right)$ be a context free grammar where the rule set R is $S \to a S b \mid S S \mid \epsilon$ Which of the following statements is true? $G$ is not ambiguous There ... $L(G)$ We can find a deterministic finite state automaton that accepts $L(G)$

Let $G=\left(\left\{S\right\}, \left\{a,b\right\},R,S\right)$ be a context free grammar where the rule set R is $S \to a S b \mid S S \mid \epsilon$Which of the following...

17.6k views

commented Sep 24, 2019

2 answers

19

self doubt computer organization
The most relevant addressing mode to write position-independent code what is the meaning of postion - independent code

The most relevant addressing mode to write position-independent code what is the meaning of postion - independent code

4.5k views

answer selected Jul 9, 2019

3 answers

20

GATE CSE 1990 | Question: 2-viii
Match the pairs in the following questions: ...

Match the pairs in the following questions:$$\begin{array}{|ll|ll|} \hline (a) & \text{A heap construction} & (p) & \ \Omega(n\log_{10}n) \\\hline (b) & \text{Construct...

5.1k views

commented Jul 1, 2019

2 answers

21

GATE CSE 2016 Set 1 | Question: 21
Which of the following is NOT a superkey in a relational schema with attributes $V,W,X,Y,Z$ and primary key $V\;Y$? $VXYZ$ $VWXZ$ $VWXY$ $VWXYZ$

Which of the following is NOT a superkey in a relational schema with attributes $V,W,X,Y,Z$ and primary key $V\;Y$?$VXYZ$$VWXZ$$VWXY$$VWXYZ$

7.2k views

comment moved Apr 25, 2019

17 answers

22

GATE CSE 2016 Set 2 | Question: 40
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.

The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________.No...

50.0k views

commented Apr 20, 2019

7 answers

23

GATE CSE 2015 Set 3 | Question: 43
The total number of prime implicants of the function $f(w, x, y, z) = \sum (0, 2, 4, 5, 6, 10)$ is __________

The total number of prime implicants of the function $f(w, x, y, z) = \sum (0, 2, 4, 5, 6, 10)$ is __________

18.5k views

commented Apr 15, 2019

3 answers

24

GATE CSE 1990 | Question: 5-a
Find the minimum product of sums of the following expression $f=ABC + \overline{A}\;\;\overline{B}\;\;\overline{C}$

Find the minimum product of sums of the following expression$f=ABC + \overline{A}\;\;\overline{B}\;\;\overline{C}$

6.4k views

commented Apr 15, 2019

0 answers

25

Made easy online test series toc
The no. Of state in minimal dfa for string starting with abb and ending with b over the alphabet a,b . Please construct dfa

The no. Of state in minimal dfa for string starting with abb and ending with b over the alphabet a,b .Please construct dfa

4.6k views

commented Apr 13, 2019

4 answers

26

GATE CSE 1987 | Question: 1-II
The total number of Boolean functions which can be realised with four variables is: $4$ $17$ $256$ $65, 536$

The total number of Boolean functions which can be realised with four variables is:$4$$17$$256$$65, 536$

5.1k views

commented Apr 11, 2019

7 answers

27

GATE CSE 2017 Set 1 | Question: 27
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock $l$, then it cannot re-acquire lock $l$ without releasing ... $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$

A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All...

33.3k views

commented Apr 5, 2019

7 answers

28

GATE CSE 2019 | Question: 39
Consider the following snapshot of a system running $n$ concurrent processes. Process $i$ is holding $X_i$ instances of a resource $R$, $1 \leq i \leq n$. Assume that all instances of $R$ are currently in use. Further, for all $i$, process $i$ ... $\text{Min}(X_p,X_q) \leq \text{Max} \{Y_k \mid 1 \leq k \leq n, k \neq p, k \neq q\}$

Consider the following snapshot of a system running $n$ concurrent processes. Process $i$ is holding $X_i$ instances of a resource $R$, $1 \leq i \leq n$. Assume that all...

12.4k views

answered Apr 4, 2019

6 answers

29

GATE CSE 2019 | Question: 23
Consider three concurrent processes $P_1, P_2$ and $P_3$ as shown below, which access a shared variable $D$ that has been initialized to $100.$ ... values of $D$ after the three processes have completed execution are $X$ and $Y$ respectively, then the value of $Y-X$ is ______

Consider three concurrent processes $P_1, P_2$ and $P_3$ as shown below, which access a shared variable $D$ that has been initialized to $100.$ $$\begin{array}{|c|c|c|} \...

17.1k views

commented Apr 2, 2019

3 answers

30

GATE CSE 1991 | Question: 01,vii
The minimum number of comparisons required to sort $5$ elements is ______

The minimum number of comparisons required to sort $5$ elements is ______

8.8k views

commented Mar 30, 2019

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