Answer:
Following are the program in the C++ Programming Language:
#include <iostream>//header file
using namespace std;//namespane
//set main method
int main() {
int a[100]; //set integer type array variable
int value, i = 0; //set integer variables
cout<<"Enter less than 0 to exit:"<<endl; //message for exit
cout<<"Enter the integer numbers:"<<endl; //message to enter numbers
do{ //set do while
cin>>value; //get input from the user
a[i++] = value; //append elements in array
}while(value>=0);
i--;
cout<<"\nArray are:"<<endl;//message for array
for(int k = 0;k<i;k++){ //set for loop
cout<<a[k]<<" "; //print array
}
return 0;
}
<u>Output</u>:
Enter less than 0 to exit:
Enter the integer numbers:
1
2
3
4
5
-1
Array are:
1 2 3 4 5
Explanation:
Here, we set the integer data type main method "main()" and inside it:
- we set integer type array variable with index value 100.
- we set two integer type variable "value" and "i" initialize value 0.
- we set the do-while loop in which we get the input from the user and and append in the array and pass condition if the value is greater then equal to 0.
- Finally, set for loop and print the elements of an array.
Answer:
A. Motherboard has failed.
C. Processor has gone bad or is not seated properly.
Explanation:
The computer system is a digital or electronic device, which comprises of an input device, output device, memory and storage device and a processor, all controlled by a software interface known as the operating system.
The hardware and software components are all integrated on a printed board known as a motherboard.
When the motherboard is faulty, the system looses it functionality and the screen stays off but the power supply indicator light stays on. This is also the same for the processor.
A formula in Excel will ALWAYS start with = then the function name like
=SUM(A1:A5)
L is a decidable language because the Turing machine accepts it.
L is a recognizable language if TM M recognizes it.
<h3>How do you know if a language is decidable?</h3>
A language is said to be decidable only when there seems to exists a Turing machine that is said to accepts it,
Here, it tends to halts on all inputs, and then it answers "Yes" on words that is seen in the language and says "No" on words that are not found in the language. The same scenario applies to recognizable language.
So, L is a decidable language because the Turing machine accepts it.
L is a recognizable language if TM M recognizes it.
Learn more about programming language from
brainly.com/question/16936315
#SPJ1
