Answer:
Because he is the man who found the concept on input process and output theory.
Explanation:
check this website and follow their courses https://www.eacademy.lk/2019/06/internet-and-www-course.html
It's Free
Answer:
shows the costumer or buyer how the product looks
Answer:
The debugged program is as follows:
A=2
B=2
For I=1 to 10
PRINT A
TEMP = A
A=B
B=TEMP+A
NEXT I
END
Explanation:
First, the value of B should be changed to 4 (because the second term of the sequence is 2
Next, change Display to Print because Q-basic uses the print keyword to display output
The sequence is not properly generated. So, I update that part of the program to:
<em>For I=1 to 10
</em>
<em>PRINT A
</em>
<em>TEMP = A
</em>
<em>A=B
</em>
<em>B=TEMP+A
</em>
<em>NEXT I
</em>
<em />
Lastly, the loop is controlled by variable I (not X).
So change NEXT X to NEXT I
Answer:
There is only one modification in the above loop i.e. while loop should be like this--
while (i != n)
{
sum+=arr[i]; // Line 1, In question segment it is line 2.
i++; // Line 2, In question segment it is line 1.
}
Output:
Now if the array input is 1,2,3,4,5 then the output is 15.
Explanation:
In the above question, all the line of the segment is right except the body of the loop because--
- The First line of the loop is increment statement which increments the value of "i" variable from 1 and the value of "i" variable will be 1 in the first iteration of the loop
- The second line starts to add the value from 1'st index position of the array. Hence the segment gives the wrong answer. It adds the arr[1] to arr[n-1].
- So I interchanged both lines of the while loop as shown in the answer part. I make the line 1 (In question segment) as line 2(In answer part) and line 2 (In question segment) as line 1 (In answer part).
Now It gives the correct output because it can add arr[0] to arr[n-1].
Experiments. ...
Surveys. ...
Questionnaires. ...
Interviews. ...
Case studies. ...
Participant and non-participant observation. ...
Observational trials. ...
Studies using the Delphi method.
