ANALYSIS OF ALGORITHMS

SAMPLE PAPER QAU SOLUTION HINTS

Q.2 Part (a & b) - Chapter 3 – Section 3.1

Q.3 Part (d)

A similar question like the above and its solution is given

below:
Q.4 - Chapter 15: Exercise 15.2-1

Q.5 Part (b) - Chapter 2: Exercise 2.3-1

Q.6 Part (b) - Chapter 16: Exercise 16.3-3

You have to solve the given question exactly as given in exercise 16.3-3. Just count the Number
of times a letter is appearing in given text as follows:

M: 1 I: 5 S: 4 P: 1 R: 2 V: 1 E: 1 Blank Space: 1
Now you have to solve it according to the method given in text book

Q.7 Part (a) - Chapter 34

Q.7 Part (b) - Chapter 23

Think of it as an adjacency matrix for vertices A-F with weights.

Draw all the vertices, then draw edges with their weights according to
the above table. After the graph is complete, run Kruskal and Prim’s
algorithm according to the method given in your textbook.