Answer:
D. Software Problem
Explanation:
It could be that the software is bootlooping which will power on and off until its fixed.
Answer:
/*
Find Largest and Smallest Number in an Array Example
This Java Example shows how to find largest and smallest number in an
array.
*/
public class FindLargestSmallestNumber {
public static void main(String[] args) {
//array of 10 numbers
int numbers[] = new int[]{32,43,53,54,32,65,63,98,43,23};
//assign first element of an array to largest and smallest
int smallest = numbers[0];
int largetst = numbers[0];
for(int i=1; i< numbers.length; i++)
{
if(numbers[i] > largetst)
largetst = numbers[i];
else if (numbers[i] < smallest)
smallest = numbers[i];
}
System.out.println("Largest Number is : " + largetst);
System.out.println("Smallest Number is : " + smallest);
}
}
/*
Output of this program would be
Largest Number is : 98
Smallest Number is : 23
*/
Explanation:
inside a function or a block which is called local variables
Answer:
#include <iostream>
#include <string>
#include <stack>
#include <math.h>
using namespace std;
int main() {
string s;
double n=0;
int position=0;
stack<int> wholeNumbers;
cout<<"Enter a decimal number:";
cin>>s;
string::iterator counter = s.begin();
while(*counter!='.' && counter!=s.end()){
wholeNumbers.push(*counter-48);
counter++;
position=position+1;
}
for(int i=0;i<position;i++){
n=n+(wholeNumbers.top()*pow(10,i));
wholeNumbers.pop();
}
position=-1;
if(counter!=s.end()){
counter++;
}
while(counter!=s.end()){
n=n+((*counter-48)*pow(10,position));
position=position-1;
counter++;
}
cout<<n;
}
Explanation:
- Inside the while loop, push the push a number to the wholeNumbers stack by subtracting it with 48.
- Increment the counter and position variable by 1 inside the while loop.
- Count the number of digit, push each digit to top of stack and find the end of the number,
- Run a for loop up to the value of position variable and pop a value from the wholeNumbers stack.
