

MCQOPTIONS
Saved Bookmarks
This section includes 1 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.
1. |
In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is? |
A. | log 2 n |
B. | <sup>n</sup> <sub>2</sub> |
C. | log 2 n 1 |
D. | n |
Answer» E. | |