stacks

1. What is the time complexity of the "push" operation in a stack implemented using a linked list?

• A) O(1)

• B) O(log n)

• C) O(n)

• D) O(n log n)

2. Which of the following is a disadvantage of using a stack implemented using an array?

• A) Slow access to elements

• B) Limited use of memory

• C) Risk of stack overflow

• D) All of the above

3. What is the purpose of the "peek" operation in a stack?

• A) To add an element to the top of the stack

• B) To remove an element from the top of the stack

• C) To return the top element of the stack without removing it

• D) To search for an element in the stack

4. Which of the following data structures is best suited for implementing recursive algorithms?

• A) Array

• B) Linked List

• C) Stack

• D) Queue

5. What is the time complexity of the "pop" operation in a stack implemented using a linked list?

• A) O(1)

• B) O(log n)

• C) O(n)

• D) O(n log n)

6. Which of the following is an advantage of using a stack implemented using a linked list?

• A) Slow access to elements

• B) Limited use of memory

• C) Efficient use of memory

• D) Fast access to elements

7.What is the time complexity of the "push" operation in a stack implemented using an array?

• A) O(1)

• B) O(log n)

• C) O(n)

• D) O(n log n)

8. Which of the following is a disadvantage of using a stack implemented using a linked list?

• A) Slow access to elements

• B) Limited use of memory

• C) Risk of stack overflow

• D) All of the above

9. Which of the following data structures is best suited for implementing iterative algorithms?

• A) Array

• B) Linked List

• C) Stack

• D) Queue

10. Which of the following is an advantage of using a stack implemented using an array?

• A) Array

• B) Linked List

• C) Stack

• D) Tree