- Computer Science Engineering (CSE)
- Data Structures (DS)
- Searching, Sorting and Hashing Technique...
- Given an input arr = {2,5,7,99,899}; key...

Q. |
## Given an input arr = {2,5,7,99,899}; key = 899; What is the level of recursion? |

A. | 5 |

B. | 2 |

C. | 3 |

D. | 4 |

Answer» C. 3 |

View all MCQs in:
Data Structures (DS)

- 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 = {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 = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?
- 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?
- The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,
- 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,
- Assuming int is of 4bytes, what is the size of int arr[15];?
- Which data structure is used for implementing recursion?
- What is the worst case complexity of binary search using recursion?

Login to Continue

It will take less than 2 minutes

Report MCQ