Data Science and Artificial Intelligence
2026 · Paper 1
Take it one question at a time. Try an answer, then check your understanding.
Complete GATE DA 2026 Paper 1 overview, original pages and practice · Timed previous-paper practice
Questions 13–15 of 65. Imported answers require review unless explicitly marked reviewed.
Question 13
Open questionDAMCQ1 markNeeds review
Which of the following algorithms is NOT an example of uninformed search?
Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 14
Open questionDAMCQ1 markNeeds review
Which of the following statements is NOT true?
(The names of the predicates are intuitive.)
Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 15
Open questionDAMCQ1 markNeeds review
Consider that the quick sort algorithm is used to sort an array of
distinct randomly ordered elements. In every call, the pivot is chosen as the first element of the current subarray.Let
denote the expected time to sort the array. Assume that the time to partition is linear in the size of the current subarray.Which of the following recurrence relations correctly represents
in this scenario?Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer