Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 212 views

    Sorting

    Uploaded by

    Mr.B.Ravisankar CTUG
    This document contains 15 multiple choice questions about various sorting algorithms including merge sort, quick sort, selection sort, bubble sort, heap sort, radix sort, and linear search. The questions cover topics like which algorithms use pivots, divide and conquer techniques, running time dependencies, internal vs external sorting, uses of linear search, categorization of binary search and radix sort, properties of bubble, shell, and heap sorts, and the definition of a heap data structure.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Sorting

    Uploaded by

    Mr.B.Ravisankar CTUG
    212 views2 pages
    This document contains 15 multiple choice questions about various sorting algorithms including merge sort, quick sort, selection sort, bubble sort, heap sort, radix sort, and linear search. The questions cover topics like which algorithms use pivots, divide and conquer techniques, running time dependencies, internal vs external sorting, uses of linear search, categorization of binary search and radix sort, properties of bubble, shell, and heap sorts, and the definition of a heap data structure.

    Original Title

    sorting

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains 15 multiple choice questions about various sorting algorithms including merge sort, quick sort, selection sort, bubble sort, heap sort, radix sort, and linear search. The questions cover topics like which algorithms use pivots, divide and conquer techniques, running time dependencies, internal vs external sorting, uses of linear search, categorization of binary search and radix sort, properties of bubble, shell, and heap sorts, and the definition of a heap data structure.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    212 views2 pages

    Sorting

    Uploaded by

    Mr.B.Ravisankar CTUG
    This document contains 15 multiple choice questions about various sorting algorithms including merge sort, quick sort, selection sort, bubble sort, heap sort, radix sort, and linear search. The questions cover topics like which algorithms use pivots, divide and conquer techniques, running time dependencies, internal vs external sorting, uses of linear search, categorization of binary search and radix sort, properties of bubble, shell, and heap sorts, and the definition of a heap data structure.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 2

    1.

    The sorting process in which two ordered lists of elements are combined into single ordered list
    is
    a. Merge sort
    b. Bubble sort
    c. Selection sort
    d. Quick sort
    2. The pivot element is used in _______ sorting
    a. Merge sort
    b. Bubble sort
    c. Selection sort
    d. Quick sort
    3. The ________ sorting in which parent node is greater than the child node
    a. Merge sort
    b. Heap sort
    c. Selection sort
    d. Quick sort
    4. The bucket sort is otherwise known as
    a. Merge sort
    b. Selection sort
    c. Radix sort
    d. Quick sort
    5. The process of searching the next smallest element is repeated, until all the elements in the list
    have been sorted in ascending order
    a. Selection sort
    b. Merge sort
    c. Radix sort
    d. Quick sort
    6. What is the advantage of bubble sort over other sorting technique ?
    a. It is faster
    b. Detects whether the input is already sorted
    c. Consumes less memory
    d. Less time consumption

    7. Algorithm design technique used in quick sort algorithm is


    a. Divide and conquer
    b. Backtracking
    c. Greedy method
    d. Dynamic programming
    8. Quick sort running time depends on the selection of
    a. Size of array
    b. Pivot element
    c. Sequence of values
    d. None of the above
    9. What is an internal sorting algorithm?
    a. Algorithm that uses tape or disk during the sort
    b. Algorithm that uses main memory during the sort
    c. Algorithm that involves swapping
    d. Algorithm that are considered ‘in place’

    10. Where is linear searching used?


    a. When the list has only a few elements
    b. When performing a single search in an unordered list
    c.  Used all the time
    d. When the list has only a few elements and when performing a single search in an
    unordered list
    11. Binary search can be categorized into which of the following?
    a. Divide and conquer
    b. Greedy algorithm
    c. Dynamic programming
    d. Brute force technique
    12. Radix sort belongs to the family of sorting by
    a. Distribution
    b. Selection
    c. Exchange
    d. Merge
    13. ____________ sorting belongs to the family of sorting by exchange
    a. Radix sort
    b. Heap sort
    c. Shell sort
    d. Bubble sort
    14. The _________sorting,in each pass, the elements are compared pair wise until the largest key
    amongst the participating elements comes to the end of the list.
    a. Radix sort
    b. Heap sort
    c. Bubble sort
    d. Shell sort
    15. A heap is a __________________
    a. Binary tree
    b. Complete Binary tree
    c. Full Binary tree
    d. Skewed Tree

    You might also like