Question

please help me its my



Final Examination Paper (Fall 2020)
Subject: Design and Analysis of Algorithm
BSCS 7th, 8th

Write brief answers to the following questions. Avoid unnecessary details.
Q1. Write SHORT comment on the following statements. The statements may or may not be true. 5x4=20
⦁ Performance often draws the line between what is feasible and what is impossible.
Algorithms help us to understand scalability. Performance often draws the line between what is feasible and what is impossible. ... Explanation: An algorithm becomes a program when it is written in the form of a programming language. Thus, any program is an algorithm.
⦁ Algorithms can be represented using syntax.
⦁ A Queue follows the FIFO principle.
⦁ Different implementations of the same algorithm can lead to different efficiency measures.
⦁ Different platforms running the same algorithm always take the same amount of time.
Q2. Write three applications of finding shortest path. 10
Q3. How do you decide that a given problem should be solved using dynamic programming? 10
Q4. Compare linear search and binary search in terms of accuracy and efficiency. 10

Answer 1

Answer:

qwerty IKHCCSETHNN afawdvnmgqweyn