Dark Mode

Recent activity by Ashley Varghese Joy

4 answers

1

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$

answered in Theory of Computation Jun 24, 2021

9.5k views

2 answers

2

Gate CS 2014 Set 1 Slight Modification on question
A canonical set of items is given below S→L.>R Q→R. On input symbol > the set has (a).a shift-reduce conflict and a reduce-reduce conflict. (b).a shift-reduce conflict but not a reduce-reduce conflict. (c).a reduce-reduce conflict but not a shift-reduce conflict. (d).neither a shift-reduce nor a reduce-reduce conflict.

answered in Compiler Design Dec 22, 2020

719 views

4 answers

3

GATE IT 2007 | Question: 69
Consider the following clauses: Not inherently suitable for client authentication. Not a state sensitive protocol. Must be operated with more than one server. Suitable for structured message organization. May need two ports on the serve side for proper operation. The option that has the ... -i; SMTP-ii; DNS-iii; IMAP-iv; HTTP-v SMTP-i; HTTP-ii; IMAP-iii; DNS-iv; FTP-v

answered in Computer Networks Dec 18, 2020

5.1k views

3 answers

4

GATE IT 2005 | Question: 79
Suppose that two parties $A$ and $B$ wish to setup a common secret key (D-H key) between themselves using the Diffie-Hellman key exchange technique. They agree on $7$ as the modulus and $3$ as the primitive root. Party $A$ chooses $2$ and party $B$ chooses $5$ as their respective secrets. Their D-H key is $3$ $4$ $5$ $6$

commented in Computer Networks Dec 18, 2020

5.3k views

3 answers

5

GATE IT 2005 | Question: 29
Count to infinity is a problem associated with: link state routing protocol. distance vector routing protocol DNS while resolving host name TCP for congestion control

commented in Computer Networks Dec 18, 2020

4.9k views

3 answers

6

GATE IT 2007 | Question: 70
You are given the following four bytes : $\begin{array}{| c | c | c | c |} \hline 10100011 & 00110111 & 11101001 & 10101011 \\\hline \end{array}$ Which of the following are substrings of the base $64$ encoding of the above four bytes? $\text{zdp}$ $\text{fpq}$ $\text{qwA}$ $\text{oze}$

commented in Computer Networks Dec 17, 2020

10.2k views

3 answers

7

GATE CSE 2008 | Question: 29
Let $X$ be a random variable following normal distribution with mean $+1$ and variance $4$. Let $Y$ be another normal variable with mean $-1$ and variance unknown. If $P (X \leq -1) = P (Y \geq 2)$ , the standard deviation of $Y$ is $3$ $2$ $\sqrt{2}$ $1$

commented in Probability Dec 17, 2020

19.1k views

3 answers

8

GATE CSE 2014 Set 1 | Question: 2
Suppose you break a stick of unit length at a point chosen uniformly at random. Then the expected length of the shorter stick is ________ .

answered in Probability Dec 15, 2020

14.3k views

4 answers

9

GATE IT 2008 | Question: 29
If $M$ is a square matrix with a zero determinant, which of the following assertion (s) is (are) correct? S1: Each row of $M$ can be represented as a linear combination of the other rows S2: Each column of $M$ can be represented as a linear combination of the other columns S3 ... solution S4: $M$ has an inverse $S3$ and $S2$ $S1$ and $S4$ $S1$ and $S3$ $S1, S2$ and $S3$

answered in Linear Algebra Dec 14, 2020

6.9k views

3 answers

10

GATE IT 2006 | Question: 2
For the set $N$ of natural numbers and a binary operation $f : N \times N \to N,$ an element $z \in N$ is called an identity for $f,$ if $f (a, z) = a = f(z, a),$ for all $a \in N.$ Which of the following binary operations have an identity? $f (x, y) = x + y - 3$ $f (x, y) = \max(x, y)$ $f (x, y) = x^y$ I and II only II and III only I and III only None of these

commented in Set Theory & Algebra Dec 11, 2020

6.7k views

3 answers

11

GATE CSE 2015 Set 3 | Question: 3
Consider the following relation Cinema($\textit{theater, address, capacity}$) Which of the following options will be needed at the end of the SQL query SELECT P1.address FROM Cinema P1 such that it always finds the addresses of theaters with maximum ... (select max(P2.capacity) from Cinema P2) WHERE P1.capacity > Any (select max(P2.capacity) from Cinema P2)

commented in Databases Dec 5, 2020

9.0k views

10 answers

12

GATE IT 2006 | Question: 85
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored in ascending order of these primary keys as given in the tables. No indexing is available in the database. ... key, then $n$ lies in the range: $36 - 40$ $44 - 48$ $60 - 64$ $100 - 104$

commented in Databases Dec 5, 2020

17.8k views

8 answers

13

GATE CSE 2014 Set 2 | Question: 21
The maximum number of superkeys for the relation schema $R(E,F,G,H)$ with $E$ as the key is _____.

commented in Databases Dec 4, 2020

9.0k views

6 answers

14

GATE CSE 2008 | Question: 82
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is $2$ $3$ $4$ $5$

commented in Databases Dec 4, 2020

20.0k views

8 answers

15

GATE CSE 2015 Set 1 | Question: 41
Consider an Entity-Relationship $(\text{ER})$ model in which entity sets $E_{1}$ and $E_{2}$ are connected by an $m:n$ relationship $R_{12}$. $E_{1}$ and $E_{3}$ are connected by a $1 : n$ ($1$ ... from the above $\text{ER}$ model, then the minimum number of relations that would be generated if all relation are in $\text{3NF}$ is________________.

commented in Databases Dec 4, 2020

13.9k views

2 answers

16

GATE CSE 2012 | Question: 41
A file system with $300$ GByte disk uses a file descriptor with $8$ direct block addresses, $1$ indirect block address and $1$ doubly indirect block address. The size of each disk block is $128$ Bytes and the size of each disk block address is $8$ Bytes. ... file size in this file system is $3$ KBytes $35$ KBytes $280$ KBytes dependent on the size of the disk

commented in Operating System Dec 3, 2020

16.2k views

1 answer

17

GATE CSE 2006 | Question: 62, ISRO2016-50
A CPU generates $32$-bit virtual addresses. The page size is $4$ KB. The processor has a translation look-aside buffer (TLB) which can hold a total of $128$ page table entries and is $4$-way set associative. The minimum size of the TLB tag is: $\text{11 bits}$ $\text{13 bits}$ $\text{15 bits}$ $\text{20 bits}$

comment edited in Operating System Dec 3, 2020

22.4k views

7 answers

18

GATE CSE 2004 | Question: 51
Consider the relation Student (name, sex, marks), where the primary key is shown underlined, pertaining to students in a class that has at least one boy and one girl. What does the following relational algebra expression produce? (Note: $\rho$ ... of girl students with marks not less than some boy student names of girl students with more marks than all the boy students

commented in Databases Aug 29, 2020

13.9k views