Questions with Complete Solutions - Hamro CSIT

Justify the worst case for binary search. Find the edit distance from the string “RELEVANT” to “ELEPHANT” using dynamic programming approach.

Not Answered Design and Analysis of Algorithms Asked on 2082 Exam

State the time and space complexity for sequential search. Write the rules for master theorem for finding asymptotic bounds.

Not Answered Design and Analysis of Algorithms Asked on 2082 Exam

Define class P and NP problem. Why do we need approximation algorithms? Justify.

Not Answered Design and Analysis of Algorithms Asked on 2082 Exam

Find all possible subsets of the integers that sum to 21 in the array {5, 6, 10, 11, 15} using back tracking technique.

Not Answered Design and Analysis of Algorithms Asked on 2082 Exam

Using Extended Euclidean Algorithm, find the GCD of 12 and 16.

Not Answered Design and Analysis of Algorithms Asked on 2082 Exam

Find the best and worst case for Bubble sort.

Not Answered Design and Analysis of Algorithms Asked on 2082 Exam

Solve the recurrence relation T(n) = 2T(n/2) + n using recursion tree method.

Not Answered Design and Analysis of Algorithms Asked on 2082 Exam

Distinguish between dynamic programming and memorization. Parenthesize the matrices A(30 × 1), B(1 × 40), C(40 × 10) and A(10 × 15), for computing matrix multiplication using dynamic programming.

Not Answered Design and Analysis of Algorithms Asked on 2082 Exam

What is order statistics? Write and analyze the algorithm for randomized quick sort.

Not Answered Design and Analysis of Algorithms Asked on 2082 Exam

How do you define optimal solution? Does greedy algorithm always guarantee optimal solution? Given the string “SUPER DUPER CSIT”, use a Greedy algorithm to build a Huffman tree.

Not Answered Design and Analysis of Algorithms Asked on 2082 Exam

HAMROCSIT.COM

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