Answer:
You have very little or limited amounts of an item(s).
Explanation:
Answer:
input number
calculate modulus of the number and 5
compare outcome to 0
if 0 then output "divisible by 5"
else output "not divisible by 5"
Explanation:
The modulo operator is key here. It returns the remainder after integer division. So 8 mod 5 for example is 3, since 5x1+3 = 8. Only if the outcome is 0, you know the number you divided is a multiple of 5.
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:
The solution or expression for each part is given below:
- int(s)
- s[len(s)-1]
- last.capitalize()+','+first.capitalize()
- str(x)
- s[5:]
Explanation:
Following are attached the images that show how these expressions will be used. I hope they will make the concept clear.
All the images below are respective to the questions given.
Answer:
n := length(A)
repeat
swapped := false
for i := 1 to n-1 inclusive do
<em> /* if this pair is out of order */</em>
if A[i-1] > A[i] then
<em> /* swap them and remember something changed */</em>
swap(A[i-1], A[i])
swapped := true
end if ⇒
end for
until not swapped
end procedure
Explanation:
This is pseudocode
