- Computer Science Engineering (CSE)
- Data Structures (DS)
- The average number of key comparisons do...

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. |

View all MCQs in:
Data Structures (DS)

- The average number of key comparisons done in a successful sequential search in a list of length n 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?
- Consider a small circular linked list. How to detect the presence of cycles in this list effectively?
- What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
- The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
- A _____________ list is a list where the last node contains null pointer.
- A linked list whose last node points back to the list node instead of containing the null pointer________.
- The _________ for a linked list is a pointer variable that locates the beginning of the list.

Login to Continue

It will take less than 2 minutes

Report MCQ