Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
noob_coder
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by noob_coder
0
votes
1
Cormen Edition 3 Exercise 4.5 Question 2 (Page No. 97)
Professor Caesar wishes to develop a matrix-multiplication algorithm that is asymptotically faster than Strassen's algorithm. His algorithm will use the divide and conquer method, dividing each matrix into pieces of size ... value of $a$ for which Professor Caesar's algorithm would be asymptotically faster than Strassen's algorithm?
Professor Caesar wishes to develop a matrix-multiplication algorithm that is asymptotically faster than Strassen’s algorithm. His algorithm will use the divide and conq...
1.3k
views
answered
May 13, 2020
Algorithms
cormen
algorithms
recurrence-relation
master-theorem
descriptive
+
–
0
votes
2
Cormen Edition 3 Exercise 6.1 Question 1 (Page No. 153)
What are the minimum and maximum numbers of elements in a heap of height $h$?
What are the minimum and maximum numbers of elements in a heap of height $h$?
344
views
answered
May 13, 2020
Algorithms
cormen
algorithms
binary-heap
descriptive
+
–
0
votes
3
Cormen Edition 3 Exercise 6.1 Question 6 (Page No. 154)
Is the array with values $23,17,14; 6,13,10,1,5,7,12$ a max-heap ?
Is the array with values $23,17,14; 6,13,10,1,5,7,12$ a max-heap ?
1.4k
views
answered
May 13, 2020
Algorithms
cormen
algorithms
binary-heap
descriptive
+
–
0
votes
4
Cormen Edition 3 Exercise 2.1 Question 4 (Page No. 22-23)
Consider the problem of adding two $n$-bit binary integers, stored in two $n$-element arrays $A$ and $B$.The sum of the two integers should be stored in binary form in an $(n+1)$-element array $C$. State the problem formally and write pseudocode for adding the two integers.
Consider the problem of adding two $n$-bit binary integers, stored in two $n$-element arrays $A$ and $B$.The sum of the two integers should be stored in binary form in an...
1.7k
views
answered
May 3, 2020
Algorithms
cormen
algorithms
descriptive
+
–
3
votes
5
ISI2014-DCG-71
Five letters $A, B, C, D$ and $E$ are arranged so that $A$ and $C$ are always adjacent to each other and $B$ and $E$ are never adjacent to each other. The total number of such arrangements is $24$ $16$ $12$ $32$
Five letters $A, B, C, D$ and $E$ are arranged so that $A$ and $C$ are always adjacent to each other and $B$ and $E$ are never adjacent to each other. The total number of...
627
views
answered
Nov 27, 2019
Combinatory
isi2014-dcg
combinatory
arrangements
circular-permutation
+
–
0
votes
6
DBMS Korth Edition 4 Exercise 12 Question 4 (Page No. 489)
Is it possible in general to have two primary indices on the same relation for different search keys ? Explain your answer.
Is it possible in general to have two primary indices on the same relation for different search keys ? Explain your answer.
1.4k
views
answered
Jun 22, 2019
Databases
korth
databases
indexing
descriptive
+
–
0
votes
7
TCP || Kurose and Ross
Consider transferring an enormous file of L bytes from Host A to Host B. Assume an MSS of 536 bytes. a. What is the maximum value of L such that TCP sequence numbers are not exhausted? Recall that the TCP sequence number field has 4 bytes. b. ... out over a 155 Mbps link. Ignore flow control and congestion control so A can pump out the segments back to back and continuously.
Consider transferring an enormous file of L bytes from Host A to Host B. Assume an MSS of 536 bytes.a. What is the maximum value of L such that TCP sequence numbers are n...
6.0k
views
answered
May 28, 2019
Computer Networks
computer-networks
tcp
+
–
5
votes
8
MadeEasy Test Series: Computer Networks - Network Layering
Consider the following statements with respect to application layer: S1 : Datagram is the PDU (Protocol data unit) used. S2 : There is a fixed limit on the maximum size of data that it can pass on the TCP layer. Which of the following options is ... A Only S1 is true B Only S2 is true C Both S1 and S2 are true D Neither of S1 or S2 is true
Consider the following statements with respect to application layer:S1 : Datagram is the PDU (Protocol data unit) used.S2 : There is a fixed limit on the maximum size of ...
1.7k
views
answered
May 27, 2019
Computer Networks
made-easy-test-series
computer-networks
datagram
tcp
network-layering
+
–
1
votes
9
Kurose and Ross Edition 6 Exercise 3 Question R14 (Page No 287)
True or false? Host A is sending Host B a large file over a TCP connection. Assume Host B has no data to send Host A. Host B will not send acknowledgments to Host A because Host B cannot piggyback the acknowledgments ... 4 bytes of data over a TCP connection to Host B. In this same segment the acknowledgment number is necessarily 42.
True or false?Host A is sending Host B a large file over a TCP connection. Assume Host B has no data to send Host A. Host B will not send acknowledgments to Host A becaus...
6.6k
views
answered
May 25, 2019
Computer Networks
computer-networks
kurose-and-ross
transport-layer
tcp
descriptive
+
–
7
votes
10
Kurose and Ross Edition 6 Exercise 3 Question R15 (Page No 287)
Suppose Host A sends two TCP segments back to back to Host B over a TCP connection. The first segment has sequence number 90; the second has sequence number 110. How much data is in the first segment? Suppose that the ... segment arrives at B. In the acknowledgment that Host B sends to Host A, what will be the acknowledgment number?
Suppose Host A sends two TCP segments back to back to Host B over a TCP connection. The first segment has sequence number 90; the second has sequence number 110.How much ...
16.3k
views
answered
May 25, 2019
Computer Networks
computer-networks
kurose-and-ross
transport-layer
tcp
descriptive
+
–
1
votes
11
Kurose and Ross Edition 6 Exercise 3 Question R18 (Page No 288)
True or false? Consider congestion control in TCP. When the timer expires at the sender, the value of ssthresh is set to one half of its previous value.
True or false? Consider congestion control in TCP. When the timer expires at the sender, the value of ssthresh is set to one half of its previous value.
1.7k
views
answered
May 25, 2019
Computer Networks
computer-networks
kurose-and-ross
transport-layer
congestion-control
descriptive
tcp
+
–
2
votes
12
Fragmentation of packet
Which of the following statements are True ?
Which of the following statements are True ?
1.4k
views
answered
May 23, 2019
Computer Networks
computer-networks
fragmentation
routing
ip-packet
+
–
0
votes
13
Andrew S. Tanenbaum Edition 5 Exercise 4 Question 3 (Page No. 351)
Consider the delay of pure ALOHA versus slotted ALOHA at low load. Which one is less? Explain your answer.
Consider the delay of pure ALOHA versus slotted ALOHA at low load. Which one isless? Explain your answer.
5.6k
views
answered
May 21, 2019
Computer Networks
computer-networks
tanenbaum
mac-protocol
pure-aloha
slotted-aloha
+
–
6
votes
14
Kurose and Ross Edition 6 Exercise 1 Question R25 (Page No 70)
Which layers in the Internet protocol stack does a router process? Which layers does a link-layer switch process? Which layers do a host process?
Which layers in the Internet protocol stack does a router process? Which layers does a link-layer switch process? Which layers do a host process?
4.4k
views
answered
May 18, 2019
Computer Networks
computer-networks
kurose-and-ross
network-layering
descriptive
+
–
4
votes
15
ISI2019-MMA-22
A coin with probability $p (0 < p < 1)$ of getting head, is tossed until a head appears for the first time. If the probability that the number of tosses required is even is $2/5$, then the value of $p$ is $2/7$ $1/3$ $5/7$ $2/3$
A coin with probability $p (0 < p < 1)$ of getting head, is tossed until a head appears for the first time. If the probability that the number of tosses required is even ...
873
views
answered
May 16, 2019
Probability
isi2019-mma
probability
+
–
3
votes
16
Ace Test Series: Probability - Uniform Distribution
908
views
answered
May 15, 2019
Probability
random-variable
probability
expectation
uniform-distribution
ace-test-series
+
–
0
votes
17
Self Doubt
Please explain me the difference between the following questions and their answers. All seems similar to me with different answers. https://gateoverflow.in/2048/gate2014-3-14 https://gateoverflow.in/1830/gate2006-52 https://gateoverflow.in/25209/tifr2012-b-14
Please explain me the difference between the following questions and their answers. All seems similar to me with different answers.https://gateoverflow.in/2048/gate2014-3...
304
views
answered
Apr 30, 2019
Algorithms
algorithms
sorting
+
–
3
votes
18
Programming in C : what is the value of x?
int x=0,i; for(i=0;i<10;i++) if(i%2 && x++) x+=2; Options: a: 11 b:13 c:15 d:17
int x=0,i; for(i=0;i<10;i++) if(i%2 && x++) x+=2;Options:a: 11b:13c:15d:17
3.0k
views
answered
Mar 9, 2019
0
votes
19
MadeEasy Workbook: Digital Logic - Shift Registers
a 4 bit serial in parallel out shift register is used with a feedback as shown in figure below the shifting sequences q3 - >q2-> q1- > q0. if the output is initially 0000, the no of clock pulses after which t the output will repeat itself is
a 4 bit serial in parallel out shift register is used with a feedback as shown in figure below the shifting sequences q3 - >q2- q1- q0. if the output is initially 0000, ...
1.9k
views
answered
Mar 8, 2019
Digital Logic
digital-logic
shift-registers
made-easy-booklet
+
–
2
votes
20
Digital Logic madeeasy
The frequency of the clock signal applied to the rising edge triggered D flip-flop shown in figure is 10 kHz. The frequency of the signal available at Q is? 5 Khz 10 Khz 1 Khz 0.5 Khz
The frequency of the clock signal applied to the rising edge triggered D flip-flop shown in figure is 10 kHz. The frequency of the signal available at Q is? 5 Khz10 Khz1 ...
4.4k
views
answered
Jan 24, 2019
Digital Logic
digital-logic
flip-flop
sequential-circuit
+
–
0
votes
21
GATE-ECE-2017
answer is D but I'm getting A. pls tell where am I going wrong?
answer is D but I'm getting A. pls tell where am I going wrong?
620
views
answered
Jan 24, 2019
Digital Logic
digital-logic
sequential-circuit
flip-flop
digital-counter
finite-automata
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register