Home / Engineering / Design and Analysis of Algorithms / Question

M

Mr. Dubey • 51.17K Points
Coach 

Q.) What is the space complexity of program to reverse stack recursively?

(A) o(1)
(B) o(log n)
(C) o(n)
(D) o(n log n)
Correct answer : Option (C) - o(n)

Explanation: 
 the recursive program to reverse stack uses memory of the order n to store function call stack.

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Design and Analysis of Algorithms

Q. Following are the types of supervised learning

Q. GIF is another implementation of the ___ algorithm

Q. What is one disadvantage of an S-R flip-flop?

Q. Time taken in memory access through PTBR is

Q. engineering economic decision refers to all investment decisions relating to engineering projects.

Q. Pushing an element into stack already having five elements and stack size of 5, then stack becomes

Q. Point out the correct statement.

Q. We can also compute the coefficient of linear regression with the help of an analytical method called Normal Equation. Which of the following is/are true about Normal Equation?1. We dont have to choose the learning rate2. It becomes slow when number of features is very large3. No need to iterate

Q. Delimiting and synchronization of data exchange is provided by __________

Q. Programmers prefer programming to testing and sometimes they take shortcuts when writing tests. For example, they may write incomplete tests that do not check for all possible exceptions that may occur.