Home

The elements of an array are stored successively in memory cells because

A. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

B. the architecture of computer memory does not allow arrays to store other than serially

C. both of above

D. none of above

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

You can do it
  1. The number of possible ordered trees with three nodes A,B,C is?
  2. Which of the following data structure cant store the non-homogeneous data elements?
  3. Which of the following data structures are indexed structures?
  4. Which of the following is two way list?
  5. Which of the following statement is false?
  6. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…
  7. The complexity of linear search algorithm is
  8. Which data structure is used in breadth first search of a graph to hold nodes?
  9. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  10. Merge sort uses ?
  11. Two dimensional arrays are also called
  12. Which of the following is not the required condition for binary search algorithm?
  13. Which of the following is non-liner data structure?
  14. ______ is very useful in situation when data have to stored and then retrieved in reverse order.
  15. The complexity of Bubble sort algorithm is
  16. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  17. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
  18. Which of the following is not the part of ADT description?
  19. The memory address of fifth element of an array can be calculated by the formula
  20. A data structure where elements can be added or removed at either end but not in the middle
  21. For an algorithm the complexity of the average case is
  22. Which of the following data structure is non linear type?
  23. Each array declaration need not give, implicitly or explicitly, the information about
  24. Finding the location of the element with a given value is:
  25. Linked list are not suitable data structure of which one of the following problems ?
  26. The elements of an array are stored successively in memory cells because
  27. Arrays are best data structures
  28. Which of the following data structure is not linear data structure?
  29. Which of the following algorithm design technique is used in the quick sort algorithm?
  30. The complexity of Binary search algorithm is