(Solved) : 1 Main Characteristic Ring Data Structure First Record Points Last Record B Last Record Po Q34868847 . . .
This MCQ in design and analyze of algorithms
1. Main characteristic of “ring”, in Data structure, is (a) First record points only to the last record; (b) Last record points to the first record; (c) Many records point to one record; (d) Each record points to all other records; (e) none of these 2. The height of a complete binary tree is (a) the number of nodes it contains; (b) the maximum path length between two leaf nodes; (c) the number of leaf nodes; (d) the maximum path length from the root to a leaf node; (e) infinite 3. Function g is a lower bound on function f iff for all x, (a) g(x) S f(x); (b) g(x)2 f(x); (c)g o(f); (d) f 2(g) (e) none of these 4. Average case for an algorithm: (a) takes the same time for all data; (b) assumes the data that the algorithm handles in the greatest time; (c) assumes the data that the algorithm handles in the least time; (d) is the expected time considering all possible input data; (e) none of these 5. Graphs are implemented as: (a) trees (b) matrices or arrays of lists (c) queues; (d) stacks; (e) none of these 6. The minimum number of edges in a connected cyclic graph on N vertices is (a) N-1 (b) N (c) N+1 (d) None of these 7. The number of key comparisons made by insertion sort for an array of size 10 is (a) 90 (b) 45 (c) 50 (d) 30 (e) None of the above 8. In a bottom up analysis and design (a) each succeeding phase is more detailed than the phase before it (b) each succeeding phase is as detailed as the phase before it (c) each succeeding phase is less detailed than the phase before it (d) ALL of the above (e) None of the above 9. Matrix multiplication by brute force requires (a) O(n) time; (b) O(1) time; (c) O(n) time; (d) O(n) time; (e) recursion 10. What is the running time of a brute-force algorithm that tells whether an array is sorted? (b) O(log n); (d) O(n log n); (e) Q(n2 Show transcribed image text
Expert Answer
Answer to 1 Main Characteristic Ring Data Structure First Record Points Last Record B Last Record Po Q34868847 . . .
OR