Questions with Complete Solutions - Hamro CSIT

Explain the asymptotic notations used to describe the time/space complexity of any algorithm.

Not Answered No Subject

Write short notes on:
a) Best, Worst and average case complexity

b) Backtracking strategy

Not Answered No Subject

Find the optimal parenthesization for the matrix chain product ABCD with size of each is given as A_5×10, B_10×15 , C_15×20 , D_20×30

Not Answered No Subject

Define greedy algorithm. Find minimum spanning tree of the following graph by using Kruskal algorithm.

Not Answered No Subject

Write down the elements of dynamic programming. Give the recursive defination of LCS problem. Find LCS between sequences S1 = “Dinesh”, S2 = “Dikshya”.

Not Answered No Subject

Solve the recurrence relation T(n) = T(n-1) + 1 when T(0) = 0.

Not Answered No Subject

What is heap? Sort the following data items by using heap sort A[] = {3, 5, 2, 66, 4, 11, 9, 34}.

Not Answered No Subject

What is the purpose of Euclid’s algorithm? Explain with suitable explain.

Not Answered No Subject

Define binary search algorithm. Write down the recursive algorithm for binary search algorithm and analyse it.

Not Answered No Subject

Given a set S ={6, 4, 5, 6, 9} and X=11. Obtain the subset sum using backtracking approach.

Not Answered No Subject

HAMROCSIT.COM

Copyright 2024 | HAMROCSIT.COM | All Right Reserved - Nymna Technology