Processing each element in list is called as
A. Indexing.
B. Traversing.
C. Sorting.
D. Searching.
ANSWER: B
Processing each element in list is called as Read More »
A. Indexing.
B. Traversing.
C. Sorting.
D. Searching.
ANSWER: B
Processing each element in list is called as Read More »
A. item is somewhere in the middle of the array.
B. item is not in the array at all.
C. item is the last element in the array.
D. item is the first element in the array.
ANSWER: B
The Worst case occur in linear search algorithm when Read More »
A. Best case.
B. Worst case.
C. Average case.
D. Null case.
ANSWER: D
Which of the following case does not exist in complexity theory. Read More »
A. counting the maximum memory needed by the algorithm.
B. counting the minimum memory needed by the algorithm.
C. counting the average memory needed by the algorithm.
D. counting the maximum disk space needed by the algorithm.
ANSWER: A
The space factor when determining the efficiency of algorithm is measured by Read More »
A. counting microseconds.
B. counting the number of key operations.
C. counting the kilobytes of algorithm.
D. counting number of lines.
ANSWER: B
The time factor, when determining the efficiency of algorithm is measured by Read More »
A. processor and memory.
B. complexity and capacity.
C. time and space.
D. data and space.
ANSWER: C
Two main measures for the efficiency of an algorithm are Read More »
A. first
B. second
C. third
D. randomly
ANSWER: A
In preorder traversal the root is processed Read More »
A. multidimensional array
B. jagged array
C. row matrix
D. column matrix
ANSWER: B
A. link.
B. nodes.
C. thread.
D. list.
ANSWER: B
In linked storage, linearly ordered sequence of memory cells is called as_ Read More »
A. Big Oh
B. Little Oh
C. Omega
D. Theta
ANSWER: A