☰
Create Quiz

K’th Smallest/Largest Element in Unsorted Array Quiz Question

K’th Smallest/Largest Element in Unsorted Array Quiz Question

Simply sort the array and pick the k-th smallest/largest element. The time complexity is O(n*log(n) Quiz Question

You can mute/unmute sounds from here

You May Get Result Of K’th Smallest/Largest Element in Unsorted Array Quiz Question

Simply sort the array and pick the k-th smallest/largest element. The time complexity is O(n*log(n) Quiz Question
Simply sort the array and pick the k-th smallest/largest element. The time complexity is O(n*log(n) Quiz Question
Simply sort the array and pick the k-th smallest/largest element. The time complexity is O(n*log(n) Quiz Question
Simply sort the array and pick the k-th smallest/largest element. The time complexity is O(n*log(n) Quiz Question
POST YOUR ANSWER (READ ANSWERS)

Quiz Questions And Answers

The Sorting method which is used for external sort is

Bubble sort
Quick sort
Both
None

In analysis of algorithm, approximate relationship between the size of the job and the amount of work required to do is expressed by using _________

Central tendency
Order of magnitude
Order of execution
None

P, Q and R are pointer variables. The statements below are intended to swap the contents of the nodes pointed to by P and Q. rewrite it so that it will work as intended.

R=Q; P=R; Q=R;
R=P; P=P; Q=Q;
P=P; P=Q; R=Q;
None

Consider the usual algorithm for determining whether a sequence of parentheses is balanced. What is the maximum number of parentheses that will appear on the stack AT ANY ONE TIME

1
2
4
6

The Knapsack problem where the objective function is to minimize the profit is ______

Greedy
Dynamic 0 / 1
Back tracking
Branch & Bound 0/1

Choose the correct answer for the following statements: I. The theory of NP–completeness provides a method of obtaining a polynomial time for NPalgorithms. II. All NP-compl

I is FALSE and II is TRUE
I is TRUE and II is FALSE
Both are TRUE
Both are FALSE

For 0/1 KNAPSACK problem, the algorithm takes ________ amount of time for memory table, and ______time to determine the optimal load, for N objects and W as the capacity of KNAPSAC

O(N+W), O(NW)
O(NW), O(N+W)
O(N), O(NW)
O(NW), O(N)

What is the type of the algorithm used in solving the 8 Queens problem?

Greedy
Dynamic
Branch and Bound
Backtracking.

Sorting is not possible by using which of the following methods?

Insertion
Selection
Deletion
None

the total running time of optimal binary search tree of n nodes

1
4
7
None
ANSWERS

Currently, we have no comments. Be first to comment on this quiz.

Related Quiz Tags

Marriage QuizzesMother QuizzesNetball Players QuizzesBabies QuizzesBaseball Player QuizzesTeenager QuizzesFlute Players QuizzesTime QuizzesRoyal Family Member QuizzesFat QuizzesFlower QuizzesQueens QuizzesAstrologers QuizzesLove QuizzesFamily Member QuizzesAge QuizzesNarcissist QuizzesGamer QuizzesEntrepreneurs QuizzesMovie Character QuizzesHeight Quizzes

K’th Smallest/Largest Element in Unsorted Array Quiz Question : Test Trivia

Ultimate impossible accurate personality honest Quiz Game

How do you rate this quiz?

Average rating 4.8 / 5. Vote: 5
Embed This Quiz
Copy the code below to embed this quiz