McqMate

Q. |
## The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are, |

A. | 5 and 4 |

B. | 4 and 5 |

C. | 2 and 4 |

D. | 2 and 5 |

Answer» A. 5 and 4 |

2k

0

Do you find this helpful?

7

View all MCQs in

Data Structures (DS)No comments yet

- The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,
- The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
- The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?
- 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?
- Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the element is found?
- 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?
- The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is ____________.
- The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
- Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
- 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?