Which of the following statements is true?(a) Recursion is always better than iteration(b) Recursion uses more memory compared to iteration(c) Recursion uses less memory compared to iteration(d) Iteration is always better and simpler than recursionThe question was posed to me by my college director while I was bunking the class.This interesting question is from Recursion in division Recursion of Data Structures & Algorithms II

Which of the following statements is true?(a) Recursion is always bett

1.	Which of the following statements is true?(a) Recursion is always better than iteration(b) Recursion uses more memory compared to iteration(c) Recursion uses less memory compared to iteration(d) Iteration is always better and simpler than recursionThe question was posed to me by my college director while I was bunking the class.This interesting question is from Recursion in division Recursion of Data Structures & Algorithms II
Answer» CORRECT answer is (B) Recursion uses more memory compared to iteration To explain: Recursion uses more memory compared to iteration because EVERY time the RECURSIVE function is called, the function call is stored in STACK.

Discussion

No Comment Found

Related InterviewSolutions

Matrix A is of order 3*4 and Matrix B is of order 4*5. How many elements will be there in a matrix A*B multiplied recursively.(a) 12(b) 15(c) 16(d) 20Answer know the answer? please give answer with explanation
Under what case of Master’s theorem will the recurrence relation of binary search fall?(a) 1(b) 2(c) 3(d) It cannot be solved using master’s theoremThe question was asked in examination.My doubt stems from Masters theorem in section Recursion of Data Structures & Algorithms II
What is the result of the recurrences which fall under the extended second case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=n^c(log n)k?(a) T(n) = O(nlogba)(b) T(n) = O(n^c log n)(c) T(n)= O(n^c (log n)^k+1(d) T(n) = O(n^2)This question was posed to me in homework.This is a very interesting question from Masters theorem topic in division Recursion of Data Structures & Algorithms II
Which case of master’s theorem can be extended further?(a) 1(b) 2(c) 3(d) No case can be extendedI have been asked this question in an online interview.I'm obligated to ask this question of Masters theorem in chapter Recursion of Data Structures & Algorithms II
Under what case of Master’s theorem will the recurrence relation of stooge sort fall?(a) 1(b) 2(c) 3(d) It cannot be solved using master’s theoremThis question was addressed to me during an online interview.I'd like to ask this question from Masters theorem topic in portion Recursion of Data Structures & Algorithms II
Under what case of Master’s theorem will the recurrence relation of merge sort fall?(a) 1(b) 2(c) 3(d) It cannot be solved using master’s theoremI have been asked this question during an internship interview.Enquiry is from Masters theorem topic in chapter Recursion of Data Structures & Algorithms II
What is the result of the recurrences which fall under third case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=n^c?(a) T(n) = O(nlogba)(b) T(n) = O(n^c log n)(c) T(n) = O(f(n))(d) T(n) = O(n^2)This question was addressed to me in an interview.This question is from Masters theorem topic in section Recursion of Data Structures & Algorithms II
We can solve any recurrence by using Master’s theorem.(a) true(b) falseThis question was posed to me in an international level competition.My question is based upon Masters theorem topic in section Recursion of Data Structures & Algorithms II
What is the result of the recurrences which fall under second case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=n^c?(a) T(n) = O(nlogba)(b) T(n) = O(n^c log n)(c) T(n) = O(f(n))(d) T(n) = O(n^2)I got this question by my college professor while I was bunking the class.Question is taken from Masters theorem topic in chapter Recursion of Data Structures & Algorithms II
What is the result of the recurrences which fall under first case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=n^c?(a) T(n) = O(n^logba)(b) T(n) = O(n^c log n)(c) T(n) = O(f(n))(d) T(n) = O(n^2)I got this question by my college professor while I was bunking the class.This key question is from Masters theorem in section Recursion of Data Structures & Algorithms II

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment