QUESTION BANK

Subject:Analysis and Design of algorithm(2150703)

Semester:V(IT)
Term:June-2019 to October-2019

UNIT:1 BASICS OF ALGORITHM AND MATHEMATICS

Sr.
Questions
No.

1 Define an algorithm. List various criteria used for analyzing an algorithm.

2 Define Algorithm, Time Complexity and Space Complexity

3 What is an algorithm?

4 What is worst case time complexity ?

5 Define space complexity.

6 Define Big Omega Asymptotic Notation.

7 Define Feasible Solution.

8 What is vector? Which operations are performed on vector?

9 List types of algorithms

10 Define Following: Quantifier, Algorithm

11 Define Algorithm. Discuss key characteristics of algorithm.

12 Prove or disprove that f(n) = 1 + 2 + 3 + .... + n Θ (n^2

 UNIT:2 ANALYSIS OF ALGORITHM

Sr.
Questions
No.
What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running
1
time is 2n on the same machine?

2 What do you mean by asymptotic notation? Describe in brief any three asymptotic notations used for algorithm analysis.

Let f(n) and g(n) be asymptotically nonnegative functions. Using the basic definition of Θ-notation, prove that
3
max(f(n), g(n)) = Θ (f(n) + g(n)).

4 Define amortized analysis. Briefly explain its two techniques.

5 Analyze Selection sort algorithm in best case and worst case.

6 Write down the Best case, Worst Case and Average case Complexity for selection sort.

7 Write down the Best case, Worst Case and Average case Complexity for Heap sort.

8 Apply the bubble sort algorithm for sorting {U,N,I,V,E,R,S}

9 Analyze Selection sort algorithm in best case and worst case.

10 Why do we use asymptotic notations in the study of algorithms? Briefly describe the commonly used asymptotic notations.

11 What is an amortized analysis? Explain aggregate method of amortized analysis using suitable example

12 Sort the letters of word “EDUCATION” in alphabetical order using insertion sort.

Define Following:
13
(I) Big ‘Oh’ Notation
(II) Big ‘Omega’ Notation
14 Sort the given elements with Heap Sort Method: 20, 50, 30, 75, 90, 60, 25, 10, 40.

15 Which are the basic steps of counting sort? Write counting sort algorithm.

16 Derive its time complexity in worst case.

 UNIT:3 DIVIDE AND CONQUER ALGORITHM

Sr.
Questions
No.

1 What do you mean by Divide & Conquer approach?List advantages and disadvantages of it.

2 Solve the following recurrence relation using iteration method. T(n) = 8T(n/2)+n2 Here T(1) = 1.

3 Solve the following recurrence relation using substitution method. T(n) =2T(n/2) + n. Here T(1) = 1.

4 Solve the recurrence T(n) = 7T(n/2) +n3

Write Merge sort algorithm and compute its worst case and best-case time complexity. Sort the List G,U,J,A,R,A,T in
5
alphabetical order using merge sort.

6 Demonstrate Binary Search method to search Key = 14, form the array A=<2,4,7,8,10,13,14,60> .

7 Explain Tower of Hanoi Problem, Derive its recursion equation and computer it’s time complexity.

8 Write down the Best case, Worst Case and Average case Complexity for merge sort.

9 Analyze Quick sort algorithm in best case and worst case.

10 Solve following recurrence using master method T(n) = 9T(n/3) +n

11 Solve following recurrence using master method T(n) = T(2n/3) + 1

12 Multiply 981 by 1234 by divide and conquer method.

Explain the use of Divide and Conque Technique for Binary Search Method.What is Complexity of Binary Search
13
Method?Explain it with Example.

14 Write a program/algorithm of Quick Sort Method and analyze it with example.

15 Discuss matrix multiplication problem using divide and conquer technique.

What is recurrence? Solve recurrence equation T (n) =T (n-1) + n using forward substitution and backward substitution
16
method.
Write an algorithm for quick sort and derive best case, worst case using divide and conquer technique also trace given data
17
(3,1,4,5,9,2,6,5)

18 Solve following recurrence using recursion tree method: T(n) = 3T(n/3) +n^3

Write standard(conventional) algorithm and Strassen's algorithm for matrix algorithm for matrix multiplication problem. What
19
is the recurrence for Strassen's algorithm?Solve it using master method to derive time complexity of Strassen's algorithm

20 Discuss best case, average case and worst case time complexity of quick sort.
 UNIT:4 DYNAMIC PROGRAMMING

Sr.
Questions
No.

1 Differentiate between greedy method and dynamic programming.

Find optimal sequence of multiplication using dynamic programming of following matrices: A1[10x100], A2[100x5], A3[5x50]
2
and A4[50x1]. List optimal number of multiplication and parenthesization of matrices.

Describe longest common subsequence problem. Find longest common subsequence of following two strings X and Y using
3
dynamic programming. X=abbacdcba, Y=bcdbbcaac.

4 Discuss and derive an equation for solving the 0/1 Knapsack problem using dynamic programming method.

5 Consider Knapsack capacity W=9, w = (3,4,5,7) and v=(12,40,25,42).find the maximum profit using dynamic method.

6 Solve Making change problem using dynamic technique. d1 = 1, d2=2,d3=4, d4=6, Calculate for making change of Rs. 10.

7 Find out the NCR (5 3)Using Dynamic Method.

8 For the following chain of matrices find the order of parenthesization for the optimal chain multiplication (13,5,89,3,34).

9 Find out LCS of A={K,A,N,D,L,A,P} and B = {A,N,D,L}

10 Explain Principle of Optimality with example.

11 Solve Making change problem using dynamic technique. D1 = 1, d2=3, d3=5, d4=6. Calculate for making change of Rs. 8.

12 Given two sequence of characters, X={G,U,J,A,R,A,T}, Y = {J,R,A,T} obtain the longest common subsequence.

13 For the following chain of matrices find the order of parenthesization for the optimal chain multiplication (15,5,10,20,25)

14 Discuss Assembly Line Scheduling problem using dynamic programming with example.

15 Explain Chained Matrix Multiplication with example.

Write equation for Chained matrix multiplication using Dynamic programming. Find out optimal sequence for multiplication:
16
A1 [5 × 4], A2 [4 × 6], A3 [6 × 2], and A4 [2 × 7]. Also give the optimal parenthesization of matrices.
Explain how to find out Longest Common Subsequence of two strings using Dynamic Programming method. Find any one
17 Longest Common Subsequence of given two strings using Dynamic Programming.
X=abbacdcba
Y=bcdbbcaac
Solve Making Change problem using Dynamic Programming. (Denominations: d1=1, d2=4, d3=6). Give your answer for
18
making change of Rs. 9.

19 What are the advantages of dynamic programming method over devide conquer method?

Which are the three basic steps of the development of the dynamic programming algorithm? Mention any two examples of
20
dynamic programming that we are using in real life.

Solve the following making change problem using dynamic programming method: Amount = Rs. 7 and Denominations: (Rs. 1,
21
Rs. 2 and Rs. 4)
 UNIT:5 GREEDY ALGORITHM

Sr.
Questions
No.

1 Differentiate between greedy method and dynamic programming.

2 Prove that the fractional knapsack problem has the greedy-choice property.

3 Briefly describe greedy choice property and optimal substructure.

Suppose that we have a set of activities to schedule among a large number of lecture halls, where any activity can take place in any lecture hall.
4 We wish to schedule all the activities using as few lecture halls as possible. Give an efficient greedy algorithm to determine which activity should
use which lecture hall.
Find out the Minimum Spanning Tree using Kruskal Algorithm for given Graph.

Find all pair of shortest path using Floyd’s Algorithm for given graph

7 Write down the characteristics of Greedy Algorithm.

8 Compute MST using PRIM’s Algorithm.

9 Find an optimal Huffman code for the following set of frequency. a : 50, b: 20, c: 15, d: 30.

10 Consider Kanpsack capacity W=50, w=(10,20,40) and v=(60,80,100) find the maximum profit using greedy approach.

11 Expalin Dijkstra algorithm to find the shortest path.

12 Define MST. Explain Kruskal’s algorithm with example for construction of MST.

13 Explain in brief characteristics of greedy algorithms. Compare Greedy Method with Dynamic Programming Method.

Write the Prim’s Algorithm to find out Minimum Spanning Tree. Apply the same and find MST for the graph given below.

14

Write Huffman code algorithm and Generate Huffman code for following

15 Letters A B C D E

Frequency 24 12 10 8 8

Using greedy algorithm find an optimal schedule for following jobs with n=6.
16
Profits: (P1,P2,P3,P4,P5,P6) = (20, 15, 10, 7, 5, 3)
Deadline: (d1,d2,d3,d4,d5,d6) =(3, 1, 1, 3, 1, 3)
17 Justify with example that shortest path problem satisfies the principle of optimality.

18 Discuss general characteristics of greedy method. Mention any two examples of greedy method that we are using in real life.

19 Solve all pair shortest path problem for the following graph using Floyd's algorithm.
20 What are the disadvantages of greedy method over dynamic programming Method?

Solve the following Knapsack Problem using greedy method. Number of items = 5, knapsack capacity W = 100, weight vector = {50, 40, 30, 20,
21
10} and profit vector = {1, 2, 3, 4, 5}.

22 Write an algorithm for Huffman code.

Find minimum spanning tree for the following undirected weighted graph using Kruskal’s algorithm.

23
 UNIT:6 EXPLORING GRAPHS

Sr.
Questions
No.

1 Differentiate between depth first search and breadth first search.

List applications of a minimum spanning tree. Find minimum spanning tree using Krushkal’s algorithm of the following graph.

3 Define graph. Describe strongly connected graph with example

Given an adjacency-list representation of a directed graph, how long does it take to compute the out-degree of every vertex?
4
How long does it take to compute the in-degrees?
Define minimum spanning tree. Find minimum spanning tree using Prim’s algorithm of the following graph.

6 Explain: Articulation Point, Graph, Tree

Find single source shortest path using Dijkstra’s algorithm form a to e.

8 Define BFS. How it is differ from DFS.

9 Explain DFS algorithm in brief.

10 Define Directed Acyclic Graph.

11 Define Minimum Spanning Tree.

12 Explain Breadth First Traversal Method for Graph with algorithm.

13 Explain Depth First Traversal Method for Graph with algorithm.

14 Explain Depth First Traversal Method for Graph with algorithm with example.

15 Explain Breath First Traversal Method for Graph with algorithm with example.
16 Justify with example that longest path problem does not satisfy the principle of optimality.

What is DFS? Explain with example. Show the ordering of vertices produced by Topological sort for the following graph.

17

18 Explain breadth first search with example.

 UNIT:7 BACKTRACKING AND BARNCH & BOUND

Sr.
Questions
No.

1 Define backtracking. State types of constraints used in backtracking

2 Differentiate branch and bound and back tracking algorithm.

Solve the following instance of knapsack problem using Backtracking Technique. The Capacity of the Knapsack W = 8 and w = (2,3,4,5)
3
and value v = (3,5,6,10)

4 Draw the state space tree Diagram for 4 Queen problem.

5 Explain 4 queen problem with one of the solution,

6 Explain Traveling salesman problem with example.

7 Explain Backtracking Method. What is N-Queens Problem? Give solution of 4 Queens Problem using Backtracking Method.

8 Explain use of branch and bound technique for solving assignment problem.
 UNIT:8 STRING MATCHING

Sr.
Questions
No.

1 Show the comparisons the naive string matcher makes for the pattern P=0001 in the text T=000010001010001.

Working modulo q=11, how many spurious hits does the Rabin-Karp matcher encounter in the text T=3141592653589793 when
2
looking for the pattern P=26?

3 Explain finite automata algorithm for string matching.

4 Explain naïve string matching algorithm with example.

5 What is Finite Automata? Explain use of finite automata for string matching with suitable example.

6 What is Rabin Karp algorithm? Where it is used? Explain the concept behind this algorithm and calculate its time complexity

What is the basic idea behind Rabin – Karp algorithm? What is expected running time of this algorithm ? Explain it with
7
example.

8 Give and explain Rabin-Carp string matching algorithm with example.

9 Write Naive string matching algorithm. Explain notations used in the algorithm.
 UNIT:9 INTRODUCTION TO NP-COMPLETENESS

Sr.
Questions
No.

1 State whether travelling salesman problem is a NP-Complete problem? Justify your answer.

2 Prove that if G is an undirected bipartite graph with an odd number of vertices, then G is nonhamiltonian.

3 Define P, NP, NP-Hard and NP-Complete Problem.

4 Define P-type Problem.

5 Write a brief note on NP-completeness and the classes-P, NP and NPC.

6 Define P, NP, NP complete and NP-Hard problems. Give examples of each.

7 What is an approximation algorithm? Explain performance ratio for approximation algorithm.

8 Explain polynomial time reduction algorithm.

9 Which are the three major concepts used to show that a problem is an NP Complete problem?
 QUESTION BANK

UNIT:1 INTRODUCTION
Sr.
Questions
No.
1 Define an algorithm. List various criteria used for analyzing an algorithm.
2 Define Algorithm, Time Complexity and Space Complexity
3 What is an algorithm?
4 What is worst case time complexity ?
5 Define space complexity.
6 Define Big Omega Asymptotic Notation.
7 Define Feasible Solution.
8 What is vector? Which operations are performed on vector?
9 List types of algorithms
10 Define Following: Quantifier, Algorithm
11 Define Algorithm. Discuss key characteristics of algorithm.
12 Prove or disprove that f(n) = 1 + 2 + 3 + .... + n Θ (n^2

UNIT:2 ANALYSIS OF ALGORITHM

Sr.
Questions
No.
1 What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an
2 What do you mean by asymptotic notation? Describe in brief any three asymptotic notations used for a
3 Let f(n) and g(n) be asymptotically nonnegative functions. Using the basic definition of Θ-notation, pro
4 Define amortized analysis. Briefly explain its two techniques.
5 Analyze Selection sort algorithm in best case and worst case.
6 Write down the Best case, Worst Case and Average case Complexity for selection sort.
7 Write down the Best case, Worst Case and Average case Complexity for Heap sort.
8 Apply the bubble sort algorithm for sorting {U,N,I,V,E,R,S}
9 Analyze Selection sort algorithm in best case and worst case.
10 Why do we use asymptotic notations in the study of algorithms? Briefly describe the commonly used a
11 What is an amortized analysis? Explain aggregate method of amortized analysis using suitable example
12 Sort the letters of word “EDUCATION” in alphabetical order using insertion sort.
13 Define Following:
14 Sort the given elements with Heap Sort Method: 20, 50, 30, 75, 90, 60, 25, 10, 40.
15 Which are the basic steps of counting sort? Write counting sort algorithm.
16 Derive its time complexity in worst case.

UNIT:3 DIVIDE AND CONQUER ALGORITHM

Sr.
Questions
No.
1 What do you mean by Divide & Conquer approach?List advantages and disadvantages of it.
2 Solve the following recurrence relation using iteration method. T(n) = 8T(n/2)+n2 Here T(1) = 1.
3 Solve the following recurrence relation using substitution method. T(n) =2T(n/2) + n. Here T(1) = 1.
4 Solve the recurrence T(n) = 7T(n/2) +n3
5 Write Merge sort algorithm and compute its worst case and best-case time complexity. Sort the List G,
 6 Demonstrate Binary Search method to search Key = 14, form the array A=<2,4,7,8,10,13,14,60> .
7 Explain Tower of Hanoi Problem, Derive its recursion equation and computer it’s time complexity.
8 Write down the Best case, Worst Case and Average case Complexity for merge sort.
9 Analyze Quick sort algorithm in best case and worst case.
10 Solve following recurrence using master method T(n) = 9T(n/3) +n
11 Solve following recurrence using master method T(n) = T(2n/3) + 1
12 Multiply 981 by 1234 by divide and conquer method.
13 Explain the use of Divide and Conque Technique for Binary Search Method.What is Complexity of Bi
14 Write a program/algorithm of Quick Sort Method and analyze it with example.
15 Discuss matrix multiplication problem using divide and conquer technique.
16 What is recurrence? Solve recurrence equation T (n) =T (n-1) + n using forward substitution and backw
17 Write an algorithm for quick sort and derive best case, worst case using divide and conquer technique a
18 Solve following recurrence using recursion tree method: T(n) = 3T(n/3) +n^3
19 Write standard(conventional) algorithm and Strassen's algorithm for matrix algorithm for matrix multip
20 Discuss best case, average case and worst case time complexity of quick sort.

UNIT:4 DYNAMIC PROGRAMMING

Sr.
Questions
No.
1 Differentiate between greedy method and dynamic programming.
Find optimal sequence of multiplication using dynamic programming of following matrices: A1[10x10
2 A3[5x50] and A4[50x1]. List optimal number of multiplication and parenthesization of matrices.
3 Describe longest common subsequence problem. Find longest common subsequence of following two
4 Discuss and derive an equation for solving the 0/1 Knapsack problem using dynamic programming me
5 Consider Knapsack capacity W=9, w = (3,4,5,7) and v=(12,40,25,42).find the maximum profit using d
6 Solve Making change problem using dynamic technique. d1 = 1, d2=2,d3=4, d4=6, Calculate for makin
7 Find out the NCR (5 3)Using Dynamic Method.
8 For the following chain of matrices find the order of parenthesization for the optimal chain multiplicati
9 Find out LCS of A={K,A,N,D,L,A,P} and B = {A,N,D,L}
10 Explain Principle of Optimality with example.
11 Solve Making change problem using dynamic technique. D1 = 1, d2=3, d3=5, d4=6. Calculate for mak
12 Given two sequence of characters, X={G,U,J,A,R,A,T}, Y = {J,R,A,T} obtain the longest common sub
13 For the following chain of matrices find the order of parenthesization for the optimal chain multiplicati
14 Discuss Assembly Line Scheduling problem using dynamic programming with example.
15 Explain Chained Matrix Multiplication with example.
16 Write equation for Chained matrix multiplication using Dynamic programming. Find out optimal sequ
17 Explain how to find out Longest Common Subsequence of two strings using Dynamic Programming m
18 Solve Making Change problem using Dynamic Programming. (Denominations: d1=1, d2=4, d3=6). Gi
19 What are the advantages of dynamic programming method over devide conquer method?
20 Which are the three basic steps of the development of the dynamic programming algorithm? Mention a
21 Solve the following making change problem using dynamic programming method: Amount = Rs. 7 and

UNIT:5 GREEDY ALGORITHM

Sr.
Questions
No.
1 Differentiate between greedy method and dynamic programming.
2 Prove that the fractional knapsack problem has the greedy-choice property.
 3 Briefly describe greedy choice property and optimal substructure.
4 Suppose that we have a set of activities to schedule among a large number of lecture halls, where any a
Find out the Minimum Spanning Tree using Kruskal Algorithm for given Graph.
5
Find all pair of shortest path using Floyd’s Algorithm for given graph
6
7 Write down the characteristics of Greedy Algorithm.
8 Compute MST using PRIM’s Algorithm.
9 Find an optimal Huffman code for the following set of frequency. a : 50, b: 20, c: 15, d: 30.
10 Consider Kanpsack capacity W=50, w=(10,20,40) and v=(60,80,100) find the maximum profit using g
11 Expalin Dijkstra algorithm to find the shortest path.
12 Define MST. Explain Kruskal’s algorithm with example for construction of MST.
13 Explain in brief characteristics of greedy algorithms. Compare Greedy Method with Dynamic Program
14 Write the Prim’s Algorithm to find out Minimum Spanning Tree. Apply the same and find MST for the

Write Huffman code algorithm and Generate Huffman code for following
Letters A B C D E
15
Frequenc
y 24 12 10 8 8
16 Using greedy algorithm find an optimal schedule for following jobs with n=6.
17 Justify with example that shortest path problem satisfies the principle of optimality.
18 Discuss general characteristics of greedy method. Mention any two examples of greedy method that we
19 Solve all pair shortest path problem for the following graph using Floyd's algorithm.

20 What are the disadvantages of greedy method over dynamic programming Method?
21 Solve the following Knapsack Problem using greedy method. Number of items = 5, knapsack capacity
22 Write an algorithm for Huffman code.
Find minimum spanning tree for the following undirected weighted graph using Kruskal’s algorithm.
23

UNIT:6 EXPLORING GRAPHS

Sr.
Questions
No.
1 Differentiate between depth first search and breadth first search.
List applications of a minimum spanning tree. Find minimum spanning tree using Krushkal’s algorithm
2
3 Define graph. Describe strongly connected graph with example
4 Given an adjacency-list representation of a directed graph, how long does it take to compute the out-de
5 Define minimum spanning tree. Find minimum spanning tree using Prim’s algorithm of the following

6 Explain: Articulation Point, Graph, Tree

Find single source shortest path using Dijkstra’s algorithm form a to e.
7
8 Define BFS. How it is differ from DFS.
9 Explain DFS algorithm in brief.
10 Define Directed Acyclic Graph.
11 Define Minimum Spanning Tree.
12 Explain Breadth First Traversal Method for Graph with algorithm.
13 Explain Depth First Traversal Method for Graph with algorithm.
14 Explain Depth First Traversal Method for Graph with algorithm with example.
15 Explain Breath First Traversal Method for Graph with algorithm with example.
16 Justify with example that longest path problem does not satisfy the principle of optimality.
What is DFS? Explain with example. Show the ordering of vertices produced by Topological sort for t
17
18 Explain breadth first search with example.

UNIT:7 BACKTRACKING AND BARNCH & BOUND

Sr.
Questions
No.
1 Define backtracking. State types of constraints used in backtracking
2 Differentiate branch and bound and back tracking algorithm.
3 Solve the following instance of knapsack problem using Backtracking Technique. The Capacity of the Knapsac
4 Draw the state space tree Diagram for 4 Queen problem.
5 Explain 4 queen problem with one of the solution,
6 Explain Traveling salesman problem with example.
7 Explain Backtracking Method. What is N-Queens Problem? Give solution of 4 Queens Problem using Backtrac
8 Explain use of branch and bound technique for solving assignment problem.

UNIT:8 STRING MATCHING

Sr.
Questions
No.
1 Show the comparisons the naive string matcher makes for the pattern P=0001 in the text T=000010001
2 Working modulo q=11, how many spurious hits does the Rabin-Karp matcher encounter in the text T=
3 Explain finite automata algorithm for string matching.
4 Explain naïve string matching algorithm with example.
5 What is Finite Automata? Explain use of finite automata for string matching with suitable example.
6 What is Rabin Karp algorithm? Where it is used? Explain the concept behind this algorithm and calcul
7 What is the basic idea behind Rabin – Karp algorithm? What is expected running time of this algorithm
8 Give and explain Rabin-Carp string matching algorithm with example.
9 Write Naive string matching algorithm. Explain notations used in the algorithm.

UNIT:9 Introduction to Np-completeness

Sr.
Questions
No.
1 State whether travelling salesman problem is a NP-Complete problem? Justify your answer.
2 Prove that if G is an undirected bipartite graph with an odd number of vertices, then G is nonhamiltoni
3 Define P, NP, NP-Hard and NP-Complete Problem.
4 Define P-type Problem.
5 Write a brief note on NP-completeness and the classes-P, NP and NPC.
6 Define P, NP, NP complete and NP-Hard problems. Give examples of each.
7 What is an approximation algorithm? Explain performance ratio for approximation algorithm.
8 Explain polynomial time reduction algorithm.
9 Which are the three major concepts used to show that a problem is an NP Complete problem?
RITHM

is 100n2 runs faster than an algorithm whose running

mptotic notations used for algorithm analysis.
definition of Θ-notation, prove that

election sort.
eap sort.

scribe the commonly used asymptotic notations.

alysis using suitable example
on sort.

10, 40.

LGORITHM

sadvantages of it.
n/2)+n2 Here T(1) = 1.
T(n/2) + n. Here T(1) = 1.

complexity. Sort the List G,U,J,A,R,A,T

<2,4,7,8,10,13,14,60> .
uter it’s time complexity.
erge sort.

d.What is Complexity of Binary Search

mple.
.
ward substitution and backward
vide and conquer technique also trace
^3
x algorithm for matrix multiplication
ort.

MMING

llowing matrices: A1[10x100], A2[100x5],

hesization of matrices.
bsequence of following two strings X and Y using
g dynamic programming method.
the maximum profit using dynamic method.
4, d4=6, Calculate for making change of Rs. 10.

he optimal chain multiplication (13,5,89,3,34).

=5, d4=6. Calculate for making change of Rs. 8.

tain the longest common subsequence.
he optimal chain multiplication (15,5,10,20,25)
with example.

ming. Find out optimal sequence for multiplication:

ng Dynamic Programming method. Find any one
ions: d1=1, d2=4, d3=6). Give your answer for
nquer method?
mming algorithm? Mention any two examples of
method: Amount = Rs. 7 and Denominations: (Rs. 1,

THM
of lecture halls, where any activity can take place in
Graph.

20, c: 15, d: 30.

the maximum profit using greedy approach.

f MST.
hod with Dynamic Programming Method.
e same and find MST for the graph given below.

=6.
ptimality.
es of greedy method that we are using in real life.
lgorithm.

Method?
ems = 5, knapsack capacity W = 100, weight vector

using Kruskal’s algorithm.

PHS

e using Krushkal’s algorithm of the following graph.

t take to compute the out-degree of every vertex?

algorithm of the following graph.
mple.
mple.
le of optimality.
ed by Topological sort for the following graph.

CH & BOUND

. The Capacity of the Knapsack W = 8 and w = (2,3,4,5)

ueens Problem using Backtracking Method.

NG

01 in the text T=000010001010001.

her encounter in the text T=3141592653589793

ng with suitable example.

nd this algorithm and calculate its time complexity
unning time of this algorithm ? Explain it with

ithm.

leteness

tify your answer.

ces, then G is nonhamiltonian.

h.
ximation algorithm.

Complete problem?