Unit III Assignment

What is the primary purpose of a stack?

• To manage data in a circular manner

• To allow last-in, first-out access

• To store data in a linear fashion

• To provide random access to elements

Which of the following is a characteristic of a dynamic stack?

• Only allows integer data types

• Uses a linked list only

• Resizes as needed

• Fixed size

What operation is used to remove an element from a stack?

• Enqueue

• Dequeue

• Pop

• Push

In which notation is the operator placed before its operands?

• Standard Notation

• Postfix Notation

• Infix Notation

• Prefix Notation

What is a key feature of a circular queue?

• Elements can be added only at one end

• It uses a fixed-size array

• It can only hold unique elements

• It allows continuous cycling through the queue

Which of the following is NOT a type of queue?

• Stack Queue

• Doubly Ended Queue

• Circular Queue

• Linear Queue

What is the main advantage of using a doubly ended queue?

• Faster access to elements

• Ability to add or remove from both ends

• Simpler implementation

• Lower memory usage

Which operation adds an element to a queue?

• Pop

• Push

• Dequeue

• Enqueue

What is the result of converting an infix expression to postfix?

• It becomes more complex

• It requires more memory

• It eliminates the need for parentheses

• It is always longer

What is the time complexity of accessing an element in a stack?

• O(log n)

• O(n^2)

• O(1)

• O(n)