📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!


    Question

    Backtracking is an algorithmic technique often used for

    problems that involve:
    A Finding the shortest path in a graph. Correct Answer Incorrect Answer
    B Optimizing a single objective function with local choices. Correct Answer Incorrect Answer
    C Exploring all possible solutions to a problem by systematically trying and undoing choices. Correct Answer Incorrect Answer
    D Sorting elements in linear time. Correct Answer Incorrect Answer
    E Merging sorted subarrays. Correct Answer Incorrect Answer

    Solution

    Backtracking is a general algorithmic technique for solving problems that incrementally build candidates to the solutions, and "backtrack" (abandon a candidate) as soon as it determines that the candidate cannot possibly be completed to a valid solution. It's essentially a systematic way to explore a search space.

    Practice Next
    ask-question