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 ravi_ssj4
19
votes
1
GATE IT 2004 | Question: 27
A host is connected to a Department network which is part of a University network. The University network, in turn, is part of the Internet. The largest network in which the Ethernet address of the host is unique is the subnet to which the host belongs the Department network the University network the Internet
A host is connected to a Department network which is part of a University network. The University network, in turn, is part of the Internet. The largest network in which ...
13.6k
views
answered
Sep 16, 2016
Computer Networks
gateit-2004
computer-networks
lan-technologies
ethernet
normal
+
–
11
votes
2
GATE CSE 2014 Set 3 | Question: 25
Host A (on TCP/IP v4 network A) sends an IP datagram D to host B (also on TCP/IP v4 network B). Assume that no error occurred during the transmission of D. When D reaches B, which of the following IP header field(s) may be different from that of the original datagram ... $\text{ii}$ only $\text{ii}$ and $\text{iii}$ only $\text{i, ii}$ and $\text{iii}$
Host A (on TCP/IP v4 network A) sends an IP datagram D to host B (also on TCP/IP v4 network B). Assume that no error occurred during the transmission of D. When D reaches...
16.5k
views
answered
Sep 16, 2016
Computer Networks
gatecse-2014-set3
computer-networks
ip-packet
normal
+
–
10
votes
3
GATE CSE 2015 Set 3 | Question: 42
Let $f(n) = n$ and $g(n) = n^{(1 + \sin \: n)}$, where $n$ is a positive integer. Which of the following statements is/are correct? $f(n) = O(g(n))$ $f(n) = \Omega(g(n))$ Only I Only II Both I and II Neither I nor II
Let $f(n) = n$ and $g(n) = n^{(1 + \sin \: n)}$, where $n$ is a positive integer. Which of the following statements is/are correct?$f(n) = O(g(n))$$f(n) = \Omega(g(n))$On...
17.5k
views
answered
Sep 3, 2016
Algorithms
gatecse-2015-set3
algorithms
asymptotic-notation
normal
+
–
9
votes
4
GATE CSE 2007 | Question: 15, ISRO2016-26
Consider the following segment of C-code: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$
Consider the following segment of C-code:int j, n; j = 1; while (j <= n) j = j * 2;The number of comparisons made in the execution of the loop for any $n 0$ is:$\lceil \...
37.2k
views
answered
Aug 28, 2016
Algorithms
gatecse-2007
algorithms
time-complexity
normal
isro2016
+
–
34
votes
5
GATE CSE 1995 | Question: 3
Consider the following high level programming segment. Give the contents of the memory locations for variables $W, X, Y$ and $Z$ after the execution of the program segment. The values of the variables $A$ and $B$ are $5CH$ and $92H$, respectively. Also indicate error conditions if ... integer is represented by two bytes) begin X :=A+B Y :=abs(A-B); W :=A-B Z :=A*B end;
Consider the following high level programming segment. Give the contents of the memory locations for variables $W, X, Y$ and $Z$ after the execution of the program segmen...
5.3k
views
answered
Aug 21, 2016
Programming in C
gate1995
programming
identify-function
descriptive
+
–
31
votes
6
GATE CSE 1995 | Question: 6
What is the number of binary trees with $3$ nodes which when traversed in post-order give the sequence $A, B, C ?$ Draw all these binary trees.
What is the number of binary trees with $3$ nodes which when traversed in post-order give the sequence $A, B, C ?$ Draw all these binary trees.
3.7k
views
answered
Aug 20, 2016
DS
gate1995
data-structures
binary-tree
normal
descriptive
+
–
19
votes
7
GATE CSE 1996 | Question: 4
A binary search tree is used to locate the number $43$ ...
A binary search tree is used to locate the number $43$. Which of the following probe sequences are possible and which are not? Explain.$\begin{array}{llllll} \text{(a)} ...
22.9k
views
answered
Aug 20, 2016
DS
gate1996
data-structures
binary-search-tree
normal
descriptive
+
–
8
votes
8
GATE IT 2007 | Question: 34, UGCNET-Dec2012-III: 52
Consider the program below in a hypothetical programming language which allows global variables and a choice of static or dynamic scoping. int i; program main() { i = 10; call f(); } procedure f() { int i = 20; call g (); } procedure g() { print i; } Let $x$ be the ... . Then, $x$ and $y$ are: $x=10, y=20$ $x=20, y=10$ $x=10, y=10$ $x=20, y=20$
Consider the program below in a hypothetical programming language which allows global variables and a choice of static or dynamic scoping.int i; program main() { i = 10; ...
7.6k
views
answered
Aug 19, 2016
Programming in C
gateit-2007
programming
variable-binding
easy
ugcnetcse-dec2012-paper3
+
–
7
votes
9
GATE CSE 2015 Set 2 | Question: 31
A Young tableau is a $2D$ array of integers increasing from left to right and from top to bottom. Any unfilled entries are marked with $\infty$, and hence there cannot be any entry to the right of, or below a $\infty$. The following Young tableau ... The minimum number of entries (other than $1$) to be shifted, to remove $1$ from the given Young tableau is _____.
A Young tableau is a $2D$ array of integers increasing from left to right and from top to bottom. Any unfilled entries are marked with $\infty$, and hence there cannot be...
13.2k
views
answered
Aug 18, 2016
DS
gatecse-2015-set2
databases
array
normal
numerical-answers
+
–
2
votes
10
assume 10 Mbps Ethernet and two station A and B on it's same segment.......
assume 10 Mbps Ethernet and two station A and B on it's same segment. The RTT between two nodes is 650 bit times. A and B start transmitting frame and collision occure and both sends 30 bit jam signal. find the time at which both nodes A and B sense an idle channel(in micro sec)_____
assume 10 Mbps Ethernet and two station A and B on it's same segment. The RTT between two nodes is 650 bit times. A and B start transmitting frame and collision occure an...
1.1k
views
answered
Jul 27, 2016
5
votes
11
CN: Subnetting
Two computers A and B are configured as follows. A has IP address 203.197.17.157 and netmask 255.255.128.0. B has IP address 203.192.192.201 and netmask 255.255.192.0. Which one of the following statements is true? A. A and B both assume they are on same ... . A assumes B is on same network, B assumes A is on a different network. D. A and B both assume they are on different networks.
Two computers A and B are configured as follows. A has IP address 203.197.17.157 and netmask 255.255.128.0. B has IP address 203.192.192.201 and netmask 255.255.192.0. Wh...
1.8k
views
answered
Jul 26, 2016
Computer Networks
computer-networks
subnetting
+
–
4
votes
12
switching
A sends 2 frames of 1000 bit each to B via switch S.Bandwidth=10Mbps propogation delay over links=5us find time when second packet reaches B completely
A sends 2 frames of 1000 bit each to B via switch S.Bandwidth=10Mbps propogation delay over links=5us find time when second packet reaches B completely
1.4k
views
answered
Jul 26, 2016
0
votes
13
Distance vector
In distance vector routing how the distance vectors are update when two paths have same cost eg. Initial Distance vector of A B C D are A- [0 ∞ 1 2] B- [∞ 0 3 2] C- [1 3 0 ∞] D- [2 2 ∞ 0] what will be distance vector of A after 1 iteration. Please mention via node and why u choose that node??
In distance vector routing how the distance vectors are update when two paths have same costeg. Initial Distance vector of A B C D areA- [0 ∞ 1 2]B- [∞ 0 3...
1.2k
views
answered
Jul 25, 2016
Computer Networks
computer-networks
distance-vector-routing
+
–
89
votes
14
GATE IT 2005 | Question: 75
In a TDM medium access control bus LAN, each station is assigned one time slot per cycle for transmission. Assume that the length of each time slot is the time to transmit $100$ $\text{bits}$ ... in the LAN so that the throughput of each station can be $2/3$ $\text{Mbps}$ is $3$ $5$ $10$ $20$
In a TDM medium access control bus LAN, each station is assigned one time slot per cycle for transmission. Assume that the length of each time slot is the time to transmi...
14.2k
views
answered
Jul 20, 2016
Computer Networks
gateit-2005
computer-networks
mac-protocol
normal
+
–
163
votes
15
GATE CSE 2003 | Question: 84
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5$ packets each. Data packets (sent only from $A$ to $B$) are all $1000$ bytes long and the ... ? $7.69 \times 10^6$ Bps $11.11 \times 10^6$ Bps $12.33 \times 10^6$ Bps $15.00 \times 10^6$ Bps
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5...
28.0k
views
answered
Jul 19, 2016
Computer Networks
gatecse-2003
computer-networks
sliding-window
normal
+
–
50
votes
16
GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into ...
48.7k
views
answered
Jul 19, 2016
Computer Networks
gatecse-2009
computer-networks
sliding-window
normal
isro2016
+
–
30
votes
17
GATE CSE 2014 Set 2 | Question: 27
An IP machine $Q$ has a path to another $IP\ machine\ H$ via three $IP\ routers \ R1, R2,$ and $R3$. $Q-R1-R2-R3-H$ $H$ acts as an $\text{HTTP}\ server$, and $Q$ connects to $H$ via $\text{HTTP}$ and downloads a file. Session layer ... $R2$ alone? Only $I1$ and $I2$ Only $I1$ Only $I2$ and $I3$ Only $I3$ and $I4$
An IP machine $Q$ has a path to another $IP\ machine\ H$ via three $IP\ routers \ R1, R2,$ and $R3$.$Q-R1-R2-R3-H$$H$ acts as an $\text{HTTP}\ server$, and $Q$ connects t...
14.8k
views
answered
Jul 17, 2016
Computer Networks
gatecse-2014-set2
computer-networks
network-security
normal
out-of-gate-syllabus
+
–
71
votes
18
GATE CSE 2015 Set 1 | Question: 13
Which one of the following is TRUE at any valid state in shift-reduce parsing? Viable prefixes appear only at the bottom of the stack and not inside Viable prefixes appear only at the top of the stack and not inside The stack contains only a set of viable prefixes The stack never contains viable prefixes
Which one of the following is TRUE at any valid state in shift-reduce parsing?Viable prefixes appear only at the bottom of the stack and not insideViable prefixes appear ...
19.1k
views
answered
Jun 29, 2016
Compiler Design
gatecse-2015-set1
compiler-design
parsing
normal
viable-prefix
+
–
15
votes
19
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.8k
views
answered
Jun 29, 2016
DS
gate1998
stack
infix-prefix
descriptive
+
–
11
votes
20
GATE CSE 2016 Set 1 | Question: 19
Consider the following code segment. x = u - t; y = x * v; x = y + w; y = t - z; y = x * y; The minimum number of total variables required to convert the above code segment to static single assignment form is __________.
Consider the following code segment.x = u - t; y = x * v; x = y + w; y = t - z; y = x * y;The minimum number of total variables required to convert the above code segment...
27.6k
views
answered
Jun 29, 2016
Compiler Design
gatecse-2016-set1
compiler-design
static-single-assignment
normal
numerical-answers
+
–
–4
votes
21
GATE CSE 1996 | Question: 11
Let $G$ be a context-free grammar where $G=(\{S, A, B, C\}, \{a, b, d\}, P, S)$ with the productions in $P$ given below. $S \rightarrow ABAC$ $A \rightarrow aA \mid \varepsilon$ $B \rightarrow bB \mid \varepsilon$ ... $\varepsilon$ productions and no unit productions. (A unit production is of the form $x \rightarrow y$, and $x$ and $y$ are non terminals).
Let $G$ be a context-free grammar where $G=(\{S, A, B, C\}, \{a, b, d\}, P, S)$ with the productions in $P$ given below.$S \rightarrow ABAC$$A \rightarrow aA \mid \vareps...
7.7k
views
answered
Jun 29, 2016
Compiler Design
gate1996
compiler-design
grammar
normal
descriptive
+
–
11
votes
22
GATE CSE 2014 Set 2 | Question: 34
For a C program accessing $\mathbf{X[i] [j] [k]}$, the following intermediate code is generated by a compiler. Assume that the size of an integer is $32$ bits and the size of a character is $8$ bits. t0 = i ∗ 1024 t1 = j ∗ 32 t2 = k ∗ 4 t3 = t1 + t0 t4 ... as "char $\mathbf{X[4] [32] [8]}$ . $\mathbf{X}$ is declared as "char $\mathbf{X[32] [16] [2]}$ .
For a C program accessing $\mathbf{X[i] [j] [k]}$, the following intermediate code is generated by a compiler. Assume that the size of an integer is $32$ bits and the siz...
36.2k
views
answered
Jun 29, 2016
Compiler Design
gatecse-2014-set2
compiler-design
intermediate-code
programming-in-c
normal
+
–
1
votes
23
please provide proper explanation..!
what is the output of pro..?? #ifndef include<stdio.h> void main() { #endif printf("%d",900*90/90); }
what is the output of pro..??#ifndef include<stdio.h>void main(){#endifprintf("%d",900*90/90);}
394
views
answered
May 26, 2015
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register