Answer:
The difference between While loop and Do - While loop are explained below.
Explanation:
- While loop : It is a looping procedure in which the statements inside the while loop are executed depending on the condition outside the while before starting the loop.
- If the condition is true then the code inside loop is executed otherwise not.
- Do - While loop: It is a looping procedure in which the statements inside the loop get executed and then the condition at the end of the loop is checked.
- This means even the condition is fails the statements inside the loop are executed once.
- Do while loop name itself suggests that "do the while and then check the condition".
Answer:
The management dashboard is the visual and display the KPI ( Key performance indicator) and metrics for monitoring the specific process and department.
It is basically used for checking whether the organization achieve or meet its specific goals not as per the requirement of the particular department in the organization.
The main part of the management dashboard is that it provide the visibility and alignment in the particular organization so that it meets according to the requirements of the organization. The basic requirement in the organization are:
- Business user
- Organization needs
- Information technology (IT) needs
Answer: Rainforest
Explanation:
A rainforest is an area that typically has tall, green trees and also has a high amount of rainfall. Rainforest can be found in the wet tropical uplands and lowlands. The largest rainforests can be seen in the Amazon River Basin.
Since the area visited by Nina has a large amount of precipitation during all twelve months, typically warm year round and has a large variety of organism diversity, then the biome thatcNina most likely visited is the rainforest.
Answer:
The function in C++ is as follows:
int isSorted(int ar[], int n){
if (
|| 
){
return 1;}
if (![ar[n - 1]](https://tex.z-dn.net/?f=ar%5Bn%20-%201%5D)
< ![ar[n - 2]](https://tex.z-dn.net/?f=ar%5Bn%20-%202%5D)
){
return 0;}
return isSorted(ar, n - 1);}
Explanation:
This defines the function
int isSorted(int ar[], int n){
This represents the base case; n = 1 or 0 will return 1 (i.e. the array is sorted)
if ( || ){
return 1;}
This checks if the current element is less than the previous array element; If yes, the array is not sorted
if ( < ){
return 0;}
This calls the function, recursively
return isSorted(ar, n - 1);
}
