Computer Science > QUESTIONS & ANSWERS > programming test bank questions with accurate answers. updated 2021/2022 (All)
programming test bank questions with accurate answers. updated 2021/2022
Document Content and Description Below
I have a problem to solve which takes as input a number n. 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 Ans: d Recursion means calling again and again. Therefore problem n can be solved with the solution n-1, by repeatedly calling it. 2) The memory space needed by an algorithm has a fixed part independent of the problem instance solved and a variable part which changes according to the problem instance solved. In general, which of these two is of prime concern to an algorithm designer? a) Fixed part b) Variable Part c) Product of fixed part and variable part d) None of these [Show More]
Last updated: 3 years ago
Preview 1 out of 23 pages
Buy this document to get the full access instantly
Instant Download Access after purchase
Buy NowInstant download
We Accept:
Reviews( 0 )
$10.00
Can't find what you want? Try our AI powered Search
Document information
Connected school, study & course
About the document
Uploaded On
Jul 25, 2021
Number of pages
23
Written in
All
Additional information
This document has been written for:
Uploaded
Jul 25, 2021
Downloads
0
Views
149
