When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
Which of the following data structure store the homogeneous data elements?
Which of the following is not a limitation of binary search algorithm?
When determining the efficiency of algorithm the time factor is measured by
Which of the following name does not relate to stacks?
The complexity of merge sort algorithm is
Which of the following data structure can’t store the non-homogeneous data elements?
Which of the following case does not exist in complexity theory
The elements of an array are stored successively in memory cells because
Finding the location of the element with a given value is:
If the values of a variable in one module is indirectly changed by another module, this situation is called
Arrays are best data structures
The operation of processing each element in the list is known as
Two main measures for the efficiency of an algorithm are
Which of the following is two way list?
Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
Which of the following is not the required condition for binary search algorithm?
A variable P is called pointer if
The situation when in a linked list START=NULL is
Linked lists are best suited
Which of the following data structures are indexed structures?
The complexity of linear search algorithm is
Binary search algorithm can not be applied to
A data structure where elements can be added or removed at either end but not in the middle
Two dimensional arrays are also called
For an algorithm the complexity of the average case is
The complexity of Bubble sort algorithm is
In linear search algorithm the Worst case occurs when
Each array declaration need not give, implicitly or explicitly, the information about
The memory address of fifth element of an array can be calculated by the formula
The memory address of the first element of an array is called
When determining the efficiency of algorithm, the space factor is measured by
Which of the following statement is false?
The complexity of Binary search algorithm is
Which of the following data structure is not linear data structure?
Which of the following data structure is linear data structure?
The difference between linear array and a record is
When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
The term “push” and “pop” is related to the
The Average case occur in linear search algorithm