Data Structure: Sorting - Online Test

Test Difficulty Level: Medium

Syllabus of Test

Sorting: Questions based on the Sorting.

Sample Question from this online test:

Question: The best sorting methods if no of swappings done, is the only measure of efficiency is

Option A: Bubble sort

Option B: Selection sort

Option C: Insertion sort

Option D: Heap sort

To answer, click the "Start This Test" button below.

Start this Test






Comments

amina khatun on 2011-01-30 08:32:06 wrote,

pl explain answer of question 15 and 16

nikhil verma on 2011-02-17 15:39:19 wrote,

NIKHIL---i can explain ,let question 15---quick sort takes n(logn) time,for 1000 name,it will do 1000(log1000)=9000 comparisions,so 9000 comparisions in 100 sec ,so 100 names(100(log100)=600 comparisions) will take----
100*600/9000=6.7 sec.
like this u can solve for question 16.

debabrata SahaChowdhury on 2011-05-28 14:17:20 wrote,

good questions.....

shekhar jha on 2011-06-24 17:57:21 wrote,

Question 20 :
For merging two sorted lists of sizes m an into a sorted list of size m+n, we require comparisons of
O(m)
O(n)
O(m+d)
O(logn+log

hope option c will o(m+n)

Soniya Pawar on 2011-08-02 09:35:16 wrote,

Good Questions..

mridu sahu on 2012-12-08 06:52:36 wrote,

pl explain answer