Stack Implementation in C

What is a stack in data structure?

• A stack is a data structure that allows random access to its elements.

• A stack is a non-linear data structure.

• A stack is a linear data structure that follows the Last-In-First-Out (LIFO) principle.

• A stack is a linear data structure that follows the First-In-First-Out (FIFO) principle.

What are the two main operations performed on a stack?

• insert and remove

• add and remove

• enqueue and dequeue

• push and pop

How is a stack implemented using an array in C?

• Using a linked list instead of an array.

• Using a queue instead of a stack.

• Using a binary tree instead of an array.

• Using a fixed-size array and a top variable to keep track of the top element.

What is the time complexity of push and pop operations in a stack implemented using an array?

• O(log n)

• O(n^2)

• O(1)

• O(n)

What is the time complexity of accessing the top element of a stack implemented using an array?

• O(log n)

• O(n)

• O(1)

• O(n^2)

What is a stack overflow?

• A stack overflow is when a program's variables exceed their maximum size.

• A stack overflow is when a program's call stack exceeds its maximum size.

• A stack overflow is when a program encounters an infinite loop.

• A stack overflow is when a program runs out of memory.

What is a stack underflow?

• An item is popped from a full stack.

• An item is popped from an empty stack.

• An item is pushed onto an empty stack.

• An item is pushed onto a full stack.

How is a stack implemented using a linked list in C?

• By creating a linked list structure with a top pointer and using push and pop operations to add and remove elements from the top of the stack.

• By creating a linked list structure with a tail pointer and using push and pop operations to add and remove elements from the tail of the stack.

• By creating a linked list structure with a front pointer and using push and pop operations to add and remove elements from the front of the stack.

• By creating a linked list structure with a bottom pointer and using enqueue and dequeue operations to add and remove elements from the bottom of the stack.

What is the time complexity of push and pop operations in a stack implemented using a linked list?

• O(1)

• O(log n)

• O(n^2)

• O(n)

What is the difference between a stack implemented using an array and a stack implemented using a linked list?

• The array-based stack has a fixed maximum capacity, while the linked list-based stack can grow dynamically as needed.

• The main difference is the way elements are stored and accessed: array-based stack uses a fixed-size contiguous block of memory, while linked list-based stack uses dynamically allocated nodes that are linked together.

• The array-based stack allows for constant-time access to any element, while the linked list-based stack requires traversing the list to access an element.

• The array-based stack is more memory efficient than the linked list-based stack due to its contiguous memory allocation.