Assignment
4
Q1) Answer
the following
1)List all algorithms that use divide and
conquer strategy.
2) Define minimum spanning tree.
3) What do you mean by longest common
subsequence problem?
4) Define: - i) Tree edge ii) Back edge
5) Define Optimization problem with
example
6)
What is NP HARD?
7) What is Matrix chain multiplication?
8) Define 1) Cross edge 2) Tree edge3) Cut
edge4) Bridge edge
9) What are Limitations of Merge-sort?
10) Define Spanning tree and What is MST?
11)Explain Bellman-Ford algorithm with
example.
12) Explain sum of subset problem with
example
13) Define FIFOBB and LIFOBB.
14) Give the implicit and explicit
constraints of 8-queen’s problem.
15) State the 0/1 knapsack problem which
uses Branch and Bound technique
16) Explain NP - complete class of
problems
17) State the 0/1 knapsack problem which
uses Branch and Bound technique
18) What is the Knapsack problem?
19)What are FIFO BB &
LIFO BB
20)Explain Prims
algorithm with example
21)Explain
Hamiltonian graph with example
1)Is Quick Sort is
fastest algorithm
3) Justify whether 0-1
Knapsack problem can be solved using Greedy algorithm
4)
Why Fractional knapsack problem is also known as continuous knapsack problem.
5) Why Time complexity of fractional knapsack
problem is O (n log n)
6) state true or false with Justification that
Fractional knapsack problem can be solved in time O(n).
Milan Tomic
Hi. I’m Designer of Blog Magic. I’m CEO/Founder of ThemeXpose. I’m Creative Art Director, Web Designer, UI/UX Designer, Interaction Designer, Industrial Designer, Web Developer, Business Enthusiast, StartUp Enthusiast, Speaker, Writer and Photographer. Inspired to make things looks better.
0 comments:
Post a Comment