ISRO Computer Science (CSE) 2008 - Question 71

All ISRO Computer Science (CSE) papers | ISRO Computer Science (CSE) 2008

The time required to search an element in a linked list of length n is

  • A. O(log_2 n)
  • B. O(n)
  • C. O(1)
  • D. O(n²)

Answer: B. O(n)

Explanation: Linked lists require sequential access traversal.

| | All questions of ISRO Computer Science (CSE) 2008