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

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

You can do it
  1. A variable P is called pointer if
  2. Merge sort uses ?
  3. If the values of a variable in one module is indirectly changed by another module, this situation is…
  4. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  5. The complexity of linear search algorithm is
  6. Arrays are best data structures
  7. Linked lists are best suited
  8. Which of the following is non-liner data structure?
  9. Stack is also called as
  10. To represent hierarchical relationship between elements, Which data structure is suitable?
  11. When new data are to be inserted into a data structure, but there is no available space; this situation…
  12. Which one of the following permutations can be obtained the output using stack assuming that the input…
  13. The number of possible ordered trees with three nodes A,B,C is?
  14. Which of the following statement is true ?
  15. Which of the following data structure is non linear type?
  16. The elements of an array are stored successively in memory cells because
  17. Two main measures for the efficiency of an algorithm are
  18. The difference between linear array and a record is
  19. ……………. Is a pile in which items are added at one end and removed from…
  20. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  21. The memory address of the first element of an array is called
  22. When determining the efficiency of algorithm the time factor is measured by
  23. Which of the following name does not relate to stacks?
  24. The complexity of Bubble sort algorithm is
  25. When determining the efficiency of algorithm, the space factor is measured by
  26. In linear search algorithm the Worst case occurs when
  27. The memory address of fifth element of an array can be calculated by the formula
  28. Which of the following statement is false?
  29. _____ is not the component of data structure.
  30. The complexity of Binary search algorithm is