Answer:
Boolean
Explanation:
Boolean is one of the primitive data types that will only hold either true or false value. This data type is commonly used in a variable that will track a status with only two possible outcomes.
For example, the<em> ParticipantPD</em> field is to track the payment status (paid or unpaid) of a participant. So, declare the<em> ParticipantPD</em> field as boolean data type will meet its purpose.
boolean ParticipantPD = true;
or
boolean ParticipantPD = false;
Answer:
B
Explanation:
the software needs to share thus should be networked
In the block <span>letter style, all components of the letter begin flush with the left margin.</span>
Answer:
No you can not tell that recursion is ever required to solve a problem.
Recursion is required when in the problem, the solution of the input depends on the solution of the subsets of the input.
Iteration is also another form of repetitive approach we follow to solve that kind of problems.
But the difference between recursion and iteration is :
- In recursion we call the function repeatedly to return the result to next level.
- In iteration certain bunch of instructions in a loop are executed until certain conditions met.
Explanation:
For example in the Fibonacci sequence problem, to find
, we need to compute
and
before that.
- In case of recursion we just call the method Fibonacci(n) repeatedly only changing the parameter Fibonacci(n-1), that calculates the value and return it.
Fibonacci(n)
1. if(n==0 or n==1)
2. return 1.
3.else
4. return( Fibonacci(n-1)+Fibonacci(n-1) )
- But in case of iteration we run a loop for i=2 to n, within which we add the value of current
and
to find the value of 
Fibonacci(n)
1. if(n<=2)
2. result = 1
3. else
4. result1 =1 and result2=1.
5. { result = result1 +result2.
6. result1= result2.
7. result2 = result.
8. }
9. output result.
Answer:
Zebra.
Explanation:
Stack is LIFO, so Zebra is added in the last so it will be removed first.