Explain the divide and conquer apprach of multiplying two matrices of large size. Also, explain the Strassen’s matric multiplication algorithm. Find the time complexity of both these approaches.

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

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.

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:

(p₁, p₂,…, p₆) = (3, 2, 4, 5, 1, 6)

(w₁, w₂,…, w₆) = (2, 1, 2, 1, 5, 1)

What is a recurrence relation? Solve the following recurrence relations using the Master’s method

a. 

b. 

Write and explain the linear search algorithm and discuss its best and worstcase time complexity. Show the working of the linear search algorithm for the data: 12, 11, 3, 9, 15, 20, 18, 19, 13, 8, 2, 1, 16.

Explain binary exponentiation for computing the value 5¹⁹. Write the right-toleft binary exponentiation algorithm and show its working for the exponentiation 5¹⁹. Also, find the worst-case complexity of this algorithm

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: See Answer →

Using Horner's rule, evaluate the polynomial p(x)= 2x5 -5x4 -3x2+15 at x=2. Analyse the computation time required for polynomial evaluation using Horner’s rule against the Brute force method.

Differentiate between Polynomial-time and exponential-time algorithms. Give an example of one problem each for these two running times.

Develop an efficient algorithm to find a list of prime numbers from 100 to 1000

What is a Mobile Adhoc Network? What are its advantages and disadvantages?

What is a Virtual Cloud Network? What are its advantages and disadvantages?

List the features of any two Programming Languages that can be used to develop Mobile Applications.

What is a 5G Network? What are its limitations? How can they be overcome?

Explain Bayes classifier with the help of a suitable example. Also discuss its properties

Explain agglomerative hierarchical clustering and its types with the help of a suitable example.

Perform partitional clustering using Frogy’s method for the data given in the table below with k-2 (two clusters). Use first two sample points (3,3) and (6,8) as seed points

Explain K-means clustering methods with the help of a suitable example. Also, discuss the advantages and disadvantages of k -means clustering methods.

What is camera calibration? Explain how it helps to estimate the intrinsic and extrinsic parameters of a camera.