Answer:
Explanation:
Traffic Shaping is a technique for managing congestion on a network by delaying the flow of less important/desired packets on the network so more valuable/desirables ones are able to pass. Traffic shaping reduces traffic by preventing certain undesirable traffic from entering the network as well as limiting the amount of certain undesirable traffic entering the network.
Must have
Understand
Today for
Urgent
Answer
List it too
It's not hard
So listen to
Me
Answer:
The answer to this question is given below in the explanation section.
Explanation:
In this given program there are two errors, first in line number 2 that stores a string value, not int. The second error is at line 6, a symbol "*" represents multiplication, not addition.
To solve these errors, in line #2, convert the input to an int variable value 1. To add the values of variables (value1 and value2), use the plus symbol "+" in the print statement at line #6.
The correct program is given below:
<em>value1= int(input("Enter first number: "))</em>
#get second number and store it into value2 variable.
<em>value2= int(input("Enter second number: "))</em>
#add the values store in variables (value1 and value2) and then print
<em>print (value1 + value2)</em>
It uses boolean operators and key words to match the correct web pages to the search request.
Answer:
C. O(n).
Explanation:
for better understanding, the os is a program that helps in telling how much resources can be used and when processor can be accessed.
to each programme data structures would load and unload every time that a programme is to be run.
while a programme is being managed there would be extra overheads and based on whatever type of os or programme that this is, it may or may not have fixed overhead
from our question overhead is fixed at 100ms
we have,
net time as: 300-100, 510-100, 905-100, 1750-100, 3305-100,
which is, 200, 410, 805, 1650, 3205
when we double 2¹⁰ to 2¹¹ to 2¹² etc, the programme ran is also doubling
this says that run time is same as size of instance n
O(n)
