The space factor when determining the efficiency of algorithm is measured by

  1. Home
  2. Back

Question:
The space factor when determining the efficiency of algorithm is measured by

1.counting the maximum memory needed by the algorithm

2.counting the minimum memory needed by the algorithm

3.counting the average memory needed by the algorithm

4.counting the maximum disk space needed by the algorithm

Posted Date:-2022-07-05 22:51:43

More MCQS Questions and answers

  1. A graph is said to be complete if there is no edge between every pair of vertices.
  2. A matrix in which non-zero entries can only occur on the diagonal or on elements immediately above or below the diagonal, is called ______ matrix.
  3. A node is child node if out degree is one.
  4. Array is
  5. Each programming language contains a ______ set that is used to communicate with the computer.
  6. Groups of consecutive elements in a string, such as words, phrases and sentences are called ________.
  7. If string 1 = John, and string 2 = Rivers are merged, the process is called ----
  8. It exports a set of operations
  9. The complexity of the average case of an algorithm is
  10. The number K in A[K] is called the subscript or the ________.
  11. Which of the following case does not exist in complexity theory
  12. ____ arrays are where the elements in the different arrays with the same subscript belongs to the same record.
  13. ____ is a variable whose length may vary during the execution, but the length cannot exceed a maximum values defined before the program is executed.
  14. _____ arrays are where the elements in the different arrays with the same subscript belongs to the same record.
  15. _____ is a linearly ordered sequence of memory cells.
  16. _____ is a structure used to represent the linear relationship between elements by means of sequential memory locations.
  17. _____ is a variable whose length may vary during the execution of a program.
  18. ______ is a list in which the order of the items is significant, and the items are not necessarily sorted.
  19. ______ operation of word processing involves replacing one string in the text by another.
  20. ______ refers to the operations of rearranging the elements of an array A so that they are in increasing order.
  21. _______ is the problem of deciding whether or not a given String pattern P appears in a text T.
  22. A ______ is a list of a finite number of homogeneous data elements.
  23. A computer which can access an individual byte is called a ________ machine.
  24. A graph is said to be complete if there is an edge between every pair of vertices.
  25. Array is a
  26. Computers are used for processing numerical data called _______ data.
  27. Each node in a linear list contains an item called _______ which points to the next node in the list.
  28. Elements of of an arrays are accessed by
  29. Finite sequence S of zero or more characters is called _______.
  30. In _______ storage, each cell is divided into two parts---- the path stores a single character, while the second part contains the address of the cell containing the next character.
  31. In strictly binary tree, the out-degree of every node is either o or 2.
  32. Insertion b) Deletion c) Retrieval d) Traversal
  33. Matrices with relatively high proportion of zero entries are called ______ matrices.
  34. Nodes that are not root and not leaf are called as internal nodes.
  35. Programming languages like FORTRAN and PASCAL allocate memory space for arrays ______
  36. Records can be stored in an area of memory called _______ memory.
  37. Records can be stored in an area of memory called _______ memory.
  38. Representation of a two dimensional as one single column of rows and mapping it sequentially is called _______ representation.
  39. Row -major order in two -dimentional array refers to an arrangement where
  40. Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.
  41. String with zero characters is called ________ string.
  42. The Average case occur in linear search algorithm
  43. The number of characters in a string is called its ______.
  44. The number of elements n is called the length or _____ of the array.
  45. The process of accessing and processing each element of an array A, exactly once is called _______.
  46. The space factor when determining the efficiency of algorithm is measured by
  47. The time complexity of binary search is O(logn).
  48. The time factor when determining the efficiency of algorithm is measured by
  49. Two dimensional arrays are sometimes called _______ arrays.
  50. Which of the following items are not part of the array declaration?
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!