Queue

Stack

List

None of the above

**Which of the following name does not relate to stacks?****Which data structure is used in breadth first search of a graph to hold nodes?****The complexity of Bubble sort algorithm is****Which of the following case does not exist in complexity theory****When determining the efficiency of algorithm, the space factor is measured by****Which of the following is not the required condition for binary search algorithm?****Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…****Which of the following algorithm design technique is used in the quick sort algorithm?****Which of the following is not a limitation of binary search algorithm?****Which of the following is non-liner data structure?****Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…****The memory address of the first element of an array is called****_______ level is where the model becomes compatible executable code****A variable P is called pointer if****For an algorithm the complexity of the average case is****Which of the following is not the part of ADT description?****Which of the following is true about the characteristics of abstract data types? i) It exports a type.…****Which one of the following permutations can be obtained the output using stack assuming that the input…****The complexity of Binary search algorithm is****The complexity of linear search algorithm is****Stack is also called as****Which if the following is/are the levels of implementation of data structure****Which data structure allows deleting data elements from and inserting at rear?****The elements of an array are stored successively in memory cells because****Identify the data structure which allows deletions at both ends of the list but insertion at only one…****Linked lists are best suited****Finding the location of the element with a given value is:****Linked list are not suitable data structure of which one of the following problems ?****_____ is not the component of data structure.****When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return**