chapter
    Search PYQs for GATE DA

    GATE DA Search: 2 chapters, 7 previous year questions (50% of Artificial Intelligence), 0 practice questions and one solved question from each chapter.

    A question from this chapter

    Question 1
    2026 PYQ

    Which of the following algorithms is NOT an example of uninformed search?

    Question 2
    2026 PYQ
    Consider the game tree for a two-player turn-taking minimax game as shown in the figure. The value of a terminal node represents the utility of the game state if the game ends there. The numbers written next to the edges denote the strategies.

    There are two players MAX and MIN. At any particular state of the game, MAX prefers to move to a state of maximum value. On the other hand, MIN prefers to move to a state of minimum value.

    Suppose MAX starts the game at the root and has three strategies: 1, 2 and 3. Next, MIN plays and also has three strategies: 1, 2 and 3. The game ends there. Both players always take optimal strategies throughout the game.

    At the root, the best strategy for MAX is ___________ . (Answer in integer)
    MAX MIN 1 2 3 1 2 3 8 6 −1 1 2 3 1 5 7 1 2 3 −4 −3 −12
    Free preview ends here

    Login to view the complete previous-year questions and solutions

    Creating an account is free. You get the rest of this chapter, step-by-step solutions, and a study plan built around the topics you are actually weak at.

    Login to continueSee plans
    Why MastersUp

    Personalised first. High quality throughout.

    Most platforms hand everyone the same content. Here the content moves with your performance, topic by topic.

    Built around you, not around a syllabus PDF

    Every answer you give moves your topic-level intelligence rate. The next question, the next revision card and tomorrow's plan all change with it.

    Revision that hits your weak spots

    We only revise topics you have actually attempted and are still below the safe bar on — never the same chapter on repeat.

    Questions calibrated to the real exam

    Each question carries a measured toughness. You are served a rung above your current level, so practice keeps stretching you.

    Notes written for recall, not for volume

    Full lesson cards for first study, curated short-note cards for the last mile — with derivations, traps and exam patterns marked.

    One place for everything

    Notes, chapter practice, previous-year questions, test series and full-length papers — all feeding one picture of your preparation.

    Honest progress

    No vanity streaks. Progress here means chapters mastered and accuracy that held up on harder questions.

    Unlock the whole course

    Full notes and short notes, the complete question bank with worked solutions, mock tests, full-length papers, and an adaptive plan that rebuilds itself as you improve.

    View all plansStart free

    Search PYQs for GATE DA

    GATE DA Search: 2 chapters, 7 previous year questions (50% of Artificial Intelligence), 0 practice questions and one solved question from each chapter.

    About Search Previous Year Questions (PYQs)

    7 previous year questions from Search in GATE DA, grouped by chapter with the exam year, answer key and step-by-step solution for each.

    Search Weightage in GATE DA

    Search accounts for 7 of 14 Artificial Intelligence previous year questions in our bank (50%), about 2.3 per paper across 3 papers.

    Search Chapter Matrix

    ChapterTopicsPYQsShare of unit PYQsPractice questions
    Uninformed Search and Heuristic SearchUninformed Search: BFS, DFS and Search Strategy Classification, A* Search, Admissible Heuristics and Expansion Order457%0
    Adversarial Search, Minimax and Alpha-Beta PruningMinimax Game Tree Evaluation and Strategy Selection, Alpha-Beta Pruning Bounds and Interpretation343%0

    More from Artificial Intelligence

    One Solved Question from Each Search Chapter

    Question 1 · Uninformed Search and Heuristic Search · 2026 MCQ

    Which of the following algorithms is NOT an example of uninformed search?

    1. A.

      Breadth First Search

    2. B.

      Depth First Search

    3. C.

      A* Search

    4. D.

      Depth-limited Search

    Question 2 · Adversarial Search, Minimax and Alpha-Beta Pruning · 2026 NAT
    Consider the game tree for a two-player turn-taking minimax game as shown in the figure. The value of a terminal node represents the utility of the game state if the game ends there. The numbers written next to the edges denote the strategies.

    There are two players MAX and MIN. At any particular state of the game, MAX prefers to move to a state of maximum value. On the other hand, MIN prefers to move to a state of minimum value.

    Suppose MAX starts the game at the root and has three strategies: 1, 2 and 3. Next, MIN plays and also has three strategies: 1, 2 and 3. The game ends there. Both players always take optimal strategies throughout the game.

    At the root, the best strategy for MAX is ___________ . (Answer in integer)
    MAX MIN 1 2 3 1 2 3 8 6 −1 1 2 3 1 5 7 1 2 3 −4 −3 −12