| 141. | The time factor when determining the efficiency of algorithm is measured by? |
| Discuss |
|
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? |
| Discuss |
|
Answer: (b).3
|
| 143. | The upper bound on the time complexity of the nondeterministic sorting algorithm is? |
| Discuss |
|
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 _________. |
| Discuss |
|
Answer: (d).Order of execution
|
| 145. | What is the type of the algorithm used in solving the 8 Queens problem? |
| Discuss |
|
Answer: (a).Backtracking
|
| 146. | Which of the following belongs to the algorithm paradigm? |
| Discuss |
|
Answer: (b).Knapsack problem
|
| 147. | The [] notation is |
| Discuss |
|
Answer: (d).All of the above
|
| 148. | _______ is the process of encoding information using fewer bits than the original representation. |
| Discuss |
|
Answer: (b).Data compression
|
| 149. | How many types of compression there? |
| Discuss |
|
Answer: (c).2
|
| 150. | Which compression loses data? |
| Discuss |
|
Answer: (a).Lossy compression
|
