Differentiate between Polynomial-time and exponential-time algorithms. Give an example of one problem each for these two running times.
Polynomial-time algorithms are those where the runtime increases polynomially with the input size. They are generally considered efficient. Examples include algorithms with time complexities like O(n), O(n^2), or O(n^k), where _______ ______ ______ ___ ___ ______ _____ ___.
_____ ___ _____ ______ ______.
__________ _______ ________ _________ _________ _____.
______ ____ _________ ______ _____ ______ __________.
_______ _______ ________ __________ _____ ___.
_______ ________ ____ _______ ________.
__________ _________ ___ ______ ____ ________.
_____ _____ _______ _____ _______ _________ _______ ________ ___.
_________ ________ _______ __________ ________ ___ ___ ____ __________ ____.
_____ __________ _________ _______ __________ ___ ______.
___ _____ ________ _________ ____ ___ ______ ______.
__________ _______ _____ _________ _________ ________ ________ ____ ________ _______.
________ _________ ___ ____ _________ ____ _______ _______ ___ _______ ___ _______.
_______ _______ __________ _________ __________ ____ _______ _______ _____ _____ ________ ______.
___ ______ ________ _________ ________ ______ _________ ______ ____ _____.
___.
Get Full Answer on WhatsApp
What is a Greedy Approach to Problem-solving? Formulate the fractional Knapsack Problem as an optimisation problem and write a greedy algorithm to solve this problem. Solve the following fractional Knapsack problem using this algorithm. Show all the steps. Suppose there is a knapsack of capacity 15 Kg and 6 items are to packed in it. The weight and profit of the items are as under:
(p1, p2,…, p6) = (3, 2, 4, 5, 1, 6)
(w1, w2,…, w6) = (2, 1, 2, 1, 5, 1)
Consider the following Graph:
Figure 1: Graph for Problem 3(a) and 3(b)
a) Write the Kruskal’s algorithm and Prim’s algorithm to find the minimum cost
spanning tree of the graph given in Figure 1. Show all the steps of computation.
Also, compute the time complexity of both the algorithms.
b) In the Figure 1, find the shortest path from the vertex ‘a’ using Dijkstra’s shortest
path algorithm. Show all the steps of computation. Also, find the time complexity
of the algorithm.
c) What is dynamic programming? What is the principle of Optimality? Use the
dynamic programming approach to find the optimal sequence of chain
multiplication of the following matrices:
| Matrix | Dimension |
| A1 | 5 × 10 |
| A2 | 10 × 20 |
| A3 | 20 × 15 |
| A4 | 15 × 8 |
| A5 | 8 × 10 |
What is a recurrence relation? Solve the following recurrence relations using the Master’s method
a.
b.
What is the purpose of using Huffman Codes? Explain the steps of building a huffman tree. Design the Huffman codes for the following set of characters and their frequencies: a:15, e:19, s:5, d:6, f:4, g:7, h:8, t:10.
Expalin the Partition procedure of the Quick Sort algorithm. Use this procedure and quick sort algorithm to sort the following array of size 8: [12, 9, 17, 15, 23, 19, 16, 24]. Compute the worst case and best case complexity of Quick sort algorithm.
Graph Colouring Problem
State and explain the theorems for computing the bounds O, Ω and Θ. Apply these theorem to find the O-notation, Ω-notation and Θ-notation for the function: