Answer:
a) Speedup gain is 1.428 times.
b) Speedup gain is 1.81 times.
Explanation:
in order to calculate the speedup again of an application that has a 60 percent parallel component using Anklahls Law is speedup which state that:
Where S is the portion of the application that must be performed serially, and N is the number of processing cores.
(a) For N = 2 processing cores, and a 60%, then S = 40% or 0.4
Thus, the speedup is:
Speedup gain is 1.428 times.
(b) For N = 4 processing cores and a 60%, then S = 40% or 0.4
Thus, the speedup is:
Speedup gain is 1.81 times.
Answer: The computer does not meet minimum requirements of the software program because too much energy gets put in it
Explanation:
Good luck
Answer:
count_land = count_air = count_water = 0
while True:
s = input("Enter a string: ")
if s == "xxxxx":
break
else:
if s == "land":
count_land += 1
elif s == "air":
count_air += 1
elif s == "water":
count_water += 1
print("land: " + str(count_land))
print("air: " + str(count_air))
print("water: " + str(count_water))
Explanation:
*The code is in Python
Initialize the variables
Create a while loop that iterates until a specific condition is met. Inside the loop, ask the user to enter the string. If it is "xxxxx", stop the loop. Otherwise, check if it is "land", "air", or "water". If it is one of the given strings, increment its counter by 1
When the loop is done, print the number of strings entered in the required format
Answer:
Logical Expressions
Explanation:
The expressions that have logical statements which could be "true or false" are known as logical expressions. These types of expressions are also known as Boolean Expressions.
These expression are used in computer programming. The purpose of these expressions in programming is to make a decision that could be based on different conditions. These conditions could be true or false. This is the main reason that. logical expression makes best sense for values received in true or false.
<span>Truth tables are diagrams used in mathematics and logic to help describe the truth of an entire expression based on the truth of its parts.
A truth table shows all the possible combinations (outputs) that can be produced from the given inputs. They are mainly used in Boolean algebra.</span>