Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Radha mohan
19
votes
1
GATE CSE 2019 | Question: 29
Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this? X sends an ARP request packet to the local gateway' ... packet with broadcast MAC address in its local subnet X sends an ARP request packet with broadcast IP address in its local subnet
Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be ...
19.7k
views
answered
Feb 7, 2019
Computer Networks
gatecse-2019
computer-networks
network-protocols
2-marks
+
–
1
votes
2
GATE CSE 1995 | Question: 2.3
Assume that $X$ and $Y$ are non-zero positive integers. What does the following Pascal program segment do? while X <> Y do if X > Y then X := X - Y else Y := Y - X; write(X); Computes the LCM of two numbers Divides the larger number by the smaller number Computes the GCD of two numbers None of the above
Assume that $X$ and $Y$ are non-zero positive integers. What does the following Pascal program segment do?while X < Y do if X Y then X := X - Y else Y := Y - X; write(X)...
3.7k
views
answered
Nov 29, 2018
Algorithms
gate1995
algorithms
identify-function
normal
+
–
2
votes
3
GATE CSE 1996 | Question: 2.9
Define a context free languages $L \in \{0, 1\}^*$, $\text{init} (L) = \{u \mid uv \in L$ for some $v$ in $\{0, 1\}^*\}$ ( in other words, $\text{init}(L)$ is the set of prefixes of $L$ ... string the set of all binary strings with exactly one more $0$ than the number of $1$'s or one more $1$ than the number of $0$'s None of the above
Define a context free languages $L \in \{0, 1\}^*$, $\text{init} (L) = \{u \mid uv \in L$ for some $v$ in $\{0, 1\}^*\}$ ( in other words, $\text{init}(L)$ is the set of...
10.3k
views
answered
Nov 21, 2018
Theory of Computation
gate1996
theory-of-computation
context-free-language
normal
+
–
1
votes
4
GATE CSE 2007 | Question: 79
Consider the CFG with $\left\{S, A, B\right\}$ as the non-terminal alphabet, $\{a, b\}$ as the terminal alphabet, $S$ as the start symbol and the following set of production rules: $S \rightarrow aB$ $S \rightarrow bA$ $B \rightarrow b$ ... $B \rightarrow aBB$ $S \rightarrow bAA$ For the string $aabbab$, how many derivation trees are there? $1$ $2$ $3$ $4$
Consider the CFG with $\left\{S, A, B\right\}$ as the non-terminal alphabet, $\{a, b\}$ as the terminal alphabet, $S$ as the start symbol and the following set of product...
8.5k
views
answered
Nov 18, 2018
Compiler Design
gatecse-2007
compiler-design
grammar
normal
+
–
0
votes
5
GATE CSE 2006 | Question: 59
Consider the following translation scheme. $ S\rightarrow ER$ $ R\rightarrow *E\left \{ \text{print}(\text{ }*\text{'}); \right \} R\mid \varepsilon $ $ E\rightarrow F+E\left \{ \text{print}(\text{ }+\text{'}); \right \}\mid F $ ... $2 * 3 + 4$ $2 * +3 \ 4$ $2 \ 3 * 4 +$ $2 \ 3 \ 4+*$
Consider the following translation scheme. $ S\rightarrow ER$$ R\rightarrow *E\left \{ \text{print}(\text{‘}*\text{’}); \right \} R\mid \varepsilon $$ E\rightarrow F+...
11.2k
views
answered
Nov 18, 2018
Compiler Design
gatecse-2006
compiler-design
grammar
normal
+
–
2
votes
6
GATE CSE 1994 | Question: 20
A grammar $G$ is in Chomsky-Normal Form (CNF) if all its productions are of the form $A \to BC$ or $A \to a$, where $A,B$ and $C$, are non-terminals and $a$ is a terminal. Suppose $G$ is a CFG in CNF and $w$ is a string in $L(G)$ of length $n$, then how long is a derivation of $w$ in $G$?
A grammar $G$ is in Chomsky-Normal Form (CNF) if all its productions are of the form $A \to BC$ or $A \to a$, where $A,B$ and $C$, are non-terminals and $a$ is a terminal...
5.0k
views
answered
Nov 18, 2018
Compiler Design
gate1994
compiler-design
grammar
normal
descriptive
+
–
1
votes
7
GATE CSE 1987 | Question: 1-xxii
The equation $7x^{7}+14x^{6}+12x^{5}+3x^{4}+12x^{3}+10x^{2}+5x+7=0$ has All complex roots At least one real root Four pairs of imaginary roots None of the above
The equation $7x^{7}+14x^{6}+12x^{5}+3x^{4}+12x^{3}+10x^{2}+5x+7=0$ hasAll complex rootsAt least one real rootFour pairs of imaginary rootsNone of the above
2.9k
views
answered
Nov 6, 2018
Calculus
gate1987
calculus
polynomials
+
–
15
votes
8
GATE CSE 1996 | Question: 2.25
A micro program control unit is required to generate a total of $25$ control signals. Assume that during any micro instruction, at most two control signals are active. Minimum number of bits required in the control word to generate the required control signals will be: $2$ $2.5$ $10$ $12$
A micro program control unit is required to generate a total of $25$ control signals. Assume that during any micro instruction, at most two control signals are active. Mi...
25.1k
views
answered
Sep 21, 2018
CO and Architecture
gate1996
co-and-architecture
microprogramming
normal
+
–
15
votes
9
GATE CSE 2002 | Question: 1.9
A device employing INTR line for device interrupt puts the CALL instruction on the data bus while: $\overline{\text{INTA}}$ is active HOLD is active READY is inactive None of the above
A device employing INTR line for device interrupt puts the CALL instruction on the data bus while:$\overline{\text{INTA}}$ is activeHOLD is activeREADY is inactiveNone of...
10.1k
views
answered
Sep 21, 2018
CO and Architecture
gatecse-2002
co-and-architecture
interrupts
normal
+
–
13
votes
10
GATE CSE 2015 Set 1 | Question: 19
Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection? If the sequence number of a segment is $m,$ then the sequence number of the subsequent segment is always ... always less than or equal to the advertised window. III only I and III only I and IV only II and IV only
Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection?If the sequence number ...
19.1k
views
answered
Sep 13, 2018
Computer Networks
gatecse-2015-set1
computer-networks
tcp
normal
+
–
0
votes
11
GATE IT 2004 | Question: 88
Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the connection is in slow-start phase with a current transmit window of $4000$ $\text{bytes}$. ... transmit window? $4000$ $\text{bytes}$ $8000$ $\text{bytes}$ $10000$ $\text{bytes}$ $12000$ $\text{bytes}$
Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the co...
24.3k
views
answered
Sep 12, 2018
Computer Networks
gateit-2004
computer-networks
sliding-window
normal
+
–
2
votes
12
GATE CSE 2018 | Question: 14
Consider the following statements regarding the slow start phase of the TCP congestion control algorithm. Note that cwnd stands for the TCP congestion window and MSS window denotes the Maximum Segments Size: The cwnd increases by $2$ MSS on every successful acknowledgment The cwnd ... true Only $\text{(iv)}$ is true Only $\text{(i)}$ and $\text{(iv)}$ are true
Consider the following statements regarding the slow start phase of the TCP congestion control algorithm. Note that cwnd stands for the TCP congestion window and MSS wind...
23.7k
views
answered
Sep 11, 2018
Computer Networks
gatecse-2018
computer-networks
tcp
congestion-control
normal
1-mark
+
–
0
votes
13
GATE IT 2006 | Question: 18
$\textsf{HELO}$ and $\textsf{PORT}$, respectively, are commands from the protocols: $\textsf{FTP}$ and $\textsf{HTTP}$ $\textsf{TELNET}$ and $\textsf{POP3}$ $\textsf{HTTP}$ and $\textsf{TELNET}$ $\textsf{SMTP}$ and $\textsf{FTP}$
$\textsf{HELO}$ and $\textsf{PORT}$, respectively, are commands from the protocols:$\textsf{FTP}$ and $\textsf{HTTP}$$\textsf{TELNET}$ and $\textsf{POP3}$$\textsf{HTTP}$ ...
8.4k
views
answered
Sep 8, 2018
Computer Networks
gateit-2006
computer-networks
application-layer-protocols
normal
+
–
1
votes
14
GATE CSE 2006 | Question: 69
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. Assume that amounts ... faster than Plan 2 for all databases For $x = 9000,$ Plan I executes slower than Plan 2 for all databases
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. ...
15.3k
views
answered
Jul 2, 2018
Databases
gatecse-2006
databases
sql
normal
+
–
5
votes
15
GATE CSE 2008 | Question: 69
Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no) with the following functional dependencies: $\text{Title Author }\rightarrow\text{ Catalog_no}$ ... $\text{2NF}$ and Collection in $\text{3NF}$ Both Book and Collection are in $\text{2NF}$ only
Consider the following relational schemes for a library database:Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no)with the fo...
28.6k
views
answered
Jun 27, 2018
Databases
gatecse-2008
databases
database-normalization
normal
+
–
1
votes
16
GATE CSE 1997 | Question: 3.4
Given $\Sigma=\{a,b\}$, which one of the following sets is not countable? Set of all strings over $\Sigma$ Set of all languages over $\Sigma$ Set of all regular languages over $\Sigma$ Set of all languages over $\Sigma$ accepted by Turing machines
Given $\Sigma=\{a,b\}$, which one of the following sets is not countable?Set of all strings over $\Sigma$Set of all languages over $\Sigma$Set of all regular languages ov...
12.5k
views
answered
Jun 18, 2018
Theory of Computation
gate1997
theory-of-computation
normal
countable-uncountable-set
+
–
5
votes
17
GATE CSE 1998 | Question: 3b
Give a regular expression for the set of binary strings where every $0$ is immediately followed by exactly $k$ $1$'s and preceded by at least $k$ $1$’s ($k$ is a fixed integer)
Give a regular expression for the set of binary strings where every $0$ is immediately followed by exactly $k$ $1$'s and preceded by at least $k$ $1$’s ($k$ is a fixed...
9.0k
views
answered
Jun 14, 2018
Theory of Computation
gate1998
theory-of-computation
regular-expression
easy
descriptive
+
–
11
votes
18
GATE CSE 1995 | Question: 2.7
The address sequence generated by tracing a particular program executing in a pure demand based paging system with $100$ records per page with $1$ free main memory frame is recorded as follows. What is the number of page faults? $0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370$ $13$ $8$ $7$ $10$
The address sequence generated by tracing a particular program executing in a pure demand based paging system with $100$ records per page with $1$ free main memory frame ...
16.4k
views
answered
Jun 6, 2018
Operating System
gate1995
operating-system
page-replacement
normal
+
–
1
votes
19
GATE CSE 2014 Set 2 | Question: 39
Consider the expression tree shown. Each leaf represents a numerical value, which can either be $0$ or $1$. Over all possible choices of the values at the leaves, the maximum possible value of the expression represented by the tree is ___.
Consider the expression tree shown. Each leaf represents a numerical value, which can either be $0$ or $1$. Over all possible choices of the values at the leaves, the max...
9.6k
views
answered
May 27, 2018
Compiler Design
gatecse-2014-set2
compiler-design
normal
expression-evaluation
numerical-answers
+
–
1
votes
20
GATE CSE 2006 | Question: 31
Let SHAM$_3$ be the problem of finding a Hamiltonian cycle in a graph $G=(V,E)$ with $|V|$ divisible by $3$ and DHAM$_3$ be the problem of determining if a Hamiltonian cycle exists in such graphs. Which one of the following is true? Both DHAM$_3$ ... NP-hard, but DHAM$_3$ is not DHAM$_3$ is NP-hard, but SHAM$_3$ is not Neither DHAM$_3$ nor SHAM$_3$ is NP-hard
Let SHAM$_3$ be the problem of finding a Hamiltonian cycle in a graph $G=(V,E)$ with $|V|$ divisible by $3$ and DHAM$_3$ be the problem of determining if a Hamiltonian...
4.7k
views
answered
May 19, 2018
Theory of Computation
gatecse-2006
theory-of-computation
p-np-npc-nph
normal
non-gate
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register