Create Quiz

# 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

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

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

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

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

Greedy
Dynamic
Branch and Bound
Backtracking.

Insertion
Selection
Deletion
None

1
4
7
None