Create Quiz

Pseudo-polynomial Algorithms Quiz

Pseudo-polynomial Algorithms Quiz

Pseudo-polynomial Algorithms Quiz ... What is Pseudo-polynomial? An algorithm whose worst case time complexity depends on numeric value of input (not number of value)

You can mute/unmute sounds from here

You May Get Result Of Pseudo-polynomial Algorithms Quiz

Pseudo-polynomial Algorithms Quiz ... What is Pseudo-polynomial? An algorithm whose worst case time complexity depends on numeric value of input (not number of value)
Pseudo-polynomial Algorithms Quiz ... What is Pseudo-polynomial? An algorithm whose worst case time complexity depends on numeric value of input (not number of value)
Pseudo-polynomial Algorithms Quiz ... What is Pseudo-polynomial? An algorithm whose worst case time complexity depends on numeric value of input (not number of value)
POST YOUR ANSWER (READ ANSWERS)

Quiz Questions And Answers

The upper bound on the time complexity of the nondeterministic sorting algorithm is :

O(n)
O(n log n)
O(1)
O( log n)

The time complexity of the normal quick sort, randomized quick sort algorithms in the worst case is :

O(n2), O(n log n)
O(n2), O(n2)
O(n log n), O(n2)
O(n log n), O(n log n)

Let there be an array of length ‘N’, and the selection sort algorithm is used to sort it, how many times a swap function is called to complete the execution?

N log N times
log N times
N2 times
N-1 times

The Sorting method which is used for external sort is

Bubble sort
Quick sort
Merge sort
Radix

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
Differential equation
Order of execution
Order of magnitude
ANSWERS

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

Pseudo-polynomial Algorithms Quiz : 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