Question

mfie of a Show The ive chalactse sties

Answer 1

Begin Input: n remainder n % 2 True Output: n is even remainder0 False Output: n is odd End

Algorithm Properties An algorithm must have five properties: 1. Input specified 2. Output specified 3. Definiteness 4. Effectiveness 5. Finiteness

1. Input Specified The input is the data to be transformed during the computation to produce the output. What data do you need to begin to get the result you want? Input precision requires that you know what kind of data, how much and what form the data should be

2. Output Specified computation (your intended result) Frequently the name of the algorithm contains the output: - "Algorithm to compute batting average" Output precision also requires that you know what kind of data, how much and what form the output should be (or evenif there will be any output at all!)

3. Definiteness Algorithms must specify every step and the order the steps must be taken in the process Definiteness means specifying the sequence of operations for turning input into output Details of each step must be also be spelled out (including how to handle errors)

4. Effectiveness For an algorithm to be effective, it means that all those steps that are required to get to output MUST BE DOABLE!

5. Finiteness The algorithm must stop, eventually! Stopping may mean that you get the expected output OR you get a response that no solution is possible Finiteness is not usually an issue for noncomputer algorithms instructions with different data and finiteness may be a problem

Problem-01: Construct the minimum spanning tree (MST) for the given graph using Prim's Algorithm 28 2 16 14 10 3 24 18 12 25 4 5

Step-01: 10 6 Step-02: 10 25

Step-03: 10 6 25 5 4

Step-04: 10 6 3 12 25 5 4 Step-05: 2 16 10 3 12 25 4 22

Step-06: 2 16 14 10 7 3 25 12 5 4 Since all the vertices have been included in the MST, so we stop. Weight of the MST = sum of all edge weights 10 + 25 + 22 + 12 + 16 + 14 99 units