Explanation:
just want points tbh but have a good day
<span>Before GUIs became popular, the command line interface (CLI) was the most commonly used.
</span>GUI stands for Graphical User Interface . Like its name says it is a graphical interface <span>that allows interaction with users through graphical icons and visual indicators , rather than through text-based interface.</span><span>
Command line interace (CLI) is text-based interface in which </span>the user <span>issues commands to the program in the form of successive lines of text.</span>
Answer:
Option e: The use of programmed decisions should be limited to noncritical situations.
Explanation:
A repetitive decision or routine that can be managed by developed business procedures or rules are known as programmed decisions. These kind of decisions are most often known for at certain points in a standard process, and are planned relying on recognized and easily identifiable terms. Programmed decisions generally do not demand much consideration or discussion, and can typically be automated to make certain consistency and save time for decision-makers.
So, the use of programmed decisions should not be limited to noncritical situations.
Answer:
Explanation:
A general idea is that you should repeat the simulation until the results converge. An easy but illustrative example of this is that we want to see if the R function rbinom is accurate in simulating a coin toss with a given probability. We will simulate one coin toss 10000 times, and plot the percentage of heads against the number of coin tosses:
set.seed(1)
n <- 10000
result <- NULL
percent <- NULL
for (i in 1:n) {
result[i] <- rbinom(1,1,0.5)
percent[i] <- sum(result)/i
}
plot(seq(1:10000),percent, type="l")
abline(0.5, 0, lty=2)
Answer:
def brute_force(array1, array2):
for item in array1:
for element in array 2:
if element == item:
print(f"{element} and {item} are a match")
Explanation:
A brute-force algorithm is a direct-to-solution algorithm that searches and compares variables. It is like trying to unlock a safe but not knowing its four-digit combination, brute-force starts from 0000 through 9999 to get a match.
The python program implements the algorithm using two nested for loops. The first loop iterates over array1 while the second, over array2. For every item in the first array, the program loops through the length of the second array. For every match, the items are printed on the screen.
