Answer:
job search
Explanation:
job search bc you can look for jobs that are avalible online.
The answer is B.
<span> desktop publishing program must be able to take text and graphics from a number of sources and allow these elements to be arranged on a page.
The main purpose of a destkop publishing program is to aid user in creating documents using its page layout so it could generate printable media with higher quality compared to the one that is handmade.</span>
Answer:
Option A is the correct answer for the above question.
Explanation:
A Victim is a person, who faces the problem of a criminal person. Here in the question, the scenario is that a user is a victim of the identity of being theft by some other person. So the user can get known by the help of option a, which suggests that the user's credit card report display something which is not done by him then it can be the scenario, where the user can understand that he is a victim. hence option a is the correct answer where the other option is not because--
- Option B suggests the user does not pay the bill on time but it is a general case because the bill is paid by the user is in every month not a single time.
- Option C suggests both options (A and B) are correct, but option b is not the correct.
- Option D suggests that no option is valid from the above but option A is the correct.
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.
