McqMate

Q. |
## The average number of key comparisons done in a successful sequential search in a list of length n is ____________. |

A. | log n. |

B. | n-1/2. |

C. | n/2. |

D. | n+1/2. |

Answer» D. n+1/2. |

3.7k

0

Do you find this helpful?

22

View all MCQs in

Data Structures (DS)No comments yet

- The average number of key comparisons done in a successful sequential search in a list of length n is___________.
- The number of comparisons done by sequential search is ………………
- Which of the following statement is true?i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
- In general, the binary search method needs no more than ……………. comparisons.
- The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
- In ……………, search start at the beginning of the list and check every element in the list.
- The total number of comparisons in a bubble sort is ….
- What are the worst case and average case complexities of a binary search tree?
- What is the average case time complexity of binary search using recursion?
- What differentiates a circular linked list from a normal linked list?