Answer:
Light text on a dark background
Explanation:
Microsoft PowerPoint is an application software in which the company ables to introduce themselves by making slides and presented to an audience in an easy and innovative way. In this, we can add pictures, sound, video by adding the different text, colors, backgrounds, etc
For memorable and professional presentations, the light text on a dark background is a best combination as it is easy to read and give the best view of the message you want to convey.
Answer:
Following are the answer for the given question
for(int i=1;i<=99;++i) // for loop
{
cout<<"EXAM"<<endl; // display the word EXAM
}
Explanation:
In this question we using for loop which is iterating 99 times and print the
word "EXAM " 99 times.
The variable i is initialized by 1 and check the condition if the condition in loop is true it will execute the loop and print "EXAM" .The loop will executed 99 times when the condition in loop is false then loop become terminated.
Following are the program in c++
#include<iostream>// header file
using namespace std;
int main() // main method
{
for(int i=1;i<=99;++i) // for loop
{
cout<<"EXAM"<<endl; // display the word EXAM
}
return 0;
}
Answer:
Answer:
def main():
num = int(input("Input a number to check for prime: "))
if num > 1:
for i in range(2,num):
if (num % i) == 0:
print("%d is not a prime number" % num)
break
else:
print("%d is a prime number" % num)
break
else:
print("%d is not a prime number" % num)
if __name__ == "__main__":
main()
Explanation:
Solution retrieved from programiz.com.
Note, this program uses the idea of the Sieve of Eratosthenes to validate the input number by using the modulo operator to determine primeness.
The program will output to the user if the number input is indeed prime or not.
Cheers.
Explanation:
Answer:
Sequential
Explanation:
Based on the information provided within the question it can be said that the search algorithm that is being described in this scenario is a Sequential algorithm. This is because sequential programming focuses on programming (or in this case searching for) a result by doing one step at a time as opposed to various functions running simultaneously.
