Exploring Stacks and Queues

What are the basic operations of a stack?

• Add, Remove, Display, Clear

• Insert, Delete, View, Check

• Enqueue, Dequeue, Top, IsFull

• Push, Pop, Peek, IsEmpty

How do you implement a queue using an array in C?

• Use an array to store elements, with 'front' and 'rear' indices to manage the queue. Implement 'enqueue' and 'dequeue' functions to add and remove elements.

• Store elements in a stack instead of a queue.

• Use a linked list to store elements without indices.

• Implement only the 'enqueue' function and skip 'dequeue'.

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

• O(n^2)

• O(1)

• O(log n)

• O(n)

Describe the difference between a stack and a queue.

• A stack uses LIFO, while a queue uses FIFO.

• A stack uses FIFO, while a queue uses LIFO.

• A stack allows random access, while a queue does not.

• Both stack and queue use LIFO.

List some common applications of stacks in programming.

• Data compression algorithms

• Common applications of stacks include function call management, expression evaluation and parsing, backtracking algorithms, and undo mechanisms in applications.

• Network packet routing

• Memory management in operating systems

What is the time complexity of enqueue and dequeue operations in a queue?

• O(n) for enqueue and O(1) for dequeue in a circular array

• O(1) for both enqueue and dequeue in a linked list; O(1) for enqueue and O(n) for dequeue in a simple array; O(1) for both in a circular array.

• O(1) for enqueue and O(1) for dequeue in a simple array

• O(n) for both enqueue and dequeue in a linked list

What are some real-world applications of queues?

• Customer service lines, print spooling, task scheduling in operating systems, and web server request handling.

• Data encryption processes

• File storage management

• Network routing protocols

How do you handle overflow in a stack implementation?

• Check for full stack before push; return error or resize if full.

• Automatically delete the top item to make space.

• Ignore the overflow; continue pushing items.

• Remove the bottom item when the stack is full.

Describe how to implement a circular queue in C.

• A circular queue can be implemented in C using an array, with front and rear indices that wrap around when they reach the end of the array.

• A circular queue requires a fixed size and cannot dynamically resize.

• A circular queue can be implemented using linked lists without any indices.

• A circular queue is implemented by using a stack data structure.

What is the space complexity of a stack?

• O(1)

• O(n^2)

• O(log n)

• O(n)