A program that repeatedly prompts a user for integer numbers :
biggest = none
smallest = none
while True:
input = raw_input(“Enter a number:”)
if(input == “done” break
try:
number = float(inp)
except ValueError:
print “Please enter only numbers”
else
if smallest is None:
smallest = number;
biggest = number;
elif number < smallest:
smallest = number
elif num > largest:
largest = number
Print “Greatest is “, biggest
Print “Smallest is”, smallest
In this program an input is obtained, if it is equal to the word “done”, then the program stops b printing greatest and smallest number in the given input.
If invalid inputs are given then user is prompted to enter valid number. Otherwise the value of smallest and greatest are calculated according to the input using if-else construct.
Answer:
The answer is (B) Maximum password age.
Explanation:
To prevent several changing of passwords by a user in a day, the maximum times a password can be rest within a day is normally set by the system administrator.
The setting ensures the password is returned to the current settings of the password on the system for the user and prevents unnecessary changing of passwords in a day by user.
Answer:
bland1 InDesign Blank2 typesetting
Explanation:
It's usually in C: drive.
<span>C:\$Recycle.Bin
</span>But if you have several drives, there are Recycle Bins each drive.
Answer:
The answer is "5.5 and 90.90%"
Explanation:
For point 1:
To calculate the speed from fast mode, its run time without enhancement should be worked out. Designers are aware of which two selves are implicated throughout the accelerated project planning: the empty (
) and the increased stages ().
Although not enhanced, this would take almost as long () and for the combine to give phase; even so, the increased phase would've been 10 times longer, as well as 
. Thus the corresponding total speed without enhancement is 
Its overall speed is:
For point 2:
We re-connect these figures in Amdahl's Law throughout order to identify how long it would take for both the initial implementation:
