Consider the following Graph:

Write an algorithm to multiply two square matrices of order n*n. Also explain the time complexity of this algorithm.

What are the uses of recurrence relations? Solve the following recurrence relations using the Master's method

,

Subset Sum Problem

Assuming that data to be transmitted consists of only characters ‘a’ to ‘g’, design the Huffman code for the following frequencies of character data. Show all the steps of building a huffman tree. Also, show how a coded sequence using Huffman code can be decoded

Define the NP-Hard and NP-Complete problem. How are they different from each other. Explain the use of polynomial time reduction with the help of an example

Given the following sequence of chain multiplication of the matrices. Find the optimal way of multiplying these matrices: