Questions with Complete Solutions - Hamro CSIT

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 the best and worst case for Bubble sort.

Not Answered Design and Analysis of Algorithms Asked on 2082 Exam

Distinguish between recursion and backtracking. Using Miller-Rabin primality test, check whether 53 is prime or not?

Not Answered Design and Analysis of Algorithms Asked on 2082 Exam

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

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

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

Create a PHP form with form elements. Write a program to perform form validation. Use your own assumptions for the validation.

Not Answered Fifth Semester Asked on 2082 Exam

Write a PHP program to show insertion of multiple data into a database table.

Not Answered Fifth Semester Asked on 2082 Exam

HAMROCSIT.COM

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