Compare and contrast an algorithm and a program (4 marks
Question
Compare and contrast an algorithm and a program (4 marks
Solution
-
Definition (1 mark): An algorithm is a well-defined sequence of steps that provides a solution for a specific problem, while a program is a sequence of instructions written in a specific programming language to perform a specific task.
-
Functionality (1 mark): An algorithm is a conceptual entity which describes the method to solve a problem. It doesn't depend on any programming languages. On the other hand, a program is a practical implementation of an algorithm or algorithms in a specific programming language.
-
Dependence (1 mark): An algorithm is independent of any programming languages as it is just the blueprint or plan of a solution to a problem. However, a program is dependent on a programming language. The same algorithm can be implemented in different programming languages, resulting in different programs.
-
Modification (1 mark): If a change is required, an algorithm can be modified without affecting the programs until the programs are not updated as per the new algorithm. But if a program is modified, it may or may not require changes in the algorithm.
Similar Questions
Algorithm Analysis
list the characteristics of a good algorithm
Algorithm A 1. Set sum = 0. // 1 assignment2. Set i = 0. // 1 assignment 3. While (i <= n): // n comparisonsa.Set sum = sum + i. // n arithmetic operations, n assignmentsb.Increment i by 1. // n increments 4.Display (sum). // 1 write Algorithm B 1.Set sum = (n × (n + 1))/2. // 3 arithmetic operations, 1 assignment2.Display (sum). // 1 write Both, Algorithm A and Algorithm B, perform the same task. This means that both determine the sum of the first nnatural numbers. Algorithm A adds each number iteratively to a variable, sum. However, Algorithm B uses a formula to calculate the sum of the first n natural numbers. The execution time required for Algorithm A is given by:T = (n + 2) × a + n × b + 1 × c + n × d + n × eT = an + 2n + bn + c + dn + enT = c + n (a + b + d + e + 2)As T is a linear function of n, the algorithm is of the order, O (n).Now, determine the time required to execute Algorithm B:T = 1 × a +1 × c + 3 × eT = a + c + 3eUnlike Algorithm A, the time taken by Algorithm B is constant and does not depend on the value of n. Therefore, the algorithm is of the order __________ ?
Compare and contrast Linked lists and arrays.
what is algorithm
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.