Which of the following data structure store the homogeneous data elements?

A. Arrays

B. Records

C. Pointers

D. None

Please do not use chat terms. Example: avoid using "grt" instead of "great".

You can do it
  1. The complexity of Binary search algorithm is
  2. Which of the following statement is false?
  3. _____ is not the component of data structure.
  4. When determining the efficiency of algorithm, the space factor is measured by
  5. Which of the following case does not exist in complexity theory
  6. To represent hierarchical relationship between elements, Which data structure is suitable?
  7. Which of the following is non-liner data structure?
  8. The number of possible ordered trees with three nodes A,B,C is?
  9. Which data structure is used in breadth first search of a graph to hold nodes?
  10. The complexity of merge sort algorithm is
  11. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  12. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
  13. If the values of a variable in one module is indirectly changed by another module, this situation is…
  14. Binary search algorithm can not be applied to
  15. Linked list are not suitable data structure of which one of the following problems ?
  16. Which of the following is not a limitation of binary search algorithm?
  17. Which of the following data structure is non linear type?
  18. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  19. A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…
  20. Herder node is used as sentinel in ____
  21. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  22. The memory address of the first element of an array is called
  23. Two dimensional arrays are also called
  24. The elements of an array are stored successively in memory cells because
  25. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  26. Linked lists are best suited
  27. Identify the data structure which allows deletions at both ends of the list but insertion at only one…
  28. Which of the following is not the required condition for binary search algorithm?
  29. The Average case occur in linear search algorithm
  30. Which of the following is two way list?