Which Data Structure that works on a principle RIRO ?
Stack
Queue
Linked List
Tree
Which data structure allows deleting data elements from front and inserting at rear?
Stacks
Queues
Deques
Binary search tree
____________ is the simplest sorting method.
Linear
Bubble sort
Selection sort
Insertion sort
Infix, postfix and prefix are the classifications of ________
Array
Arithmatic Expression
The deletion operation is called as ___________ operation.
Enqueue
Dequeue
Overflow
Underflow
Linked lists are best suited
for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
None of these
Stacks and Queues are the examples of
Linear Data Structures
Non-linear data structures
Primitive data structures
Non-primitive data structures
The insertion operation of the queue is called :
Circular linked list follows the
FIFO Principle
LIFO Principle
Both FIFO and LIFO
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
