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
Recent activity by Radha mohan
12
answers
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
+
–
4
answers
2
GATE CSE 2019 | Question: 5
Let $U = \{1, 2, \dots , n\}$ Let $A=\{(x, X) \mid x \in X, X \subseteq U \}$. Consider the following two statements on $\mid A \mid$. $\mid A \mid = n2^{n-1}$ $\mid A \mid = \Sigma_{k=1}^{n} k \begin{pmatrix} n \\ k \end{pmatrix}$ Which of the above statements is/are TRUE? Only I Only II Both I and II Neither I nor II
Let $U = \{1, 2, \dots , n\}$ Let $A=\{(x, X) \mid x \in X, X \subseteq U \}$. Consider the following two statements on $\mid A \mid$.$\mid A \mid = n2^{n-1}$$\mid A \mi...
11.7k
views
commented
Feb 7, 2019
Combinatory
gatecse-2019
engineering-mathematics
discrete-mathematics
combinatory
1-mark
+
–
9
answers
3
GATE CSE 2019 | Question: 10
Let $G$ be an arbitrary group. Consider the following relations on $G$: $R_1: \forall a , b \in G, \: a R_1 b \text{ if and only if } \exists g \in G \text{ such that } a = g^{-1}bg$ ... $R_1$ and $R_2$ $R_1$ only $R_2$ only Neither $R_1$ nor $R_2$
Let $G$ be an arbitrary group. Consider the following relations on $G$:$R_1: \forall a , b \in G, \: a R_1 b \text{ if and only if } \exists g \in G \text{ such that } a ...
17.6k
views
commented
Feb 4, 2019
Set Theory & Algebra
gatecse-2019
engineering-mathematics
discrete-mathematics
set-theory&algebra
group-theory
1-mark
+
–
1
answer
4
GATE Overflow | Mock GATE | Test 1 | Question: 14
Let $S(x,y,z)$ and $C(x,y,z)$ represents the Sum & Carry function of a full adder circuit. Which of the following options best represents $S(x,y,z)$ and $C(x,y,z)$ respectively? $x \oplus y \oplus z, y( x \oplus z)+xy$ $x \oplus y \oplus z, y(x+y+z)$ $x \odot y \odot z, z(x+y)+xy$ $\text{None of these}$
Let $S(x,y,z)$ and $C(x,y,z)$ represents the Sum & Carry function of a full adder circuit. Which of the following options best represents $S(x,y,z)$ and $C(x,y,z)$ respec...
1.5k
views
comment moved
Jan 5, 2019
Digital Logic
go-mockgate-1
digital-logic
adder
digital-circuits
+
–
10
answers
5
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
answer edited
Dec 13, 2018
Computer Networks
gateit-2004
computer-networks
sliding-window
normal
+
–
2
answers
6
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
answer edited
Dec 1, 2018
Theory of Computation
gatecse-2006
theory-of-computation
p-np-npc-nph
normal
non-gate
+
–
3
answers
7
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
+
–
3
answers
8
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
+
–
3
answers
9
GATE CSE 1990 | Question: 2-v
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{ll|ll}\hline (a) & \text{Pointer data type} & (p) & \text{Type conversion} \\\hline (b) & \text{Activation rec...
8.5k
views
commented
Nov 20, 2018
Compiler Design
gate1990
match-the-following
compiler-design
runtime-environment
recursion
+
–
3
answers
10
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
commented
Nov 19, 2018
Compiler Design
gate1994
compiler-design
grammar
normal
descriptive
+
–
9
answers
11
GATE CSE 1998 | Question: 19b
Compute the post fix equivalent of the following expression $3^*\log(x+1)-\frac{a}{2}$
Compute the post fix equivalent of the following expression $3^*\log(x+1)-\frac{a}{2}$
15.9k
views
commented
Nov 18, 2018
DS
gate1998
stack
infix-prefix
descriptive
+
–
4
answers
12
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
+
–
4
answers
13
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
+
–
5
answers
14
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
+
–
1
answer
15
GATE CSE 2002 | Question: 10
In a C program, an array is declared as $\text{float} \ A[2048]$. Each array element is $4 \ \text{Bytes}$ in size, and the starting address of the array is $0x00000000$. This program is run on a computer that has a direct ... ? Justify your answer briefly. Assume that the data cache is initially empty and that no other data or instruction accesses are to be considered.
In a C program, an array is declared as $\text{float} \ A[2048]$. Each array element is $4 \ \text{Bytes}$ in size, and the starting address of the array is $0x00000000$....
6.3k
views
commented
Sep 23, 2018
CO and Architecture
gatecse-2002
co-and-architecture
cache-memory
normal
descriptive
+
–
6
answers
16
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
+
–
4
answers
17
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
+
–
6
answers
18
GATE CSE 2009 | Question: 48
Let $G(x)$ be the generator polynomial used for CRC checking. What is the condition that should be satisfied by $G(x)$ to detect odd number of bits in error? $G(x)$ contains more than two terms $G(x)$ does not divide $1+x^k$, for any $k$ not exceeding the frame length $1+x$ is a factor of $G(x)$ $G(x)$ has an odd number of terms.
Let $G(x)$ be the generator polynomial used for CRC checking. What is the condition that should be satisfied by $G(x)$ to detect odd number of bits in error?$G(x)$ contai...
29.7k
views
commented
Sep 15, 2018
Computer Networks
gatecse-2009
computer-networks
error-detection
normal
+
–
4
answers
19
GATE CSE 1992 | Question: 01,ii
Consider a $3$-bit error detection and $1$-bit error correction hamming code for $4$-bit data. The extra parity bits required would be _____ and the $3$-bit error detection is possible because the code has a minimum distance of _______.
Consider a $3$-bit error detection and $1$-bit error correction hamming code for $4$-bit data. The extra parity bits required would be _____ and the $3$-bit error detecti...
12.0k
views
commented
Sep 15, 2018
Computer Networks
gate1992
computer-networks
error-detection
normal
fill-in-the-blanks
+
–
9
answers
20
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
+
–
9
answers
21
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
+
–
3
answers
22
GATE IT 2007 | Question: 62
Let us consider a statistical time division multiplexing of packets. The number of sources is $10$. In a time unit, a source transmits a packet of $1000$ bits. The number of sources sending data for the first $20$ ... unit. Then the average number of backlogged of packets per time unit during the given period is $5$ $4.45$ $3.45$ $0$
Let us consider a statistical time division multiplexing of packets. The number of sources is $10$. In a time unit, a source transmits a packet of $1000$ bits. The number...
13.2k
views
commented
Sep 10, 2018
Computer Networks
gateit-2007
computer-networks
communication
normal
+
–
5
answers
23
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
+
–
2
answers
24
GATE IT 2005 | Question: 25
Consider the three commands : PROMPT, HEAD and RCPT. Which of the following options indicate a correct association of these commands with protocols where these are used? HTTP, SMTP, FTP FTP, HTTP, SMTP HTTP, FTP, SMTP SMTP, HTTP, FTP
Consider the three commands : PROMPT, HEAD and RCPT.Which of the following options indicate a correct association of these commands with protocols where these are used?HT...
7.5k
views
commented
Sep 8, 2018
Computer Networks
gateit-2005
computer-networks
application-layer-protocols
normal
+
–
5
answers
25
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
commented
Sep 7, 2018
Theory of Computation
gate1998
theory-of-computation
regular-expression
easy
descriptive
+
–
8
answers
26
GATE CSE 2014 Set 3 | Question: 39
Suppose we have a balanced binary search tree $T$ holding $n$ numbers. We are given two numbers $L$ and $H$ and wish to sum up all the numbers in $T$ that lie between $L$ and $H$. Suppose there are $m$ such numbers in $T$. If the tightest upper bound on the time to compute the sum is $O(n^a\log^bn+m^c\log^dn)$, the value of $a+10b+100c+1000d$ is ______.
Suppose we have a balanced binary search tree $T$ holding $n$ numbers. We are given two numbers $L$ and $H$ and wish to sum up all the numbers in $T$ that lie between $L$...
31.8k
views
commented
Aug 8, 2018
DS
gatecse-2014-set3
data-structures
binary-search-tree
numerical-answers
normal
+
–
2
answers
27
GATE CSE 2017 Set 1 | Question: 23
Consider a database that has the relation schema EMP (EmpId, EmpName, and DeptName). An instance of the schema EMP and a SQL query on it are given below: ... DeptName, COUNT(EmpId) AS EC(DeptName, Num) FROM EMP GROUP BY DeptName) The output of executing the SQL query is _____________ .
Consider a database that has the relation schema EMP (EmpId, EmpName, and DeptName). An instance of the schema EMP and a SQL query on it are given below:$$\small \overset...
13.7k
views
commented
Jul 3, 2018
Databases
gatecse-2017-set1
databases
sql
numerical-answers
+
–
8
answers
28
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
+
–
4
answers
29
GATE CSE 2012 | Question: 43
Suppose $R_{1} (\underline{A}, B)$ and $R_{2} (\underline{C}, D) $ are two relation schemas. Let $r_{1}$ and $r_{2}$ be the corresponding relation instances. $B$ is a foreign key that refers to $C$ in $R_{2}$. If data in $r_{1}$ and $r_{2}$ satisfy referential ... $\prod_{B}(r_{1}) = \prod _{C}(r_{2})$ $\prod_{B}(r_{1}) - \prod _{C}(r_{2}) \neq \varnothing$
Suppose $R_{1} (\underline{A}, B)$ and $R_{2} (\underline{C}, D) $ are two relation schemas. Let $r_{1}$ and $r_{2}$ be the corresponding relation instances. $B$ is a for...
11.4k
views
commented
Jul 1, 2018
Databases
gatecse-2012
databases
relational-algebra
normal
+
–
5
answers
30
GATE IT 2006 | Question: 15
Which of the following relational query languages have the same expressive power? Relational algebra Tuple relational calculus restricted to safe expressions Domain relational calculus restricted to safe expressions II and III only I and II only I and III only I, II and III
Which of the following relational query languages have the same expressive power?Relational algebraTuple relational calculus restricted to safe expressionsDomain relation...
9.2k
views
comment edited
Jul 1, 2018
Databases
gateit-2006
databases
relational-algebra
relational-calculus
easy
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register