I have a problem to solve that takes n as an input number. The problem has a property that given the solution for (n-1), I can easily solve the problem for n. Which programming technique will I use to solve such a problem ?

A. Iteration

B. Decision-making

C. Object Oriented Programming

D. Recursion

Answer : D. Recursion

Explanation

Recursion(the repeated application of a recursive procedure) solve the problem has a property that given the solution for (n-1).

Categorized in:

Programming

Tagged in:

AMCAT Question Papers with Answers, basic programming interview questions, basic programming questions, c programming basic questions and answers, c programming interview questions, c programming questions and answers, C++ Programming Questions, computer programming questions, how to practice programming, object oriented programming interview questions, programming interview, programming interview questions, programming interview questions and answers, programming interview questions and answers for experienced, programming interview questions and answers for freshers, programming interviews exposed, programming mcq questions with answers, programming practice, programming practice questions, programming problems, programming questions, programming quiz, programming tests for interviews, programming topics

Leave a Reply

Other Stories

G

Given : integer x = 40, y = 35, z = 20, w = 10. Comment about the output of the following two statements ? print x * y / z – w print x * y / (z – w)

Next Story

W

What will the output of the following code statements be ? Integer x = 34.54, y = 20, z = -5 print (y > 50 AND z > 10 or x > 30)

Previous Story

Ads Blocker Detected!!!

We have detected that you are using extensions to block ads. Please support us by disabling these ads blocker.

Refresh

Powered By

Ads Blocker Detected!!!

We have detected that you are using extensions to block ads. Please support us by disabling these ads blocker.

Refresh

Powered By