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
Circular linked list follows the
FIFO Principle
LIFO Principle
Both FIFO and LIFO
None of these
Two dimensional arrays are also called
Table arrays
Matrix arrays
Both 1 and 2
The insertion operation of the queue is called :
Enqueue
Dequeue
Overflow
Underflow
The searching method that can be used on small arrays.
Binary search
Linear search
Random Search
Bubble search
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
When the stack is empty, it is not possible to delete any item and this situation is called
Implementation of stack
Underflow of the stack
Application of a stack
Stack overflow
The term "push" and "pop" is related to the
array
lists
stacks
Infix, postfix and prefix are the classifications of ________
Stack
Queue
Array
Arithmatic Expression
The deletion operation is called as ___________ operation.
