Home

Two main measures for the efficiency of an algorithm are

A. Processor and memory

B. Complexity and capacity

C. Time and space

D. Data and space

Related Questions

  1. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…
  2. Binary search algorithm can not be applied to
  3. Which of the following is non-liner data structure?
  4. The elements of an array are stored successively in memory cells because
  5. The complexity of linear search algorithm is
  6. Two main measures for the efficiency of an algorithm are
  7. The memory address of the first element of an array is called
  8. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
  9. Which data structure is used in breadth first search of a graph to hold nodes?
  10. If the values of a variable in one module is indirectly changed by another module, this situation is…
  11. The complexity of Binary search algorithm is
  12. Stack is also called as
  13. Which of the following is not the part of ADT description?
  14. In linear search algorithm the Worst case occurs when
  15. Which of the following is not a limitation of binary search algorithm?
  16. Linked lists are best suited
  17. _______ level is where the model becomes compatible executable code
  18. Each array declaration need not give, implicitly or explicitly, the information about
  19. Which one of the following permutations can be obtained the output using stack assuming that the input…
  20. Which of the following is not the required condition for binary search algorithm?
  21. Which of the following data structure is non linear type?
  22. ______ is very useful in situation when data have to stored and then retrieved in reverse order.
  23. Linked list are not suitable data structure of which one of the following problems ?
  24. Two dimensional arrays are also called
  25. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  26. To represent hierarchical relationship between elements, Which data structure is suitable?
  27. The complexity of merge sort algorithm is
  28. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  29. Which of the following statement is true ?
  30. When determining the efficiency of algorithm, the space factor is measured by

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