What is the correct answer?


Which if the following is/are the levels of implementation of data structure

A. Application level

B. Abstract level

C. Implementation level

D. All of the above

Correct Answer :

D. All of the above

Related Questions

The complexity of linear search algorithm is Which of the following data structure can't store the non-homogeneous… The Average case occur in linear search algorithm The elements of an array are stored successively in memory cells because Identify the data structure which allows deletions at both ends of the… ______ is very useful in situation when data have to stored and then retrieved… Which of the following is true about the characteristics of abstract data… Which of the following is non-liner data structure? Arrays are best data structures Binary search algorithm can not be applied to Linked list are not suitable data structure of which one of the following… Which of the following data structure is non linear type? Which data structure allows deleting data elements from and inserting… Merge sort uses ? When determining the efficiency of algorithm, the space factor is measured… Each data item in a record may be a group item composed of sub-items;… Stack is also called as Inserting an item into the stack when stack is not full is called _______… _______ level is where the model becomes compatible executable code The difference between linear array and a record is Two main measures for the efficiency of an algorithm are Which one of the following permutations can be obtained the output using… Which of the following is not the required condition for binary search… In linear search algorithm the Worst case occurs when Two dimensional arrays are also called When inorder traversing a tree resulted E A C K F H D B G; the preorder… Which of the following statement is true ? Each array declaration need not give, implicitly or explicitly, the information… The complexity of merge sort algorithm is Which of the following data structures are indexed structures?