- Computer Science Engineering (CSE)
- Data Structures (DS)
- Searching, Sorting and Hashing Technique...
- Which of the following is a disadvantage...

Q. |
## Which of the following is a disadvantage of linear search? |

A. | Requires more space |

B. | Greater time complexities compared to other searching algorithms |

C. | Not easy to understand |

D. | Not easy to implement |

Answer» B. Greater time complexities compared to other searching algorithms |

View all MCQs in:
Data Structures (DS)

- What is the best case for linear search?
- What is the worst case for linear search?
- What is the best case and worst case complexity of ordered linear search?
- In linear search algorithm the Worst case occurs when ____________.
- The Worst case occur in linear search algorithm when_____________.
- The complexity of linear search algorithm is____________.
- A linear collection of data elements where the linear node is given by means of pointer is called?
- Which of the following is not a disadvantage to the usage of array?
- What is not a disadvantage of priority scheduling in operating systems?
- What is the disadvantage of selection sort?

Login to Continue

It will take less than 2 minutes

Report MCQ