Answer:
A wand tool is to do that in an editing software.
Answer:
The solution is written using Python as it has a simple syntax.
- def getHighScores(gameScores, minScore):
- meetsThreshold = []
- for score in gameScores:
- if(score > minScore):
- meetsThreshold.append(score)
- return meetsThreshold
- gameScores = [2, 5, 7, 6, 1, 9, 1]
- minScore = 5
- highScores = getHighScores(gameScores, minScore)
- print(highScores)
Explanation:
Line 1-8
- Create a function and name it as <em>getHighScores</em> which accepts two values, <em>gameScores</em> and <em>minScore</em>. (Line 1)
- Create an empty list/array and assign it to variable <em>meetsThreshold</em>. (Line 2)
- Create a for loop to iterate through each of the score in the <em>gameScores</em> (Line 4)
- Set a condition if the current score is bigger than the <em>minScore</em>, add the score into the <em>meetsThreshold</em> list (Line 5-6)
- Return <em>meetsThreshold</em> list as the output
Line 11-12
- create a random list of <em>gameScores</em> (Line 11)
- Set the minimum score to 5 (Line 12)
Line 13-14
- Call the function <em>getHighScores()</em> and pass the<em> gameScores</em> and <em>minScore </em>as the arguments. The codes within the function <em>getHighScores()</em> will run and return the <em>meetsThreshold </em>list and assign it to <em>highScores.</em> (Line 13)
- Display <em>highScores</em> using built-in function print().
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: the answer is c
Explanation:in general, the merges and splits in hierarchical clustering are determined in a greedy manner