141. The time factor when determining the efficiency of algorithm is measured by?
a. Counting microseconds
b. Counting the number of key operations
c. Counting the number of statements
d. Counting the kilobytes of algorithm
Answer: (b).Counting the number of key operations

142. In an array representation of binary tree the right child of root will be at location of?
a. 2
b. 3
c. 4
d. 6
Answer: (b).3

143. The upper bound on the time complexity of the nondeterministic sorting algorithm is?
a. O(n)
b. O(n log n)
c. O(1)
d. O( log n)
Answer: (a).O(n)

144. In analysis of algorithm, approximate relationship between the size of the job and the amount of work required to do is expressed by using _________.
a. Central tendency
b. Differential equation
c. Order of magnitude
d. Order of execution
Answer: (d).Order of execution

145. What is the type of the algorithm used in solving the 8 Queens problem?
a. Backtracking
b. Dynamic
c. Branch and Bound
d. both a and b
Answer: (a).Backtracking

146. Which of the following belongs to the algorithm paradigm?
a. Minimum & Maximum problem
b. Knapsack problem
c. Selection problem
d. Merge sort
Answer: (b).Knapsack problem

147. The [] notation is
a. Symmetric
b. Reflexive
c. Transitive
d. All of the above
Answer: (d).All of the above

148. _______ is the process of encoding information using fewer bits than the original representation.
a. Data loss
b. Data compression
c. Data transmit
d. Data gain
Answer: (b).Data compression

149. How many types of compression there?
a. 4
b. 3
c. 2
d. 5
Answer: (c).2

150. Which compression loses data?
a. Lossy compression
b. Lossless compression
c. both a and b
d. None of the above
Answer: (a).Lossy compression