Recent activity by vaibhav101 / GATE Overflow for GATE CSE

12 answers

1

GATE CSE 2017 Set 2 | Question: 39
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$ ... $\emptyset$ $\{q_0, q_1, q_3\}$ $\{q_0, q_1, q_2\}$ $\{q_0, q_2, q_3 \}$

Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$-NFA whose transition table is given below:$$\...

28.4k views

commented Feb 3, 2018

3 answers

2

GATE CSE 2017 Set 2 | Question: 17
An ER model of a database consists of entity types $A$ and $B$. These are connected by a relationship $R$ which does not have its own attribute. Under which one of the following conditions, can the relational table for R be merged with that of A? Relationship ... of $A$ in $R$ is total Relationship $R$ is many-to-one and the participation of $A$ in $R$ is partial

An ER model of a database consists of entity types $A$ and $B$. These are connected by a relationship $R$ which does not have its own attribute. Under which one of the fo...

22.4k views

commented Feb 3, 2018

1 answer

3

GATE2015 CE-2: GA-5
Four cards are randomly selected from a pack of $52$ cards. If the first two cards are kings, what is the probability that the third card is a king? $4/52$ $2/50$ $(1/52)×(1/52)$ $(1/52)×(1/51) ×(1/50)$

Four cards are randomly selected from a pack of $52$ cards. If the first two cards are kings, what is the probability that the third card is a king?$4/52$$2/50$$(1/52)×(...

2.5k views

commented Feb 1, 2018

4 answers

4

GATE2014 EC-3: GA-4
The next term in the series $81, 54, 36, 24,\dots $ is_________.

The next term in the series $81, 54, 36, 24,\dots $ is_________.

3.5k views

answered Feb 1, 2018

1 answer

5

Test by Bikram | Mock GATE | Test 4 | Question: 24
An unsorted array has this property that every element in it is at most $d$ distance from its position in the sorted version of the array (where $d$ is a positive integer smaller than the size of the array). Which among the following algorithms is best suited to sort this array? Insertion Sort Quick Sort Heap Sort Merge Sort

An unsorted array has this property that every element in it is at most $d$ distance from its position in the sorted version of the array (where $d$ is a positive integer...

617 views

answered Jan 24, 2018

1 answer

6

Test by Bikram | Mock GATE | Test 1 | Question: 53
A computer uses a memory unit with $512K$ words of $64$ bits each. A binary instruction code is stored in one word of memory. The instruction has four parts: an indirect bit, an operation code, a register code part (to specify one of $256$ registers), and an address part. The number of bits in the operation code are _______.

A computer uses a memory unit with $512K$ words of $64$ bits each. A binary instruction code is stored in one word of memory. The instruction has four parts: an indirect ...

940 views

commented Jan 21, 2018

3 answers

7

GATE CSE 2016 Set 1 | Question: 47
Consider a computer system with $40$-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per process and each page table entry requires $48$ bits, then the size of the per-process page table is __________ megabytes.

Consider a computer system with $40$-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per process and each pag...

13.7k views

commented Jan 18, 2018

7 answers

8

GATE CSE 2000 | Question: 1.21
Let $m[0]\ldots m[4]$ be mutexes (binary semaphores) and $P[0]\ldots P[4]$ be processes. Suppose each process $P[i]$ executes the following: wait (m[i]); wait (m(i+1) mod 4]); ........... release (m[i]); release (m(i+1) mod 4]); This could cause Thrashing Deadlock Starvation, but not deadlock None of the above

Let $m[0]\ldots m[4]$ be mutexes (binary semaphores) and $P[0]\ldots P[4]$ be processes. Suppose each process $P[i]$ executes the following:wait (m[i]); wait (m(i+1) mod ...

22.2k views

commented Jan 16, 2018

6 answers

9

TIFR CSE 2010 | Part B | Question: 32
Consider the following solution (expressed in Dijkstra's guarded command notation) to the mutual exclusion problem. process P1 is begin loop Non_critical_section; while not (Turn=1) do skip od; Critical_section_1; Turn:=2; end loop end process P2 is begin ... ), but does not satisfies the requirement (2). Satisfies all the requirement (1), (2), and (3).

Consider the following solution (expressed in Dijkstra's guarded command notation) to the mutual exclusion problem.process P1 is begin loop Non_critical_section; while no...

4.7k views

comment edited Jan 14, 2018

1 answer

10

Compiler Design - Parsing: Is LALR(1) made from the LR(0) or the LR(1) automaton?
According to my understanding, we LALR is constructed by reducing LR(1) automaton states. So I think it should be LR(1) However, we construct SLR(1) items from the LR(0) automaton, and we say with surety that number of states in SLR(...) is equal to number of states in LALR(...), how can this be?

According to my understanding, we LALR is constructed by reducing LR(1) automaton states. So I think it should be LR(1)However, we construct SLR(1) items from the LR(0) a...

666 views

asked Jan 13, 2018

3 answers

11

GATE IT 2004 | Question: 48
Consider a fully associative cache with $8$ cache blocks (numbered $0-7$) and the following sequence of memory block requests: $4, 3, 25, 8, 19, 6, 25, 8, 16, 35, 45, 22, 8, 3, 16, 25, 7$ If LRU replacement policy is used, which cache block will have memory block $7$? $4$ $5$ $6$ $7$

Consider a fully associative cache with $8$ cache blocks (numbered $0-7$) and the following sequence of memory block requests:$4, 3, 25, 8, 19, 6, 25, 8, 16, 35, 45, 22, ...

15.1k views

commented Jan 13, 2018

8 answers

12

GATE CSE 1994 | Question: 2.6
The probability of an event $B$ is $P_1$. The probability that events $A$ and $B$ occur together is $P_2$ while the probability that $A$ and $\bar{B}$ occur together is $P_3$. The probability of the event $A$ in terms of $P_1, P_2$ and $P_3$ is _____________

The probability of an event $B$ is $P_1$. The probability that events $A$ and $B$ occur together is $P_2$ while the probability that $A$ and $\bar{B}$ occur together is $...

4.6k views

answered Jan 12, 2018

3 answers

13

GATE IT 2007 | Question: 9
Consider an ambiguous grammar $G$ and its disambiguated version $D.$ Let the language recognized by the two grammars be denoted by $L(G)$ and $L(D)$ respectively. Which one of the following is true? $L (D) ⊂ L (G)$ $L (D) ⊃ L (G)$ $L (D) = L (G)$ $L (D)$ is empty

Consider an ambiguous grammar $G$ and its disambiguated version $D.$ Let the language recognized by the two grammars be denoted by $L(G)$ and $L(D)$ respectively. Which o...

6.7k views

commented Jan 11, 2018

5 answers

14

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 Jan 10, 2018

2 answers

15

GATE CSE 2004 | Question: 88
Consider the following grammar G: $S \rightarrow bS \mid aA \mid b$ $A \rightarrow bA \mid aB$ $B \rightarrow bB \mid aS \mid a$ Let $N_a(w)$ and $N_b(w)$ denote the number of a's and b's in a string $\omega$ respectively. The language $L(G)$ ... $\left\{w \mid N_b(w) = 3k, k \in \left\{0, 1, 2, \right\}\right\}$

Consider the following grammar G:$S \rightarrow bS \mid aA \mid b$$A \rightarrow bA \mid aB$$B \rightarrow bB \mid aS \mid a$Let $N_a(w)$ and $N_b(w)$ denote the number o...

7.2k views

commented Jan 10, 2018

8 answers

16

GATE CSE 1995 | Question: 2.20
Which of the following definitions below generate the same language as $L$, where $L=\{x^ny^n \text{ such that } n\geq 1 \}$? $E \rightarrow xEy\mid xy$ $x y \mid (x^+xyy^+$) $x^+y^+$ I only I and II II and III II only

Which of the following definitions below generate the same language as $L$, where $L=\{x^ny^n \text{ such that } n\geq 1 \}$?$E \rightarrow xEy\mid xy$$x y \mid (x^+xyy^+...

10.7k views

commented Jan 9, 2018

6 answers

17

GATE CSE 2004 | Question: 78
Two $n$ bit binary strings, $S_1$ and $S_2$ are chosen randomly with uniform probability. The probability that the Hamming distance between these strings (the number of bit positions where the two strings differ) is equal to $d$ is $\dfrac{^{n}C_{d}}{2^{n}}$ $\dfrac{^{n}C_{d}}{2^{d}}$ $\dfrac{d}{2^{n}}$ $\dfrac{1}{2^{d}}$

Two $n$ bit binary strings, $S_1$ and $S_2$ are chosen randomly with uniform probability. The probability that the Hamming distance between these strings (the number of b...

7.5k views

answered Jan 9, 2018

5 answers

18

TIFR CSE 2012 | Part A | Question: 20
There are $1000$ balls in a bag, of which $900$ are black and $100$ are white. I randomly draw $100$ balls from the bag. What is the probability that the $101$st ball will be black? $9/10$ More than $9/10$ but less than $1$. Less than $9/10$ but more than $0$. $0$ $1$

There are $1000$ balls in a bag, of which $900$ are black and $100$ are white. I randomly draw $100$ balls from the bag. What is the probability that the $101$st ball wil...

2.9k views

commented Jan 9, 2018

4 answers

19

GATE CSE 2007 | Question: 37, ISRO2009-37
Consider a pipelined processor with the following four stages: IF: Instruction Fetch ID: Instruction Decode and Operand Fetch EX: Execute WB: Write Back The IF, ID and WB stages take one clock cycle each to complete the operation. The number of clock cycles for the EX ... $ R5$-$R4} \\ \end{array}$ $7$ $8$ $10$ $14$

Consider a pipelined processor with the following four stages:IF: Instruction FetchID: Instruction Decode and Operand FetchEX: ExecuteWB: Write BackThe IF, ID and WB stag...

16.1k views

commented Jan 9, 2018

8 answers

20

GATE CSE 2012 | Question: 44
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and three links $(L_{1},L_{2},\text{ and } L_{3})$. $L_{1}$ connects $S$ to ... propagation delays in transmitting the file from $S$ to $D$? $\text{1005 ms}$ $\text{1010 ms}$ $\text{3000 ms}$ $\text{3003 ms}$

Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and th...

25.8k views

commented Jan 7, 2018

1 answer

21

GATE CSE 1992 | Question: 02,xiii
For a context free grammar, FOLLOW(A) is the set of terminals that can appear immediately to the right of non-terminal $A$ in some "sentential" form. We define two sets LFOLLOW(A) and RFOLLOW(A) by replacing the word "sentential" ... FOLLOW(A) and RFOLLOW(A) are always the same. All the three sets are identical. All the three sets are different.

For a context free grammar, FOLLOW(A) is the set of terminals that can appear immediately to the right of non-terminal $A$ in some "sentential" form. We define two sets L...

8.1k views

commented Jan 5, 2018

2 answers

22

ME GATE 2012 What is Normalised Eigen Vector ?
For the Matrix $\begin{bmatrix} 5 & 3\\ 1& 3 \end{bmatrix}$ One of the Normalised Eigen Vector is given as__________ Answer $\begin{bmatrix} \frac{1}{\sqrt{2}} \\ \frac{-1}{\sqrt{2}} \end{bmatrix}$ What is Normalised Eigen Vector ? How to Find the Solution ?

For the Matrix $\begin{bmatrix} 5 & 3\\ 1& 3 \end{bmatrix}$One of the Normalised Eigen Vector is given as__________Answer $\begin{bmatrix} \frac{1}{\sqrt{2}} \\ \frac{-1...

5.9k views

commented Jan 4, 2018

4 answers

23

GATE CSE 1993 | Question: 8.3
Let $S$ be an infinite set and $S_1 \dots , S_n$ be sets such that $S_1 \cup S_2 \cup \dots \cup S_n = S$. Then at least one of the sets $S_i$ is a finite set not more than one of the sets $S_i$ can be finite at least one of the sets $S_i$ is an infinite not more than one of the sets $S_i$ can be infinite None of the above

Let $S$ be an infinite set and $S_1 \dots , S_n$ be sets such that $S_1 \cup S_2 \cup \dots \cup S_n = S$. Thenat least one of the sets $S_i$ is a finite setnot more than...

7.7k views

commented Dec 28, 2017

9 answers

24

GATE IT 2005 | Question: 52
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which of the following statements is always TRUE? There exists a cutset in $G$ having ... $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.

Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which ...

20.8k views

commented Dec 27, 2017

2 answers

25

GATE CSE 1995 | Question: 18
The following is an incomplete Pascal function to convert a given decimal integer (in the range $-8$ to $+7$) into a binary integer in $2$'s complement representation. Determine the expressions $A, B, C$ that complete program. function TWOSCOMP (N:integer): ... do begin REM:=N mod 2; BINARY:=BINARY + B*EXPONENT; EXPONENT:=EXPONENT*10; N:=C end TWOSCOMP:=BINARY end end;

The following is an incomplete Pascal function to convert a given decimal integer (in the range $-8$ to $+7$) into a binary integer in $2$’s complement representation. ...

2.6k views

commented Dec 19, 2017

2 answers

26

TIFR CSE 2012 | Part B | Question: 12
Let $A$ be a matrix such that $A^{k}=0$. What is the inverse of $I - A$? $0$ $I$ $A$ $1 + A + A^{2} + ...+ A^{k - 1}$ Inverse is not guaranteed to exist.

Let $A$ be a matrix such that $A^{k}=0$. What is the inverse of $I - A$?$0$$I$$A$$1 + A + A^{2} + ...+ A^{k - 1}$Inverse is not guaranteed to exist.

3.2k views

commented Dec 19, 2017

5 answers

27

CMI2013-A-07
Consider the following two statements. There are infinitely many interesting whole numbers. There are finitely many uninteresting whole numbers. Which of the following is true? Statements $1$ and $2$ are equivalent. Statement $1$ implies statement $2$. Statement $2$ implies statement $1$. None of the above.

Consider the following two statements.There are infinitely many interesting whole numbers.There are finitely many uninteresting whole numbers.Which of the following is tr...

2.4k views

answered Dec 12, 2017

10 answers

28

GATE CSE 1996 | Question: 2.3
Which of the following is NOT True? (Read $\wedge$ as AND, $\vee$ as OR, $\neg$ as NOT, $\rightarrow$ as one way implication and $\leftrightarrow$ as two way implication) $((x \rightarrow y) \wedge x) \rightarrow y$ ... $(x \rightarrow (x \vee y))$ $((x \vee y) \leftrightarrow (\neg x \rightarrow \neg y))$

Which of the following is NOT True?(Read $\wedge$ as AND, $\vee$ as OR, $\neg$ as NOT, $\rightarrow$ as one way implication and $\leftrightarrow$ as two way implication)...

8.4k views

commented Dec 6, 2017

7 answers

29

GATE IT 2004 | Question: 84
Consider a parity check code with three data bits and four parity check bits. Three of the Code Words are $0101011, 1001101$ and $1110001.$ Which of the following are also code words? $0010111$ $0110110$ $1011010$ $0111010$ I and III I, II and III II and IV I, II, III and IV

Consider a parity check code with three data bits and four parity check bits. Three of the Code Words are $0101011, 1001101$ and $1110001.$ Which of the following are als...

19.0k views

commented Dec 5, 2017

3 answers

30

GATE CSE 1994 | Question: 27
Draw a precedence graph for the following sequential code. The statements are numbered from $S_1$ to $S_6$ $S_1$ read n $S_2$ i := 1 $S_3$ if i > n next $S_4$ a(i) := i+1 $S_5$ i := i+1 $S_6$ next : write a(i) Can this graph be converted to a concurrent program using parbegin-parend construct only?

Draw a precedence graph for the following sequential code. The statements are numbered from $S_1$ to $S_6$$S_1$read n$S_2$i := 1$S_3$if i n next$S_4$a(i) := i+1$S_5$i :=...

6.1k views

commented Sep 6, 2017

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