The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by Radha mohan
User Radha mohan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Radha mohan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+15
votes
1
GATE201929
Suppose that in an IPoverEthernet 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's IP ... ARP request packet with broadcast MAC address in its local subnet X sends an ARP request packet with broadcast IP address in its local subnet
answered
Feb 7
in
Computer Networks

4k
views
gate2019
computernetworks
networkprotocols
+1
vote
2
GATE19952.3
Assume that $X$ and $Y$ are nonzero 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
answered
Nov 29, 2018
in
Algorithms

925
views
gate1995
algorithms
identifyfunction
normal
0
votes
3
GATE19962.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$ ... null 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
answered
Nov 21, 2018
in
Theory of Computation

3.2k
views
gate1996
theoryofcomputation
contextfreelanguage
normal
0
votes
4
GATE200779
Consider the CFG with $\left\{S, A, B\right\}$ as the nonterminal 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$ $A \rightarrow a$ ... $B \rightarrow aBB$ $S \rightarrow bAA$ For the string $aabbab$, how many derivation trees are there? $1$ $2$ $3$ $4$
answered
Nov 18, 2018
in
Compiler Design

1.4k
views
gate2007
compilerdesign
grammar
normal
0
votes
5
GATE200659
Consider the following translation scheme. $ S\rightarrow ER$ $ R\rightarrow ^{*}E\left \{ print('*'); \right \} R\mid \varepsilon $ $ E\rightarrow F+E\left \{ print('+'); \right \}\mid F $ $ F\rightarrow (S)\mid id \left \{ print(id.value); \right \} $ Here id is a token that represents ... $2 * 3 + 4$ $2 * +3 \ 4$ $2 \ 3 * 4 +$ $2 \ 3 \ 4+*$
answered
Nov 18, 2018
in
Compiler Design

2.6k
views
gate2006
compilerdesign
grammar
normal
0
votes
6
GATE199420
A grammar $G$ is in ChomskyNormal Form (CNF) if all its productions are of the form $A \to BC$ or $A \to a$, where $A,B$ and $C$, are nonterminals 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$?
answered
Nov 18, 2018
in
Compiler Design

1.2k
views
gate1994
compilerdesign
grammar
normal
0
votes
7
GATE19871xxii
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
answered
Nov 7, 2018
in
Set Theory & Algebra

461
views
gate1987
polynomials
+11
votes
8
GATE19962.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$
answered
Sep 21, 2018
in
CO and Architecture

7k
views
gate1996
coandarchitecture
microprogramming
normal
+5
votes
9
GATE20021.9
A device employing INTR line for device interrupt puts the CALL instruction on the data bus while: $\overline{INTA}$ is active HOLD is active READY is inactive None of the above
answered
Sep 21, 2018
in
CO and Architecture

2.4k
views
gate2002
coandarchitecture
interrupts
normal
+6
votes
10
GATE2015119
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 m+1. If the ... sender is always less than or equal to the advertised window. III only I and III only I and IV only II and IV only
answered
Sep 13, 2018
in
Computer Networks

4.2k
views
gate20151
computernetworks
tcp
normal
0
votes
11
GATE2004IT88
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 slowstart phase with a current transmit window of $4000$ $\text{bytes}$. ... current transmit window? $4000$ $\text{bytes}$ $8000$ $\text{bytes}$ $10000$ $\text{bytes}$ $12000$ $\text{bytes}$
answered
Sep 12, 2018
in
Computer Networks

7.2k
views
gate2004it
computernetworks
slidingwindow
normal
+1
vote
12
GATE201814
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 approximately doubles ... are true Only $\text{(iv)}$ is true Only $\text{(i)}$ and $\text{(iv)}$ are true
answered
Sep 11, 2018
in
Computer Networks

5k
views
gate2018
computernetworks
tcp
congestioncontrol
normal
0
votes
13
GATE2006IT18
HELO and PORT, respectively, are commands from the protocols: FTP and HTTP TELNET and POP3 HTTP and TELNET SMTP and FTP
answered
Sep 8, 2018
in
Computer Networks

2.2k
views
gate2006it
computernetworks
applicationlayerprotocols
normal
0
votes
14
GATE200669
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 6000, ... Plan 1 executes faster than Plan 2 for all databases For x = 9000, Plan I executes slower than Plan 2 for all databases
answered
Jul 2, 2018
in
Databases

3.5k
views
gate2006
databases
sql
normal
+1
vote
15
GATE200869
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}$ ... in $3NF$ only Book is in $2NF$ and Collection in $3NF$ Both Book and Collection are in $2NF$ only
answered
Jun 27, 2018
in
Databases

6.8k
views
gate2008
databases
databasenormalization
normal
0
votes
16
GATE19973.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
answered
Jun 18, 2018
in
Theory of Computation

3k
views
gate1997
theoryofcomputation
normal
countableuncountableset
+2
votes
17
GATE19983b
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)
answered
Jun 14, 2018
in
Theory of Computation

1.7k
views
gate1998
theoryofcomputation
regularexpressions
easy
+3
votes
18
GATE19952.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$
answered
Jun 6, 2018
in
Operating System

3.5k
views
gate1995
operatingsystem
pagereplacement
normal
+1
vote
19
GATE2014239
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 ___.
answered
May 27, 2018
in
Compiler Design

2k
views
gate20142
compilerdesign
normal
expressionevaluation
numericalanswers
+1
vote
20
GATE200631
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$ and SHAM$_3$ are NP ... is NPhard, but DHAM$_3$ is not DHAM$_3$ is NPhard, but SHAM$_3$ is not Neither DHAM$_3$ nor SHAM$_3$ is NPhard
answered
May 19, 2018
in
Theory of Computation

1.2k
views
gate2006
theoryofcomputation
pnpnpcnph
normal
50,647
questions
56,461
answers
195,358
comments
100,240
users