The memory address of the first element of an array is called

A. floor address

B. foundation address

C. first address

D. base address

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

You can do it
  1. Merge sort uses ?
  2. Linked list are not suitable data structure of which one of the following problems ?
  3. The operation of processing each element in the list is known as
  4. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  5. Which of the following is not a limitation of binary search algorithm?
  6. Arrays are best data structures
  7. The complexity of merge sort algorithm is
  8. Identify the data structure which allows deletions at both ends of the list but insertion at only one…
  9. ……………. Is a pile in which items are added at one end and removed from…
  10. Which of the following case does not exist in complexity theory
  11. For an algorithm the complexity of the average case is
  12. Each array declaration need not give, implicitly or explicitly, the information about
  13. Which if the following is/are the levels of implementation of data structure
  14. The situation when in a linked list START=NULL is
  15. ______ is very useful in situation when data have to stored and then retrieved in reverse order.
  16. Which of the following data structure cant store the non-homogeneous data elements?
  17. Which of the following is not the part of ADT description?
  18. The memory address of fifth element of an array can be calculated by the formula
  19. The complexity of Bubble sort algorithm is
  20. Which of the following is non-liner data structure?
  21. _______ level is where the model becomes compatible executable code
  22. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  23. Finding the location of the element with a given value is:
  24. In linear search algorithm the Worst case occurs when
  25. The difference between linear array and a record is
  26. Which of the following data structure store the homogeneous data elements?
  27. The elements of an array are stored successively in memory cells because
  28. Which of the following data structure is linear type?
  29. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
  30. Which one of the following permutations can be obtained the output using stack assuming that the input…