CS502 – DESIGN & ANALYSIS OF ALGORITHMS QUIZ 1 8-6-2022 | MEGA File 1288 pages| 95-100 % Marks
CS 502 – DESIGN & ANALYSIS OF ALGORITHMS
Fall 2021 Quiz NO. 2 8-6-2022
Solution given in Video
1. If pj dominates pi and pi dominates ph then pj also dominates ph. It means dominance relation is
Transitive
2. The important factors to measure the running time of the brute-force 2-d maxima algorithm are
All of above
3. The brute-force algorithm for 2D-Maxima runs in order O( ) time.
n*n
4. The process of ends when you are left with such tiny pieces remaining that it is trivial to solve them.
Divide and Conquer
5. If the time complexity of an algorithm is O(n), then it is called _______time complexity.
Linear Time
1. In plane sweep approach, a vertical line is swept across the 2d-plane from
Left to Right
2. Theta(1) means
Complexity of Algorithm
Upper & lower bounds
3. ________of reference is an important fact of current processor technology.
Locality
4. The time assumed for each basic operation to execute on RAM model of computation is
Infinite
5. In the statement
"if ", the number of times elements of P are accessed is
4 Answer
PLEASE WATCH THE VIDEO TO GET THE FILE PASSWORD.