CS-2002 Question Paper With Solutions

Q. 5 In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

CS-2002 Question Paper With Solutions

Answer: (D)

Explanation:

CS-2002 Question Paper With Solutions

Learn More:   Gate ME-2011 Question Paper With Solutions

RELATED ARTICLESMORE FROM AUTHOR

LEAVE A REPLY

Please enter your comment!
Please enter your name here