Exploring Stacks in Data Structures

What are the basic operations of a stack?

• Push, Pop, Peek, IsEmpty

• Insert, Delete, Top, IsFull

• Add, Remove, Clear, Size

• Enqueue, Dequeue, Front, IsNull

Explain the Last In First Out (LIFO) principle.

• Items are removed in the order they were added.

• The last item added is the last one to be removed.

• The first item added is the first one to be removed.

• The last item added is the first one to be removed.

What is the time complexity of push and pop operations in a stack?

• O(n)

• O(log n)

• O(1)

• O(n^2)

List three applications of stacks in computer science.

• 1. 1. Network packet routing

  2. 2. Network message buffer

  3. 3. Print job processing

• 1. 1. Memory allocation management

  2. 2. File management

  3. 3. CPU management

• 1. 1. Data sorting algorithms

  2. 2. task scheduling

  3. 3. Disc Scedule

• 1. Function call management

  2. Expression evaluation

  3. Backtracking algorithms

How can stacks be used in expression evaluation?

• Stacks can only be used for sorting data.

• Stacks can be used to convert and evaluate expressions in postfix notation.

• Stacks can evaluate expressions in infix notation.

• Stacks are not applicable in expression evaluation.

Describe how a stack can be implemented using an array.

• A stack can be implemented using a linked list with no index tracking.

• A stack can only be implemented using a queue.

• A stack requires a fixed size and cannot grow dynamically.

• A stack can be implemented using an array by using an index to track the top element and performing push, pop, and peek operations.

What are the advantages of using a linked list to implement a stack?

• Fixed size allocation

• Slower access times

• Increased memory fragmentation

• Dynamic sizing

Explain the process of converting an infix expression to postfix.

• Using a stack to reorder operators according to precedence and associativity rules.

• Using a queue to process operands before operators.

• Converting all operators to prefix notation first.

• Evaluating the expression directly without reordering.

What does a Stack hold during infix to postfix convertion?

• Operator

• Operand

• Output

• Input

Perform Prefix expresion on following Infix expression:

A - B + C

• • - + A B C

• • - A + B C

• • + - A B C

• • + A - B C