Sorting MCQ

Test your knowledge with important Sorting MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Sorting MCQs at Bissoy

• The complexity of Binary search algorithm is
  ক

  O(n)

  খ

  O(log )

  গ

  O(n2)

  ঘ

  O(n log n)
• The complexity of a linear search algorithm is
  ক

  O(n)

  খ

  O(log n)

  গ

  O(n2)

  ঘ

  O(n log n)
• The complexity of the average case of an algorithm is
  ক

  Much more complicated to analyze than that of worst case

  খ

  Much more simpler to analyze than that of worst case

  গ

  Sometimes more complicated and some other times simpler than that of worst case

  ঘ

  None of the mentioned
• The Average case occur in linear search algorithm
  ক

  When Item is somewhere in the middle of the array

  খ

  When Item is not in the array at all

  গ

  When Item is the last element in the array

  ঘ

  When Item is the last element in the array or is not there at all
• The Worst case occur in linear search algorithm when
  ক

  Item is somewhere in the middle of the array

  খ

  Item is not in the array at all

  গ

  Item is the last element in the array

  ঘ

  Item is the last element in the array or is not there at all
• Which of the following case does not exist in complexity theory
  ক

  Best case

  খ

  Worst case

  গ

  Average case

  ঘ

  Null case
• The space factor when determining the efficiency of an algorithm is measured by
  ক

  Counting the maximum memory needed by the algorithm

  খ

  Counting the minimum memory needed by the algorithm

  গ

  Counting the average memory needed by the algorithm

  ঘ

  Counting the maximum disk space needed by the algorithm
• The time factor when determining the efficiency of an algorithm is measured by
  ক

  Counting microseconds

  খ

  Counting the number of key operations

  গ

  Counting the number of statements

  ঘ

  Counting the kilobytes of algorithm
• Two main measures for the efficiency of an algorithm are
  ক

  Processor and memory

  খ

  Complexity and capacity

  গ

  Time and space

  ঘ

  Data and space
• Which of the following pair of sorting algorithms are stable?
  ক

  gnome sort and merge sort

  খ

  heap sort and merge sort

  গ

  gnome sort and quick sort

  ঘ

  merge sort and selection sort
• Which of the following sorting algorithm uses the method of insertion?
  ক

  selection sort

  খ

  quick sort

  গ

  bubble sort

  ঘ

  cycle sort
• Which of the following sorting algorithm is stable?
  ক

  Introsort

  খ

  Tim sort

  গ

  Heap sort

  ঘ

  Quick sort
• Which of the following sorting algorithm is used by C++ internally?
  ক

  quicksort

  খ

  merge sort

  গ

  introsort

  ঘ

  heap sort
• In heap sort, after deleting the last minimum element, the array will contain elements in?
  ক

  increasing sorting order

  খ

  tree preorder

  গ

  tree inorder

  ঘ

  decreasing sorting order
• Quick sort uses which of the following method to implement sorting?
  ক

  partitioning

  খ

  selection

  গ

  exchanging

  ঘ

  merging
• Shell sort algorithm is an example of?
  ক

  Bottom-up sorting

  খ

  In-place sorting

  গ

  Internal sorting

  ঘ

  External sorting
• Which of the following sorting algorithms is the fastest?
  ক

  Merge sort

  খ

  Shell sort

  গ

  Insertion sort

  ঘ

  Quick sort
• Merge sort uses which of the following method to implement sorting?
  ক

  selection

  খ

  exchanging

  গ

  merging

  ঘ

  partitioning
• Which of the following sorting algorithm does not use recursion?
  ক

  bottom up merge sort

  খ

  merge sort

  গ

  heap sort

  ঘ

  quick sort
• Which of the following method is used for sorting in merge sort?
  ক

  partitioning

  খ

  merging

  গ

  exchanging

  ঘ

  selection
• What is the advantage of selection sort over other sorting techniques?
  ক

  It is faster than any other sorting technique

  খ

  It is scalable

  গ

  It works best for inputs which are already sorted

  ঘ

  It requires no additional storage space
• Which of the following sorting algorithms is the fastest for sorting small arrays?
  ক

  Quick sort

  খ

  Shell sort

  গ

  Insertion sort

  ঘ

  Heap sort