Computer Science and Information Technology
2021 · Paper 1
Take it one question at a time. Try an answer, then check your understanding.
Complete GATE CSE 2021 Paper 1 overview, original pages and practice · Timed previous-paper practice
Questions 19–21 of 65. Imported answers require review unless explicitly marked reviewed.
Question 9
Open questionCSMCQ1 markNeeds review
Consider the following array.
23, 32, 45, 69, 72, 73, 89, 97
Which algorithm out of the following options uses the least number of comparisons (among the array elements) to sort the above array in ascending order?
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 10
Open questionCSMCQ1 markNeeds review
A binary search tree
contains
distinct elements. What is the time complexity of picking an element in
that is smaller than the maximum element in
?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 11
Open questionCSMSQ1 markNeeds review
In the context of operating systems, which of the following statements is/are correct with respect to paging?
Your answerSelect all correct options. You can choose more than one.
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