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
Questions by LavTheRawkstar
0
votes
2
answers
81
If Go back N protocol is used with a window size of 4 and the ACK for apcket 2 gets lost.
If Go back N protocol is used with a window size of 4 and the ACK for packet 2 gets lost. Now how to show that the events untill packet 2 is acknowledged at the sender side ?
If Go back N protocol is used with a window size of 4 and the ACK for packet 2 gets lost.Now how to show that the events untill packet 2 is acknowledged at the sender sid...
3.2k
views
asked
Apr 4, 2017
Computer Networks
computer-networks
+
–
0
votes
2
answers
82
The difference between connection oriented and connection less services is
The difference between connection oriented and connection less services is ??????
The difference between connection oriented and connection less services is ??????
1.4k
views
asked
Apr 4, 2017
Computer Networks
computer-networks
+
–
0
votes
1
answer
83
Suppose the spectrum of a channel is between 5 Mhz and 6 MHz.If the Signal to Noise ratio is found
Suppose the spectrum of a channel is between 5 Mhz and 6 MHz.If the Signal to Noise ratio is found to be 24 Db , find maximum channel capacity . Also find maximum number of signal levels in transmitted signal?
Suppose the spectrum of a channel is between 5 Mhz and 6 MHz.If the Signal to Noise ratio is found to be 24 Db , find maximum channel capacity .Also find maximum number o...
10.0k
views
asked
Apr 4, 2017
Computer Networks
computer-networks
+
–
3
votes
1
answer
84
Leaky Bucket Algorithm only allows just one packet per ticket irrespective of packet size
Leaky Bucket Algorithm only allows just one packet per ticket irrespective of packet size.Why ???
Leaky Bucket Algorithm only allows just one packet per ticket irrespective of packet size.Why ???
2.8k
views
asked
Apr 4, 2017
Computer Networks
computer-networks
leaky-bucket
+
–
1
votes
1
answer
85
The count to infinity problem is solved using Split Horizontal method.Its limitations are ___
How the count to infinity problem is solved using Split Horizontal method please tell ?? what are limitations in this ?
How the count to infinity problem is solved using Split Horizontal method please tell ?? what are limitations in this ?
15.5k
views
asked
Apr 4, 2017
Computer Networks
computer-networks
+
–
0
votes
1
answer
86
Domain Name System is used for _____
Why DNS is used? What are the main 3 divisons of Domain Name System ?
Why DNS is used?What are the main 3 divisons of Domain Name System ?
1.4k
views
asked
Apr 4, 2017
Computer Networks
computer-networks
+
–
0
votes
1
answer
87
The congestion central takes place by using Choke Packet and Load Shedding?
Can any one please explain how the congestion central takes place using Choke packet and load Shedding? Congestion means in simple words traffic generated by the messages from various nodes. Now please anyone tell ... congestion control takes place using choke packet and load shedding?what is this chocke and load shedding ?
Can any one please explain how the congestion central takes place using Choke packet and load Shedding?Congestion means in simple words traffic generated by the messages ...
730
views
asked
Apr 4, 2017
Computer Networks
computer-networks
+
–
0
votes
2
answers
88
The difference between BOOTP and DHCP is __________
What is the difference between BOOTP and DHCP ?
What is the difference between BOOTP and DHCP ?
512
views
asked
Apr 4, 2017
Computer Networks
computer-networks
+
–
0
votes
3
answers
89
Solve the following Recurrence using any method
T(n) = 2n T $(\frac{n}{2})$ + nn
T(n) = 2n T $(\frac{n}{2})$ + nn
1.1k
views
asked
Mar 27, 2017
Algorithms
algorithms
time-complexity
asymptotic-notation
recurrence-relation
+
–
1
votes
1
answer
90
Solve the following recurrence using any method
T(n)=T $(\frac{n}{2})$ + T $(\frac{n}{4})$ + n2
T(n)=T $(\frac{n}{2})$ + T $(\frac{n}{4})$ + n2
541
views
asked
Mar 27, 2017
Algorithms
algorithms
time-complexity
asymptotic-notation
recurrence-relation
+
–
0
votes
3
answers
91
Solve the Recurrence using any method which can solve it quickly in less steps
Solve the Recurrence using any method T(n)=2 T ($\frac{n}{4}$ ) - n2
Solve the Recurrence using any methodT(n)=2 T ($\frac{n}{4}$ ) - n2
564
views
asked
Mar 27, 2017
Algorithms
algorithms
recurrence-relation
+
–
0
votes
2
answers
92
having confusion in P ,Np,NP hard and Np completness
what i have tried to get out the conslusion for P problem is that P problem These are set of those yes/no problems which can solved using polynomic time complexity algroithms. For example if are asked to Compare or sort then numbers.Then using loop we ... .hence this Np problem is now P problem Am i correct with these two terms ????????????????
what i have tried to get out the conslusion for P problem is that P problemThese are set of those yes/no problems which can solved using polynomic time complexity algroi...
2.3k
views
asked
Mar 26, 2017
Algorithms
p-np-npc-nph
+
–
0
votes
0
answers
93
Calculate the shortest path using TSP Greedy Appraoch
Calculate the shortest path using TSP Greedy Appraoch
Calculate the shortest path using TSP Greedy Appraoch
423
views
asked
Mar 26, 2017
Algorithms
algorithms
shortest-path
+
–
1
votes
1
answer
94
#Confusion Is it necessary to arrange the weights in Ascending order while solving 0/1 Knapsack problem using Dynamic
Number of Cateogires are 5, Thier total weights are w1,w2,w3,w4,w5={7,2,4,8,6}b1,b2,b3,b4,b5={5,6,4,3,2}M=6=Maximum Capacity= WI am having confusion How to solve using dy...
2.6k
views
asked
Mar 25, 2017
Algorithms
knapsack-problem
algorithms
+
–
1
votes
1
answer
95
An ISP is granted a block of addresses starting with 195.200.0.0/16 (65,536 addresses).
An ISP is granted a block of addresses starting with 195.200.0.0/16 (65,536 addresses). The ISP needs to distribute these addresses to three groups of customers as follows: a. The first group has 64 ... has 128 customers; each needs 64 addresses. c. The third group has 128 customers; each needs 32 addresses.
An ISP is granted a block of addresses starting with 195.200.0.0/16 (65,536 addresses). The ISP needs to distribute these addresses to three groups of customers as follow...
10.9k
views
asked
Mar 22, 2017
Computer Networks
computer-networks
+
–
0
votes
1
answer
96
Needham Schroeder and Millicent
What is this Needham Schroeder and what is this Millicent ?
What is this Needham Schroeder and what is this Millicent ?
1.0k
views
asked
Mar 18, 2017
Computer Networks
computer-networks
+
–
0
votes
1
answer
97
what is Kerberos?
somebody please tell what is this Kerberos ?
somebody please tell what is this Kerberos ?
592
views
asked
Mar 17, 2017
1
votes
1
answer
98
Pessimistic time stamp ordering vs optimistic time stamp ordering
What is the difference between Pessimistic time stamp ordering and optimistic time stamp ordering.
What is the difference between Pessimistic time stamp ordering and optimistic time stamp ordering.
2.5k
views
asked
Mar 17, 2017
Databases
databases
transaction-and-concurrency
+
–
0
votes
1
answer
99
Multiversion Timestamp ordering vs time stamp ordering
What is the advantage and drawback of Multiversion Timestamp ordering in comparison with ordering Time stamp ordering? anyone please also explain what is this multiversion Timestamp ordering and what is the Timestamp ordering in simple words please?
What is the advantage and drawback of Multiversion Timestamp ordering in comparison with ordering Time stamp ordering? anyone please also explain what is this multiversio...
1.9k
views
asked
Mar 17, 2017
Databases
databases
transaction-and-concurrency
+
–
0
votes
0
answers
100
Doubt in two phase Commit Protocol
In two phase Commit Protocol,why can blocking be completely eliminated even when participants elect a new Coordinator ?
In two phase Commit Protocol,why can blocking be completely eliminated even when participants elect a new Coordinator ?
562
views
asked
Mar 17, 2017
Databases
databases
transaction-and-concurrency
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
...
14
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register