Explain the divide and conquer approach of multiplying two large matrices of size 16 x 16. Compute the time complexity of this approach.
Consider the following Graph:
Figure 1: A sample weighted Grари
a) Write the Kruskal's algorithm to find the minimum cost spanning tree of a graph. Also, find the time complexity of Kruskal's algorithm. Demonstrate the use of Kruskal's algorithm and Prim's algorithm to find the minimum cost spanning tree for the Graph given in Figure 1. Show all the steps.
Bellman-Ford's shortest path algorithm for the graph given in Figure 1. Show all the steps of computation.
search (where pi represents the probability that the search will be for the key node ki, whereas qi represents that the search is for dummy node di. Make suitable assumptions, if any)
Expalin the PARTITION algorithm of the Quick Sort taking the last element as pivot. Demonstrate the use of Quick sort algorithm for sorting the following data of size 8: [1, 5, 8, 11, 16, 19, 29, 38]. Compute the complexity of the worst case of Quick Sort algorithm.
See Answer →How can an optimisation problem be represented mathematically. Explain with the help of an example. Explain the steps of designing a Greedy solution for an optimisation problem. Also explain the concept of local and global optimal solutions. Solve the following fractional Knapsack problem using greedy approach. Show all the steps.
See Answer →What is a recurrence relations? When are they used? Solve the following recurrence relations using the Master's method
Here are the equations from the image written in LaTeX format, along with a plain text version.$
$
Write and explain the Insertion sort algorithm. Discuss its best and worst-case time complexity.
See Answer →Write the Right to Left binary exponentiation algorithm. Demonstrate the use of this algorithm to compute the value of 523. Show all steps of the computation. Explain the worst-case complexity of this algorithm.
See Answer →Explain the Big Theta (O) and Big Omega (2) notations with the help of a diagram. What is the need of asymptotic bounds? Also, list the shortcomings of the asymptotic bounds. Find the Big O, O and 2 bounds for the following function:
f(n)=999n3+999999n+100
See Answer →A sorted array of size n contains several duplicate values. Design an algorithm to search a value in the array. The algorithm should output all the indexes where the searched value exists. Explain the worst time complexity of this algorithm.
See Answer →Differentiate between Quadratic-time and Exponential-time algorithms. Give example of one problem each for these two running times.
See Answer →
Design and develop an efficient algorithm to find all the prime numbers in the range 2 to 10000.Access the complexity of this algorithm?
See Answer →Mental and behavioral disorders.
See Answer →Musculoskeletal Diseases
See Answer →Describe the elements and forms of participation. Explain in detail the hierarchy of controls with examples.
See Answer →Enumerate main causes of electrical hazards. Discuss preventive measures.
See Answer →List the steps for early detection of occupational diseases and explain any one in detail.
See Answer →Define occupational hazards. Discuss biological hazards and their impact on
health.
Discuss the role of healthcare waste on human health.
See Answer →Explain the concept of wellbeing. Discuss positive health.
See Answer →
Discuss the existing legislation and policies in India for occupational health.
See Answer →Mental and behavioral disorders.
See Answer →