Answer:
Top/bottom conditional formatting
Explanation:
The top/bottom conditional formatting automatically carries out the task of finding the highest, lowest and even average values.
Conditional formatting formatting gives one the opportunity to enhance reports and dashboards as they work on excel.
You use the too/bottom formatting to highlight cells whose values of highest in a dataset and lowest in a dataset
Answer:
import random
decisions = int(input("How many decisions: "))
for i in range(decisions):
number = random.randint(0, 1)
if number == 0:
print("heads")
else:
print("tails")
Explanation:
*The code is in Python.
import the random to be able to generate random numbers
Ask the user to enter the number of decisions
Create a for loop that iterates number of decisions times. For each round; generate a number between 0 and 1 using the randint() method. Check the number. If it is equal to 0, print "heads". Otherwise, print "tails"
Answer:
command line and graphical user interface
Explanation:
there were (and still are) operating system with no graphical user interface at all, as for example some Unix releases
Answer:
CPU need 50% much faster
disk need 100% much faster
Explanation:
given data
workload spend time CPU = 60%
workload spend time I/O = 40%
achieve overall system speedup = 25%
to find out
How much faster does CPU need and How much faster does the disk need
solution
we apply here Amdahl’s law for the overall speed of a computer that is express as
S = 
.............................1
here f is fraction of work i.e 0.6 and S is overall speed i.e 100% + 25% = 125 % and k is speed up of component
so put all value in equation 1 we get
S =
1.25 = 
solve we get
k = 1.5
so we can say CPU need 50% much faster
and
when f = 0.4 and S = 125 %
put the value in equation 1
S =
1.25 = 
solve we get
k = 2
so here disk need 100% much faster
Answer:
Pseudocode is as follows:
// below is a function that takes two parameters:1. An array of items 2. An integer for weight W
// it returns an array of selected items which satisfy the given condition of sum <= max sum.
function findSubset( array items[], integer W)
{
initialize:
maxSum = 0;
ansArray = [];
// take each "item" from array to create all possible combinations of arrays by comparing with "W" and // "maxSum"
start the loop:
// include item in the ansArray[]
ansArray.push(item);
// remove the item from the items[]
items.pop(item);
ansArray.push(item1);
start the while loop(sum(ansArray[]) <= W):
// exclude the element already included and start including till
if (sum(ansArray[]) > maxSum)
// if true then include item in ansArray[]
ansArray.push(item);
// update the maxSum
maxSum = sum(ansArray[items]);
else
// move to next element
continue;
end the loop;
// again make the item[] same by pushing the popped element
items.push(item);
end the loop;
return the ansArray[]
}
Explanation:
You can find example to implement the algorithm.
