if the number of record to be sorted large and the key is long, then …… sorting can .

get if the number of record to be sorted large and the key is long, then …… sorting can . from screen.

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

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

Click here for :Free SSC Mock test by topic

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

1)Merge 2)Heap 3)Radix 4)Bubble : 300: 1 Previous Next

Suggest other answer

Login to Discuss/suggest the answer...

Heap

Merge

Radix

Bubble

sagarp 164

Exam: Data Structures QUESTIONS

Login to Discuss Login

स्रोत : www.quhasa.com

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

If the number of record to be sorted large and the key is long then Quick sorting can be efficient because it is useful when the data is purely random and large in the source Hence the correct option is quick

Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Practice Sets>PRACTICE SET - 12>Q 19

EASY HSSC Clerk IMPORTANT Earn 100

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

50%

students answered this correctly

Important Questions on Practice Sets

EASY HSSC Clerk IMPORTANT

Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Practice Sets>PRACTICE SET - 12>Q 20

What is an external sorting algorithm?

EASY HSSC Clerk IMPORTANT

Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Practice Sets>PRACTICE SET - 12>Q 21

When does the Array Index Out Of Bounds Exception occur?

MEDIUM HSSC Clerk IMPORTANT

Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Practice Sets>PRACTICE SET - 12>Q 22

Which of the following statements is false?

3D Learning Videos on Topics related to Practice Sets

22 min 53 sec

Schemes of Haryana at a Glance

This video discusses the developmental schemes launched by the Haryana government. It stresses the objective, target groups of various socio-economic development projects.

12 min 22 sec

Ramayan & Mahabharat have changed through History

This video discussed the 2 epics, Ramayan & Mahabharat, about how they have evolved from small regional stories to world texts and discussing acceptable historical, archaeology & scientific data.

26 min 19 sec

Medieval Indian Architecture

This video explained the Mediaval Architecture in India, including Indo-Islamic Architecture, Trabeate style, Imperial style etc. Let's watch this video and improve the knowledge of this toic.

Questions featured in Previous Year Papers on Practice Sets

EASY PREVIOUS YEAR HSSC Clerk IMPORTANT

Professional Knowledge for IBPS & SBI Specialist IT Officer Exam>Practice Sets>PRACTICE SET - 1>Q 37

A _____ attaches itself to executable files and replicates, when the infected program is executed, by finding other executable files to infect.

Enrich your Learning with Real Life Examples and DIY Videos

20 min 26 sec

MCQs on Schemes of Haryana

This video deals with MCQs on schemes of the Haryana government asked in various examinations. The questions are on aims and objectives, target groups of government schemes.

11 min 21 sec

MCQs on Assets and Liabilities

Assets and Liabilities are core of Finance! Let us practise some MCQs to eliminate the confusion between the two and make the concepts clear. Practise Now!

09 min 22 sec

MCQs on Maratha Kingdoms

If you have studied Maratha thoroughly in previous videos, then watch this video to practice some important questions that asked from this topic.

स्रोत : www.embibe.com

MCQ On Searching, Merging And Sorting Methods In Data Structure Set

Here are the collections of MCQ on Searching, Merging and Sorting Methods in Data Structure includes MCQs of Insertion sort, Quicksort, partition

CS/IT MCQ COLLECTIONS

MCQ ON SEARCHING, MERGING AND SORTING METHODS IN DATA STRUCTURE SET-1

Here are the collections of MCQ on Searching, Merging and Sorting Methods in Data Structure includes MCQ questions on Insertion sort, Quicksort, partition and exchange sort, selection sort, tree sort, k way merging and bubble sort. It also includes solved multiple choice questions on internal and external sorting, the time complexity of quicksort, divide and conquer type sorting, the complexity of selection sort and the method of merging k sorted tables into a single sorted table.

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

MCQs On Searching, Merging And Sort...

This is a modal window.

No compatible source was found for this media.

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 quicksort 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 a 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. Quicksort 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)

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)

Read More: Data Structure MCQ Questions

DATA STRUCTUREMULTIPLE CHOICE QUESTION (MCQ)

9 SHUSEEL BARAL

Shuseel Baral is a web programmer and the founder of InfoTechSite has over 8 years of experience in software development, internet, SEO, blogging and marketing digital products and services is passionate about exceeding your expectations.

Website

PREV POST

OBJECTIVE QUESTIONS ON ROUTING PROTOCOL IN COMPUTER NETWORKS SET-3

स्रोत : www.siteforinfotech.com