Computer Science and Information Technology
2017 · Paper 1
Take it one question at a time. Try an answer, then check your understanding.
Complete GATE CSE 2017 Paper 1 overview, original pages and practice · Timed previous-paper practice
Questions 4–6 of 65. Imported answers require review unless explicitly marked reviewed.
Question 4
Open questionCSMCQ1 markNeeds review
Consider the following functions from positive integers to real numbers:
The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is:
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 5
Open questionCSMCQ1 markNeeds review
Consider the following table:
Algorithms | Design Paradigms |
|---|---|
(P) Kruskal | (i) Divide and Conquer |
(Q) Quicksort | (ii) Greedy |
(R) Floyd-Warshal | (iii) Dynamic Programming |
Match the algorithms to the design paradigms they are based on.
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 6
Open questionCSMCQ1 markNeeds review
Let
be a binary search tree with 15 nodes. The minimum and maximum possible heights of
are:Note: The height of a tree with a single node is 0.
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