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
Which operation is used to insert a new element from the queue?
Assumptions
Deque
Enqueue
Stack
____________ is the simplest sorting method.
Linear
Bubble sort
Selection sort
Insertion sort
When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
Underflow
Overflow
Saturated
A data structure where elements can be added or removed at either end but not in the middle
Linked lists
Stacks
Queues
Which is more efficient for searching array of data?
Binary search
Linear search
A man who write a program, and he takes 2 linear array with size 2 and 3. At the time of output displayed the size of 3rd array shows as 5 which technique did he used?
Copying
Traversal
Concatenation
The data structures are classified into _________ and _________.
Linear data structures and non-linear data structures
Primitive data structures and non - primitive data structures
Data type and Abstract data type
Data type and Array
Which of the following allows a variety of critical operations to be performed?
Data structure
Data type
Arrays
Index
If an infix expression ((A + (B - C) * D) ^ E + F) converted into ABC- D * + E ^ F + . which form of expression is obtained?
Infix
Prefix
Arithmetic
Post fix
