Register

UGC NET CSE | December 2018 | Part 2 | Question: 30

• edited by
1,137 views
0 votes
0 votes

The second smallest of $n$ elements can be found with ____ comparisons in the worst case.

  1. $n-1$
  2. $\lg \: n$
  3. $n + ceil(\lg \: n)-2$
  4. $\frac{3n}{2}$
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
Arjun asked Jan 2, 2019
4,405 views
UGC NET CSE | December 2018 | Part 2 | Question: 12
Consider the graph shown below: Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is $17$ $14$ $16$ $13$
Consider the graph shown below:Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is$17$$14$$16$$13$
User Avatar
1 votes
1 votes
1 answer
2
Arjun asked Jan 2, 2019
3,747 views
UGC NET CSE | December 2018 | Part 2 | Question: 23
Consider two sequences $X$ and $Y$ : $X=<0, 1, 2, 1, 3, 0, 1>$ $Y=<1, 3, 2, 0, 1, 0>$ The length of longest common subsequence between $X$ and $Y$ is $2$ $3$ $4$ $5$
Consider two sequences $X$ and $Y$ :$X=<0, 1, 2, 1, 3, 0, 1>$$Y=<1, 3, 2, 0, 1, 0>$The length of longest common subsequence between $X$ and $Y$ is$2$$3$$4$$5$
User Avatar
0 votes
0 votes
1 answer
3
Arjun asked Jan 2, 2019
1,762 views
UGC NET CSE | December 2018 | Part 2 | Question: 27
Match $\text{List I}$ with $\text{List II}$ ... $\text{(a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)}$
Match $\text{List I}$ with $\text{List II}$ and choose the correct answer from the code given below.$\begin{array} {clcl} & \textbf{List I} & & \textbf{List II} \\ & \...
User Avatar
Link Copied!