- Computer Science Engineering (CSE)
- Data Structures (DS)
- Searching, Sorting and Hashing Technique...
- Which of the following is a combination ...

Q. |
## Which of the following is a combination of LSD and MSD radix sorts? |

A. | Forward radix sort |

B. | 3-way radix quick sort |

C. | Trie base radix sort |

D. | Flash sort |

Answer» A. Forward radix sort |

View all MCQs in:
Data Structures (DS)

- Which of the following is true for the LSD radix sort?
- What is the worst case time complexity of LSD radix sort?
- LSD radix sort requires passes to sort N elements.
- For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
- The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?
- A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?
- Which of the following sorting algorithm is of divide-and-conquer type?
- If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
- Given an array arr = {45,77,89,90,94,99,100} and key = 99; what are the mid values(corresponding array elements) in the first and second levels of recursion?
- Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?

Login to Continue

It will take less than 2 minutes

Report MCQ