Home

The memory address of fifth element of an array can be calculated by the formula

A. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array

B. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array

C. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array

D. None of above

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

You can do it
  1. To represent hierarchical relationship between elements, Which data structure is suitable?
  2. The difference between linear array and a record is
  3. A data structure where elements can be added or removed at either end but not in the middle
  4. Which data structure is used in breadth first search of a graph to hold nodes?
  5. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
  6. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  7. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
  8. _______ level is where the model becomes compatible executable code
  9. Two main measures for the efficiency of an algorithm are
  10. Which of the following name does not relate to stacks?
  11. The operation of processing each element in the list is known as
  12. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  13. Arrays are best data structures
  14. Which of the following data structure is non linear type?
  15. The complexity of linear search algorithm is
  16. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…
  17. When determining the efficiency of algorithm the time factor is measured by
  18. Which of the following data structure can't store the non-homogeneous data elements?
  19. Finding the location of the element with a given value is:
  20. The number of possible ordered trees with three nodes A,B,C is?
  21. Each array declaration need not give, implicitly or explicitly, the information about
  22. Which of the following algorithm design technique is used in the quick sort algorithm?
  23. If the values of a variable in one module is indirectly changed by another module, this situation is…
  24. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  25. The memory address of the first element of an array is called
  26. Which of the following is not a limitation of binary search algorithm?
  27. Which if the following is/are the levels of implementation of data structure
  28. When new data are to be inserted into a data structure, but there is no available space; this situation…
  29. A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…
  30. Which of the following case does not exist in complexity theory