McqMate

Q. |
## Which of the following is false? |

A. | LSD radix sort is an integer sorting algorithm |

B. | LSD radix sort is a comparison sorting algorithm |

C. | LSD radix sort is a distribution sort |

D. | LSD radix sort uses bucket sort |

Answer» B. LSD radix sort is a comparison sorting algorithm |

3.4k

0

Do you find this helpful?

21

View all MCQs in

Data Structures (DS)No comments yet

- Which of the following is false about a doubly linked list?
- Which of the following is false about a circular linked list?
- Which of the following is false about a binary search tree?
- Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: i. isEmpty (Q) — returns true if the queue is empty, false otherwise. ii. delete (Q) — deletes the element at the front of the queue and returns its value. iii. insert (Q, i) — inserts the integer i at the rear of the queue. Consider the following function: void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); insert(Q, i); } }What operation is performed by the above function f ?
- Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
- Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
- 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?
- Which if the following is/are the levels of implementation of data structure
- Which of the following is not the part of ADT description?
- Which of the following data structure can’t store the non-homogeneous data elements?