Data Structures Quiz

Which one of the following is the process of inserting an element in the stack?

• Insert

• Add

• Push

• Pop

When the user tries to delete the element from the empty stack then the condition is said to be a ____

• Underflow

• Garbage collection

• Overflow

• None of the above

Which of the following data structure can't store the non-homogeneous data elements?

• Arrays

• Records

• Pointers

• Stacks

Which of the following is the advantage of the array data structure?

• Elements of mixed data types can be stored.

• Easier to access the elements in an array

• Index of the first element starts from 1.

• Elements of an array cannot be sorted

Which of the following principle does Queue use?

• LIFO principle

• FIFO principle

• Linear tree

• Ordered array

Which one of the following is not the type of the Queue?

• Linear Queue

• Circular Queue

• Double ended Queue

• Single ended Queue

New nodes are added to the ……… of the queue.

• A. Front

• B. Back

• C. Middle

• D. Both A and B

Which data structure is the best for implementing a priority queue?

• Stack

• Linked list

• Array

• Heap

The term push and pop is related to

• A. Array

• B. Lists

• C. Stacks

• D. Trees

A parentheses checker program would be best implemented using

• List

• Queue

• Stack

• Any of the above