Data Structures Quiz 1

When a pop() operation is called on an empty stack, what is the condition called?

• Overflow

• Underflow

• Syntax Error

• Garbage Value

Which one of the following is the size of int arr[9] assuming that int is of 4 bytes?

• 9

• 36

• 35

• 4

 If the size of the stack is 10 and we try to add the 11th element in the stack then the condition is known as___

• Underflow

• Garbage collection

• Overflow

• None

Which of the following is the infix expression?

• A+B*C

• +A*BC

• ABC+*

• None of the above

Which of the following is the prefix form of A+B*C?

                

• A+(BC*)

• +AB*C

• ABC+*

• +A*BC

Which of the following is not the correct statement for a stack data structure?                 

• Arrays can be used to implement the stack

• Stack follows FIFO

• Elements are stored in a sequential manner

• Top of the stack contains the last inserted element

Which of the following principle does Queue use?

• LIFO principle

• FIFO principle

• Linear tree

• Ordered array

Which one of the following is the overflow condition if linear queue is implemented using an array with a size MAX_SIZE?

                 

• rear = front

• rear = front+1

• rear=MAX_SIZE -1

• rear = MAX_SIZE

Which one of the following is the overflow condition if a circular queue is implemented using array having size MAX?

• rear= MAX-1

• rear=MAX

• front=(rear+1) mod max

• None of the above

Which of the following determines the need for the Circular Queue?

                 

• Avoid wastage of memory

• Access the Queue using priority

• Follows the FIFO principle

• None of the above