Quiz on Linked Lists and Recursion

Which operation in a singly linked list has O(1) time complexity?

• Insert at head

• Insert in middle

• Delete

• Search

In which case is a doubly linked list preferred over a singly linked list?

• When frequent deletions are required

• When memory is a constraint

• When traversal in both directions is needed

• When only forward traversal is needed

Which of these is not true about stacks?

• LIFO structure

• Used for backtracking

• Can be implemented using arrays

• Allows random access

What is the maximum number of pointers needed in a doubly linked list node?

• 1

• 2

• 3

• 4

In recursion, the base case is important to:

• Prevent infinite recursion

• Optimize performance

• Handle edge cases

• All of the above

What is the top of a stack in terms of data structure operations?

• The last element added

• The first element added

• The middle element

• None of the above

Which of these is a real-world example of a stack?

• Undo feature in text editors

• Browser history

• Call stack in programming

• All of the above

Write a recursive function to calculate the sum of first N numbers.

Explain push and pop operations using an example.

Draw a stack after these operations: Push(1), Push(2), Pop(), Push(3)