McqMate

Q. |
## What is the time complexity of the above recursive implementation used to reverse a string? |

A. | o(1) |

B. | o(n) |

C. | o(n2) |

D. | o(n3) |

Answer» B. o(n) | |

Explanation: the time complexity of the above recursive implementation used to |

1.3k

0

Do you find this helpful?

11

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- What is the time complexity of the above recursive implementation of binary search?
- What is the time complexity of the above code used to reverse a string?
- What is the time complexity of the recursive implementation used to find the nth fibonacci term?
- What is the space complexity of the recursive implementation used to find the nth fibonacci term?
- What is the time complexity of the program to reverse stack when linked list is used for its implementation?
- Consider the brute force implementation of the rod cutting problem in which all the possible cuts are found and the maximum value is calculated. What is the time complexity of this brute force implementation?
- Consider the brute force implementation in which we find all the possible ways of multiplying the given set of n matrices. What is the time complexity of this implementation?
- Given a string, you have to find the minimum number of characters to be inserted in the string so that the string becomes a palindrome. Which of the following methods can be used to solve the problem?
- What is the time complexity of the above dynamic programming implementation of the assembly line scheduling problem?
- How many recursive calls are there in Recursive matrix multiplication by Strassen’s Method?