Introduction To Data Structures - Study Mode
[#61] 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?
Correct Answer
(D) Both O(n) and θ(n)
[#62] The data structure required to check whether an expression contains a balanced parenthesis is?
Correct Answer
(A) Stack
[#63] Which of these best describes an array?
Correct Answer
(B) Container of objects of similar types
[#64] Given only a single array of size 10 and no other memory is available. Which of the following operation is not feasible to implement (Given only push and pop operation)?
Correct Answer
(C) Enqueue
[#65] In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is?
Correct Answer
(D) n