Which data structure allows deleting data elements from front and inserting at rear?
Stacks
Queues
Deques
Binary search tree
The insertion operation of the queue is called :
Enqueue
Dequeue
Overflow
Underflow
Which of the following statement is false?
Arrays are dense lists and static data structure
Data elements in linked list need not be stored in adjacent space in memory
Pointers store the next data element of a list.
Linked lists are collection of the nodes that contain information part and next pointer
Which of the following allows a variety of critical operations to be performed?
Data structure
Data type
Arrays
Index
Finding the location of the element with a given value is:
Traversal
Search
Sort
None of these
____________ is the simplest sorting method.
Linear
Bubble sort
Selection sort
Insertion sort
Which operation is used to insert a new element from the queue?
Assumptions
Deque
Stack
The term "push" and "pop" is related to the
array
lists
stacks
Which of the following data structures are indexed structures?
Linear arrays
Linked lists
Priority Queue
Each array declaration need not give, implicitly or explicitly, the information about
the name of array
the data type of array
the first data from the set to be stored
the index set of the array
