Questions with Complete Solutions - Hamro CSIT

Define cloud computing service. Describe each of PaaS, SaaS and IaaS with suitable examples.

Not Answered Introduction to Cloud Computing Asked on 2081 Exam

Write short notes on:

a) Big Oh, Big Omega, Big theta

b) Class P, Class NP and NP-Complete

Not Answered Design and Analysis of Algorithms Asked on 2081 Exam

What is the worst case of quick sort and how does randomize quick sort handle this problem? Sort the data { -2, 4, -3, 6, 12, 10, 11, 13, 9 } using quick sort.

Not Answered Design and Analysis of Algorithms Asked on 2081 Exam

Discuss about recursion and backtracking. Analyze the complexity of Miller Rabin Randomized Primality test.

Not Answered Design and Analysis of Algorithms Asked on 2081 Exam

Explain the approximation algorithm for vertex cover of a connected graph with an example.

Not Answered Design and Analysis of Algorithms Asked on 2081 Exam

State cooks theorem. Discuss about problem reducibility.

Not Answered Design and Analysis of Algorithms Asked on 2081 Exam

Write an algorithm to find the n^th fibonacci number with its time and space complexity.

Not Answered Design and Analysis of Algorithms Asked on 2081 Exam

Does greedy algorithm guarantee optimal solution? Solve the Fractional knapsack problem to find maximum loot from given information.

Item 1 2 3 4 5 6 7

Value 12 10 20 15 2 3 50

Weight (kgs) 2 1 3 2 12 10 1

Not Answered Design and Analysis of Algorithms Asked on 2081 Exam

Differentiate between dynamic programming and memorization. Compute the shortest path between every pairs in the following graphs using Floyd Warshal algorithm.

Not Answered Design and Analysis of Algorithms Asked on 2081 Exam

Solve the following linear equation using Chinese Remainder Theorem.

x = 1 MOD 3

x = 2 MOD 5

x = 0 MOD 7

Not Answered Design and Analysis of Algorithms Asked on 2081 Exam

HAMROCSIT.COM

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