Abstract level

Implementation level

Application level

All of the above

**The difference between linear array and a record is****Which of the following data structure is linear data structure?****Which one of the following permutations can be obtained the output using stack assuming that the input…****Which of the following is true about the characteristics of abstract data types? i) It exports a type.…****Which of the following data structure can't store the non-homogeneous data elements?****Which of the following is two way list?****The complexity of merge sort algorithm is****Which of the following data structure is non linear type?****Finding the location of the element with a given value is:****_______ level is where the model becomes compatible executable code****Which of the following is not the required condition for binary search algorithm?****Which data structure allows deleting data elements from and inserting at rear?****The complexity of Bubble sort algorithm is****When new data are to be inserted into a data structure, but there is no available space; this situation…****Linked list are not suitable data structure of which one of the following problems ?****Two main measures for the efficiency of an algorithm are****The complexity of linear search algorithm is****Which data structure is used in breadth first search of a graph to hold nodes?****Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…****_____ is not the component of data structure.****Which of the following statement is true ?****When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return****Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…****……………. Is a pile in which items are added at one end and removed from…****Herder node is used as sentinel in ____****Two dimensional arrays are also called****The memory address of fifth element of an array can be calculated by the formula****In linear search algorithm the Worst case occurs when****To represent hierarchical relationship between elements, Which data structure is suitable?****______ is very useful in situation when data have to stored and then retrieved in reverse order.**