- Computer Science Engineering (CSE)
- Data Structures (DS)
- Which of the following case does not exi...

Q. |
## Which of the following case does not exist in complexity theory |

A. | Best case |

B. | Worst case |

C. | Average case |

D. | Null case |

Answer» D. Null case |

View all MCQs in:
Data Structures (DS)

- What is the best case and worst case complexity of ordered linear search?
- What is the worst case time complexity of inserting a node in a doubly linked list?
- What is the average case time complexity for finding the height of the binary tree?
- The worst case complexity of deleting any arbitrary node value element from heap is
- What is the worst case complexity of binary search using recursion?
- What is the average case time complexity of binary search using recursion?
- What is the worst case complexity of bubble sort?
- What is the average case complexity of bubble sort?
- What is the worst case complexity of selection sort?
- What is the average case complexity of selection sort?

Login to Continue

It will take less than 2 minutes

Report MCQ