McqMate

Q. |
## In linear search algorithm the Worst case occurs when ____________. |

A. | The item is somewhere in the middle of the array. |

B. | The item is not in the array at all. |

C. | The item is the last element in the array. |

D. | The item is the last element in the array or is not there at all. |

Answer» D. The item is the last element in the array or is not there at all. |

2.1k

0

Do you find this helpful?

5

View all MCQs in

Data Structures (DS)No comments yet

- What is the worst case time complexity of inserting a node in a doubly linked list?
- A linear collection of data elements where the linear node is given by means of pointer is called?
- 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?
- What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
- What is the time complexity of an infix to postfix conversion algorithm?
- Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?
- In infix to postfix conversion algorithm, the operators are associated from?
- A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?
- What is the space complexity of a linear queue having n elements?
- A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?