UNIT III QUIZ III

Register no and name

Which are the linear data structures _____.

• Stack
• Queue
• List
• Tree

Which are the correct examples for stack

• Stack of books
• Stack of plates
• Ticket counter
• One way Road

Stack is a

• FIFO
• LIFO

PUSH is a

• Insertion operation
• Deletion operation
• Display

A circular queue is implemented using an array of size 10. The array index starts with 0, front is 6, and rear is 9. The insertion of next element takes place at the array index.

• 0
• 9
• 7
• 10

If the MAX_SIZE is the size of the array used in the implementation of circular queue, array index start with 0, front point to the first element in the queue, and rear point to the last element in the queue. Which of the following condition specify that circular queue is FULL?

• Front=(rear+1)%MAX_SIZE
• Front=rear= -1
• Rear=front+1
• Rear=(front+1)%MAX_SIZE

If the elements '1', '2', '3' and '4' are inserted in a queue, what would be order for the removal? If the elements '1', '2', '3' and '4' are inserted in a stack, what would be order for the removal?

• 1234 4321
• 4321 1234
• 3241 4123
• none

Example of non linear data structure

• array
• tree
• queue
• stack

How many stacks are needed to implement a queue. Consider the situation where no other data structure like arrays, linked list is available to you.

• 1
• 2
• 3
• 4