Exam 2

Original Session

Date: 08 Dec 2024

MCQ

1. which of the following problem not solved using backtrack
   1. Sudoku, NQueen, Shortest path in graph, Cryptarithmetic puzzles
      
      

2. In recursive implementation of Fibonacci, what is the time complexity ?
   1. On, LogN, n^2, 2^n.
      
      

3. In backtracking what is the role of decision space.
   1. It represent the set of all feasible solutions to the problem.
   2. It specifies the initial state of search space.
   3. It determines the order in which solutions are explored.
   4. It defines the constraints that solutions must satisfy.
      
      

4. What is a potential drawback of using recursion instead of iteration ?
   1. Recursion typically consumes less memory than iteration.
   2. Recursion often leads to better performance due to compiler optimizations.
   3. Recursion can be harder to understand and debug than iterative solutions.
   4. Recursion allows for more flexible control flow compared to iteration.

Program

1. leetcode 390 link
   1. 390. Elimination Game

2. leetcode 784 link
   1. 784. Letter Case Permutation

3. leetcode 679 link
   1. 679. 24 Game