ADVANCED TOPICS IN COMPILER DESIGN
PARALLEL AND DISTRIBUTED COMPILERS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Painting a picture
|
|
|
Washing a car
|
|
|
Writing a poem
|
|
|
Calculating the average of numeric inputs
|
Detailed explanation-1: -Best-case analysis of an algorithm The best-case running time is the time taken by the best-case input, i.e., an input for which our algorithm executes minimum number of operations. It gives us a lower bound of the running time and guarantees that the algorithm will never take less time than that.
Detailed explanation-2: -Using asymptotic analysis, we can very well conclude the best case, average case, and worst case scenario of an algorithm.
Detailed explanation-3: -Write an algorithm for finding the average of two numbers and also draw a flowchart. Algorithm: Input: two numbers x and y Output: the average of x and y Step 1 : input x, y Step 2: sum=0, average=0 Step 3:sum = x + y Step 4:average = sum /2 Step 5: print average. More items