- Computer Science Engineering (CSE)
- Data Structures (DS)
- The efficient searching algorithm for al...

Q. |
## The efficient searching algorithm for algorithm for a sorted array is _________. |

A. | Binary search. |

B. | Linear search. |

C. | Indexed search. |

D. | Repeated search. |

Answer» A. Binary search. |

View all MCQs in:
Data Structures (DS)

- An array that is first 7-sorted, then 5-sorted becomes
- __________is combining the records in two different sorted files in to a single sorted file.
- 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 = 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?
- Which of the following is not an advantage of optimised bubble sort over other sorting techniques in case of sorted elements?
- What is the time complexity of searching for an element in a circular linked list?
- Where is linear searching used?
- Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?

Login to Continue

It will take less than 2 minutes

Report MCQ