- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Can binary search be applied on a sorted...

Q. |
## Can binary search be applied on a sorted linked list in O(Logn) time? |

A. | no |

B. | yes |

Answer» A. no | |

Explanation: since linked list doesn’t allow random access, binary search cannot be applied on a sorted linked list in o(logn) |

View all MCQs in:
Design and Analysis of Algorithms

- Which of the following methods can be used to search an element in a linked list?
- What is the time complexity of the above recursive implementation of binary search?
- What is the time complexity of the program to reverse stack when linked list is used for its implementation?
- The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using
- Which of the following methods can be used to find the largest and smallest number in a linked list?
- Under what case of Master’s theorem will the recurrence relation of binary search fall?
- Which of the following is considered as the top of the stack in the linked list implementation of the stack?
- What is running time of Dijkstra’s algorithm using Binary min- heap method?
- Which of the following techniques can be used to search an element in an unsorted array?
- When dynamic programming is applied to a problem, it takes far less time as compared to other methods that don’t take advantage of overlapping subproblems.

Login to Continue

It will take less than 2 minutes

Report MCQ