Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Spider1896
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Spider1896
0
votes
1
GATE CSE 2002 | Question: 2.10
Consider the following algorithm for searching for a given number $x$ in an unsorted array $A[1..n]$ having $n$ distinct values: Choose an $i$ at random from $1..n$ If $A[i] = x$, then Stop else Goto 1; Assuming that $x$ is present in $A$, what is the expected number of comparisons made by the algorithm before it terminates? $n$ $n-1$ $2n$ $\frac{n}{2}$
Consider the following algorithm for searching for a given number $x$ in an unsorted array $A[1..n]$ having $n$ distinct values:Choose an $i$ at random from $1..n$If $A[i...
22.0k
views
answered
Oct 16, 2018
Algorithms
gatecse-2002
searching
normal
+
–
0
votes
2
MadeEasy Test Series: Computer Networks - Congestion Control
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 1 MSS and the threshold at the start is 1st transmission is 16 MSS. Assume TCP use over a lossy link i.e. ... is the congestion window size at the end of 14 RTT (in MSS)? A) 9 B) 11 C) 12 D) 14
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD)algorithm where the window size at the start of slow start phase is 1 MSS and thethreshold...
794
views
answered
Oct 6, 2018
Computer Networks
computer-networks
congestion-control
made-easy-test-series
+
–
0
votes
3
GATE IT 2004 | Question: 63
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let $P_h$ ... but starvation-free The scheme is neither deadlock-free nor starvation-free The scheme is both deadlock-free and starvation-free
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same ti...
13.3k
views
answered
Oct 2, 2018
Operating System
gateit-2004
operating-system
normal
deadlock-prevention-avoidance-detection
+
–
0
votes
4
self doubt
Consider a system where the page fault service time is 200 ms and the main memory access time is 10 ms. The TLB is added to improve the performance. 80% references are found in the TLB and that of remaining 10 % cause page faults. The TLB access time is 20ms and page table access time is 30mS. What is Effective Memory Access Time? i m getting 40 ms ....is it correct?? or 38.8??
Consider a system where the page fault service time is 200 ms and the main memory access time is 10 ms. The TLB is added to improve the performance. 80% references are fo...
404
views
answered
Aug 29, 2018
0
votes
5
DIGITAL CIRCUIT
The product term to be included to remove possible static hazard for the function WX + W’Y’ is a. WY’ b. XY’ c. W’X’ d. XY
The product term to be included to remove possible static hazard for the function WX + W’Y’ is a. WY’ b. XY’ c. W’X’ d. XY
1.2k
views
answered
Aug 24, 2018
0
votes
6
kurose
difference between point to point and peer to peer ???
difference between point to point and peer to peer ???
353
views
answered
Aug 22, 2018
Computer Networks
computer-networks
reference-book
+
–
0
votes
7
Do we need to study call by name, call by need parameter passing techniques for Gate Cs 2019??
560
views
answered
Aug 21, 2018
1
votes
8
SELF DOUBT TOC MOORE TO MEALY CONVERSION
GIVEN A MOOORE MACHINE WITH N STATES THE CORRESPONDING EQUIVALENT MEALY MACHINE HAS MAXIMUM OF N STATES ............ I THINK IT SHOULD BE FALSE BECZ SAYING MAXIMUM N STATES IS WRONG BECZ THERE IS NO CHANGE IN STATES WHILE CONVERTING MOORE TO MEALY.?? BUT IS GIVEN AS TRUE ...PLEASE CHECK??
GIVEN A MOOORE MACHINE WITH N STATES THE CORRESPONDING EQUIVALENT MEALY MACHINE HAS MAXIMUM OF N STATES ............I THINK IT SHOULD BE FALSE BECZ SAYING MAXIMUM N STAT...
1.6k
views
answered
Aug 21, 2018
0
votes
9
Madeeasy_SubjectTest_OperatingSystem
726
views
answered
Aug 20, 2018
0
votes
10
SELF DOUBT REDUCTION
IF P1 IS REDUCIBLE TO P2 AND P1 IS RECURSIVE ENUMERABLE THEN P2 NEED NOT BE RECURSIVE ENUMERABLE ???IS IS TRUE ??WHAT I AM THINKING IS THAT P1 IS UNDECIABLE SO P2 WILL ALSO BE UNDECIABLE HENCE SHOULD BE RECURSIVE ENUMERABLE...
IF P1 IS REDUCIBLE TO P2 AND P1 IS RECURSIVE ENUMERABLE THEN P2 NEED NOT BE RECURSIVE ENUMERABLE ???IS IS TRUE ??WHAT I AM THINKING IS THAT P1 IS UNDECIABLE SO P2 WILL AL...
980
views
answered
Aug 17, 2018
1
votes
11
Doubt in networking
What is the difference between host to host network connection and end to end network connection? Why host to host connection for network layer and end to end connection for transport layer?
What is the difference between host to host network connection and end to end network connection? Why host to host connection for network layer and end to end connect...
985
views
answered
Aug 12, 2018
Computer Networks
computer-networks
osi-model
+
–
0
votes
12
Doubt in networking
Except reliability and connection oriented what are the other functionalities which are produced by TCP but not by UDP?
Except reliability and connection oriented what are the other functionalities which are produced by TCP but not by UDP?
381
views
answered
Aug 11, 2018
Computer Networks
computer-networks
osi-model
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register