Which of the following data structures are indexed structures?

Related Questions

1. Merge sort uses ?
2. In linear search algorithm the Worst case occurs when
3. The term push and pop is related to the
4. The number of possible ordered trees with three nodes A,B,C is?
5. The elements of an array are stored successively in memory cells because
6. Which one of the following permutations can be obtained the output using stack assuming that the input…
7. Each array declaration need not give, implicitly or explicitly, the information about
8. The memory address of fifth element of an array can be calculated by the formula
9. Binary search algorithm can not be applied to
10. Which of the following is not the part of ADT description?
11. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
12. Linked list are not suitable data structure of which one of the following problems ?
13. ______ is very useful in situation when data have to stored and then retrieved in reverse order.
14. The complexity of merge sort algorithm is
15. The operation of processing each element in the list is known as
16. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
17. Two dimensional arrays are also called
18. Which of the following statement is false?
19. When determining the efficiency of algorithm the time factor is measured by
20. Which of the following statement is true ?
21. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
22. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
23. Which of the following data structure is linear data structure?
24. A variable P is called pointer if
25. _______ level is where the model becomes compatible executable code
26. Arrays are best data structures
27. To represent hierarchical relationship between elements, Which data structure is suitable?
28. A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…
29. Finding the location of the element with a given value is:
30. A data structure where elements can be added or removed at either end but not in the middle

Also checkout these categories