Quiz Questions And Answers

A sort which compares adjacent elements in a list and switches where necessary is a

insertion sort

heap sort

bubble sort

None

A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called

Insertion sort

selection sort

Heap sort

None

A sort which uses the binary tree concept such that any number is larger than all the numbers is the subtree below it is called

Selection sort

insertion sort

quick sort

heap sort

which of the sorting algorithm does not have a worst case running time of O(n2)

Selection sort

insertion sort

merge sort

quick sort

which of the following sorting method is stable?

Straight insertion sort

binary search tree

Shell sort

Heap sort

A complete binary tree with the property that the value at each node is at least as large as the values at its children is known as

Binary search tree

AVL tree

Both

None

The recurrence relation T(n) = mT(n/2)+ an2 is satisfied by

T (n) = O(nm)

T(n) = O(n log m)

T(n) = O( n log n) (D) T(n)

All

The time required to find shortest path in a graph with n vertices and e edges is

O (e)

O (n)

O (e2)

O (n2)

ANSWERS

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

Ashleigh Wendrock Quiz | Test, Bio, Birthday, Net Worth, Height Family

Activity Selection Problem Quiz : Test Trivia

Ultimate impossible accurate personality honest Quiz Game

How do you rate this quiz?

Average rating 4.8 / 5. Vote: 5

Activity Selection Problem Quiz

The Activity Selection Problem is an optimization problem which deals with the selection of non-conflicting activities that needs to be executed by a single person or machine in a given time frame Quiz

You May Get Result Of Activity Selection Problem Quiz

Quiz Questions And Answers

A sort which compares adjacent elements in a list and switches where necessary is a

A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called

A sort which uses the binary tree concept such that any number is larger than all the numbers is the subtree below it is called

which of the sorting algorithm does not have a worst case running time of O(n2)

which of the following sorting method is stable?

A complete binary tree with the property that the value at each node is at least as large as the values at its children is known as

The recurrence relation T(n) = mT(n/2)+ an2 is satisfied by

The time required to find shortest path in a graph with n vertices and e edges is