Answers by rish1602 / GATE Overflow for GATE CSE

0 votes

271

Self doubt
What are the minimum number of pointers required to implement a stack using single ended queue ( the queue is NOT a dequeue )?

What are the minimum number of pointers required to implement a stack using single ended queue ( the queue is NOT a dequeue )?

1.2k views

answered Feb 2, 2021

2 votes

272

MadeEasy Test Series: Programming & DS - Stack
Consider a stack S given below with elements 1,2,3 along with the usual operations push(), pop() and top() as shown. The number of elements that will remain in the stack after the parsing of the input string according to the above SDT rules is _______ I think the answer should be 5 but 4 is provided as answer.

Consider a stack S given below with elements 1,2,3 along with the usual operations push(), pop() and top() as shown.The number of elements that will remain in the stack a...

1.7k views

answered Feb 2, 2021

0 votes

273

Made Easy Test Series: Stack Address
A stack based CPU executes the instruction. Memory location $500$ contain $0X 88$ and memory location $700$ contain $0X37$. The stack pointer is at $0X003F$ The instruction are as follows: $I_{1}:PUSH$ $500$ $I_{2}:PUSH$. $700$ ... execution of instruction. $C)$ Memory location $600$ contain $0XBF$ after execution of instruction. $D)$ Both $a)$ and $c)$

A stack based CPU executes the instruction. Memory location $500$ contain $0X 88$ and memory location $700$ contain $0X37$. The stack pointer is at $0X003F$The instructio...

773 views

answered Feb 2, 2021

0 votes

274

Transport layer
For a network which has maximum packet size is 256 bytes . lifetime of a packet is 20 sec and 8 bit sequence number . Find maximum data rate per connection

For a network which has maximum packet size is 256 bytes . lifetime of a packet is 20 sec and 8 bit sequence number . Find maximum data rate per connection

2.6k views

answered Feb 1, 2021

0 votes

275

Andrew S. Tanenbaum Edition 5th Exercise 6 Question 9 (Page No. 607)
Why does the maximum packet lifetime, T, have to be large enough to ensure that not only the packet but also its acknowledgements have vanished?

Why does the maximum packet lifetime, T, have to be large enough to ensure that notonly the packet but also its acknowledgements have vanished?

453 views

answered Feb 1, 2021

0 votes

276

Andrew S. Tanenbaum Edition 5th Exercise 6 Question 10 (Page No. 607)
Imagine that a two-way handshake rather than a three-way handshake were used to set up connections. In other words, the third message was not required. Are deadlocks now possible? Give an example or show that none exist.

Imagine that a two-way handshake rather than a three-way handshake were used to setup connections. In other words, the third message was not required. Are deadlocksnow po...

1.0k views

answered Feb 1, 2021

0 votes

277

Stack implementation by using queue
true/false ? ) if stack is implemented as a array,all operation push ,pop ,is emptystack(),delete stack() can be performed in constant time. )if stack is implemented as a linked list ,all operation ,is emptystack(),delete stack() can be performed in constant time.

true/false ?) if stack is implemented as a array,all operation push ,pop ,is emptystack(),delete stack() can be performed in constant time.)if stack is implemented as a l...

1.4k views

answered Jan 30, 2021

0 votes

278

# CN TCP connection establishment doubt about MSS
Say Client buffer is of 12000 Bytes and MSS is 1200 B and this info is sent to server and now server send the info in (SYN +ACK) segment as Server Buffer = 18000 B and MSS is 600 B Now in data transfer phase does both Client and ... 1200, 600) = 600 Bytes? Or does the sever will send 1200 Bytes segments to C and C sends 600 B segments to server?

Say Client buffer is of 12000 Bytes and MSS is 1200 B and this info is sent to server and now server send the info in (SYN +ACK) segment as Server Buffer = 18000 B and MS...

704 views

answered Jan 28, 2021

0 votes

279

fast retransmit and fast recovery mechanism
Consider the following plot of TCP window size as a function of time. Assume TCP is operating with slow start, congestion avoidance, fast retransmit and fast recovery mechanism. What is the time interval where the slow start ... value of threshold. It starts congestion avoidance phase again. Please explain in more details about the concept underlying?

Consider the following plot of TCP window size as a function of time. Assume TCP is operating with slow start, congestion avoidance, fast retransmit and fast recovery mec...

2.0k views

answered Jan 28, 2021

2 votes

280

Computer network tcp congestion control

759 views

answered Jan 28, 2021

0 votes

281

Andrew S. Tanenbaum Edition 5th Exercise 6 Question 23 (Page No. 608)
Datagram fragmentation and reassembly are handled by IP and are invisible to TCP. Does this mean that TCP does not have to worry about data arriving in the wrong order?

Datagram fragmentation and reassembly are handled by IP and are invisible to TCP.Does this mean that TCP does not have to worry about data arriving in the wrongorder?

758 views

answered Jan 26, 2021

0 votes

282

Andrew S. Tanenbaum Edition 5th Exercise 6 Question 26 (Page No. 608)
A process on host 1 has been assigned port p, and a process on host 2 has been assigned port q. Is it possible for there to be two or more TCP connections between these two ports at the same time?

A process on host 1 has been assigned port p, and a process on host 2 has beenassigned port q. Is it possible for there to be two or more TCP connections betweenthese two...

1.3k views

answered Jan 26, 2021

0 votes

283

Andrew S. Tanenbaum Edition 5th Exercise 6 Question 27 (Page No. 608)
In Fig. 6-36 we saw that in addition to the 32-bit acknowledgement field, there is an ACK bit in the fourth word. Does this really add anything? Why or why not?

In Fig. 6-36 we saw that in addition to the 32-bit acknowledgement field, there is anACK bit in the fourth word. Does this really add anything? Why or why not?

827 views

answered Jan 26, 2021

0 votes

284

Andrew S. Tanenbaum Edition 5th Exercise 6 Question 28 (Page No. 608)
The maximum payload of a TCP segment is 65,495 bytes. Why was such a strange number chosen?

The maximum payload of a TCP segment is 65,495 bytes. Why was such a strangenumber chosen?

1.0k views

answered Jan 26, 2021

0 votes

285

Karumanchi
There is a singly linked list. We have a pointer to a particular node(it is not tail node). what is the time and space complexity required to delete this node? my approach is... As there is no previous pointer so we traverse the list from the starting to just ... complexity as O(n) and space complexity O(1). but in the book the time complexity is mentioned O(1) where am I going wrong?

There is a singly linked list. We have a pointer to a particular node(it is not tail node). what is the time and space complexity required to delete this node?my approach...

931 views

answered Jan 25, 2021

1 votes

286

Linked list
What does the following program do on two linked lists? Struct node *myFun (struct node * a, struct node * b) { Struct node *new = NULL ; If (a = = NULL) return (b) ; if (b = = NULL) return (a) ; If (a → data <= ... two linked lists by selecting the alternate nodes merges two sorted linked lists into final sorted linked list merges two linked lists by selecting the nodes in reverse.

What does the following program do on two linked lists? Struct node *myFun (struct node * a, struct node * b) { Struct node *new = NULL ; If (a = = NULL) return (b) ;...

1.1k views

answered Jan 25, 2021

0 votes

287

Cormen Edition 3 Exercise 10.2 Question 1 (Page No. 240)
Can you implement the dynamic-set operation $INSERT$ on a singly linked list in $O(1)$ time? How about $DELETE$?

Can you implement the dynamic-set operation $INSERT$ on a singly linked list in $O(1)$ time? How about $DELETE$?

518 views

answered Jan 25, 2021

0 votes

288

Andrew S. Tanenbaum Edition 5th Exercise 6 Question 37 (Page No. 609)
Suppose that you are measuring the time to receive a segment. When an interrupt occurs, you read out the system clock in milliseconds. When the segment is fully processed, you read out the clock again. You measure 0 msec 270,000 times and 1 msec 730,000 times. How long does it take to receive a segment?

Suppose that you are measuring the time to receive a segment. When an interruptoccurs, you read out the system clock in milliseconds. When the segment is fully processed,...

748 views

answered Jan 23, 2021

0 votes

289

Cormen Edition 3 Exercise 10.2 Question 5 (Page No. 240)
Implement the dictionary operations $INSERT$, $DELETE$, and $SEARCH$ using singly linked, circular lists. What are the running times of your procedures?

Implement the dictionary operations $INSERT$, $DELETE$, and $SEARCH$ using singly linked, circular lists. What are the running times of your procedures?

619 views

answered Jan 23, 2021

0 votes

290

proposition logic
CONVERT IN TO LOGIC No one who loves some one is not loved by anyone lets S(x):x is somebody L(x,y):x loves y

CONVERT IN TO LOGICNo one who loves some one is not loved by anyonelets S(x):x is somebodyL(x,y):x loves y

304 views

answered Jan 20, 2021

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true