BSc Lab Component

If a stack is implemented using an array, what happens when the stack becomes full?

• Elements are overwritten

• Memory is dynamically increased

• Stack Overflow occurs

• Stack resets

Which of the following conditions indicates that a circular queue is full when using an array?

• Front == Rear

• Front = (Rear + 1) % Size

• Rear = (Front + 1) % Size

• Front + Rear == Size - 1

In a circular queue, how is the next position of rear calculated for insertion?

• rear = rear + 1

• rear = (rear + 1) % size

• rear = rear - 1

• rear = (rear + size - 1) % size

In a double-ended queue (Deque), insertion and deletion are allowed at:

• Only front

• Only rear

• Both front and rear

• None of the above

What is the advantage of a linked list over an array?

• Dynamic memory allocation

• Efficient random access

• Fixed memory size

• All of the above

In a circular linked list, which of the following is true?

• The last node points to NULL

• The last node points to the first node

• The first node points to itself

• All nodes point to NULL

In a doubly linked list, each node contains:

• Only one pointer to the next node

• Two pointers: one to the next node and one to the previous node

• A pointer to the previous node only

• No pointers at all

In a circular doubly linked list, which of the following is true?

• Each node has only a forward pointer

• Each node has a backward pointer but no forward pointer

• The last node points to the first node and vice versa

• It cannot be traversed in reverse order

What is the advantage of a circular doubly linked list over a singly linked list?

• Traversal is possible in both directions

• No need for a tail pointer

• Occupies less memory

• More efficient random access

What condition should be checked before pushing an element onto a stack implemented with an array?

• if (top == 0)

• if (top == size - 1)

• if (top == size)

• If (stack[top] == -1)