MCQ on Searching, Merging and Sorting Methods in Data Structure set-1


1) Finding the location of a given item in a collection of items is called ......

A. Discovering

B. Finding

C. Searching

D. Mining


2) Which of the following is an external sorting?

A. Insertion Sort

B. Bubble Sort

C. Merge Sort

D. Tree Sort


3) Very slow way of sorting is ..........

A. Insertion sort

B. Heap sort

C. Bubble sort

D. Quick sort


4) Which of the following is an internal sorting?

A. Tape Sort

B. 2-way Merge Sort

C. Merge Sort

D. Tree Sort


5) Sorting a file F usually refers to sorting F with respect to a particular key called .....

A. Basic key

B. Primary key

C. Starting key

D. Index key


6) The time complexity of quick sort is ........

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)


7) Selection sort first finds the .......... element in the list and put it in the first position.

A. Middle element

B. Largest element

C. Last element

D. Smallest element


8) Quick sort is also known as ........

A. merge sort

B. tree sort

C. shell sort

D. partition and exchange sort


9) The operation that combines the element is of A and B in a single sorted list C with n=r+s element is called ....

A. Inserting

B. Mixing

C. Merging

D. Sharing


10) A tree sort is also known as ......... sort.

A. quick

B. shell

C. heap

D. selection



11) .......... sorting is good to use when alphabetizing large list of names.

A. Merge

B. Heap

C. Radix

D. Bubble


12) The easiest sorting is ........

A. quick sort

B. shell sort

C. heap sort

D. selection sort


13) Which of the following sorting algorithm is of divide and conquer type?

A. Bubble sort

B. Insertion sort

C. Quick sort

D. Merge sort


14) Merging k sorted tables into a single sorted table is called ......

A. k way merging

B. k th merge

C. k+1 merge

D. k-1 merge


15) The function used to modify the way of sorting the keys of records is called ........

A. Indexing function

B. Hash function

C. Addressing function

D. All of the above


16) If the number of record to be sorted large and the key is short, then ...... sorting can be efficient.

A. Merge

B. Heap

C. Radix

D. Bubble


17) The total number of comparisons in a bubble sort is ....

A. O(n logn)

B. O(2n)

C. O(n2)

D. O(n)


18) If the number of record to be sorted large and the key is long, then ...... sorting can be efficient.

A. Merge

B. Heap

C. Quick

D. Bubble


19) The time complexity of heap sort is ....

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)


20) The complexity of selection sort is .......

A. O(n)

B. O(n2)

C. O(n logn)

D. O(logn)



Answers:


1) C. Searching
2) C. Merge Sort
3) A. Insertion sort
4) D. Tree Sort
5) B. Primary key
6) D. O(n logn)
7) D. Smallest element
8) D. partition and exchange sort
9) C. Merging
10) C. heap
11) C. Radix
12) D. selection sort
13) C. Quick sort
14) A. k way merging
15) B. Hash function
16) C. Radix
17) A. O(n logn)
18) C. Quick
19) D. O(n logn)
20) B. O(n2) 


Related Posts

For other more Multiple Choice Questions (MCQs): Click Here

Popular posts from this blog

MCQ of Structured Query Language(SQL) With Answer Set -2

1. Which of the following query is correct for using comparison operators in SQL ? A) SELECT sname, coursename FROM studentinfo WHERE age>50 and <80; B) SELECT sname, coursename FROM studentinfo WHERE age>50 and age <80; C) SELECT sname, coursename FROM studentinfo WHERE age>50 and WHERE age<80; D) None of the above 2.How to select all data from studentinfo table starting the name from letter 'r'? A) SELECT * FROM studentinfo WHERE sname LIKE 'r%'; B) SELECT * FROM studentinfo WHERE sname LIKE '%r%'; C) SELECT * FROM studentinfo WHERE sname LIKE '%r'; D) SELECT * FROM studentinfo WHERE sname LIKE '_r%'; 3. Which of the following SQL query is correct for selecting the name of staffs from 'tblstaff' table where salary is 15,000 or 25,000? A) SELECT sname from tblstaff WHERE salary IN (15000, 25000); B) SELECT sname from tblstaff WHERE salary BETWEEN 15000 AND 25000; C) Both A and B D) None of the above 4. The SELECT
Read more

Easy Methods to Increase Your Website Speed

Website speed is the most important factor for SEO. It also affects the popularity of your site, about every 25% of the visitors of the site left that even if it is useful for them for slow loading sites. Google also decided to include website loading speed for website ranking.  You can increase your website by performing testing or analyzing your site by using different such tools and performing the actions suggested by them. The main tasks to be performed to achieve such goals are setting an expiry date or maximum age in the HTTP headers, minimizing the HTTP redirects, minimizing the amount of JavaScript need while loading the page, minimizing unnecessary JavaScript, CSS Scripts and HTML, Optimizing images and long running scripts etc.  Why Website Speed is Most Important For SEO?  Only the fast loading websites can achieve better user experience and can have the minimum exit ratio. They can only achieve their goals in their online business and marketing. Search engine crawlers also
Read more

Solved MCQ on Stack and Queue in Data Structure set-1

1) ......... form of access is used to add and remove nodes from a queue. A. LIFO, Last In First Out B. FIFO, First In First Out C. Both a and b D. None of these 2) In liked representation of stack ....... holds the elements of the stack. A. INFO fields B. TOP fields C. LINK fields D. NULL fields 3) ........ form of access is used to add remove nodes from a stack. A. LIFO B. FIFO C. Both A and B D. None of these 4) In the linked representation of the stack ......... behaves as the top pointer variable of stack. A. Stop pointer B. Begin pointer C. Start pointer D. Avail pointer 5) New nodes are added to the ......... of the queue. A. Front B. Back C. Middle D. Both A and B 6) In linked representation of stack the null pointer of the last node in the list signals .......... A. Beginning of the stack B. Bottom of the stack C. Middle of the stack D. In between some value 7) What happens when you push a new node onto a stack? A. The new node is placed at the front of the linked list B. The
Read more