www.alljntuworld.

in JNTU World

ld
or
W
PART – A (SHORT ANSWER QUESTIONS)
S. No Question Blooms Course
TU

Taxonomy Outcome
Level
UNIT – I
1 Define the term algorithm and state the criteria the algorithm should satisfy. Remember 1
2 Define order of an algorithm and the need to analyze the algorithm. Remember 2
3 Define asymptotic notations: big ‘Oh’, omega and theta? Remember 2
4 List the two different types of recurrence Remember 4
5 State the best case and worst case analysis for linear search Remember 7
JN

6 If f(n)=5n2 + 6n + 4, then prove that f(n) is O(n2) Remember 3

7 Give the recurrence equation for the worst case behavior of merge sort. Remember 7
8 Compute the average case time complexity of quick sort Remember 7
9 Define algorithm correctness Remember 3
10 Describe best case, average case and worst case efficiency of an algorithm? Remember 3
11 Explain the term amortized efficiency Understand 3
12 Define order of growth Remember 2
13 How do you measure the algorithm running time? Understand 1

1|Page

Downloaded From JNTU World (http://www.alljntuworld.in)

www.alljntuworld.in JNTU World

S. No Question Blooms Course

Taxonomy Outcome
Level
14 Describe the role of space complexity and time complexity of a program are Understand 1
necessary?
15 Explain algorithm design technique? Understand 3
16 Use step count method and analyze the time complexity when two n×n Apply 3
matrices are added
17 What is meant by divide and conquer? Give the recurrence relation for Understand 7
divide and conquer.
18 Define Control Abstraction and write the computing time of divide and Remember 7
conquer.

ld
19 List out any two drawbacks of binary search algorithm. Remember 7
20 List out the drawbacks of Merge Sort algorithm. Remember 7

UNIT – II
1 Describe union operation on sets Remember 5
2 Describe find operation on sets Remember 5

or
3 Definea spanning tree and minimal spanning tree Remember 6
4 Define depth first search Remember 5
5 Define breadth first search Remember 5
6 Differentiate Breadth first search and depth first search Remember 5
7 Describe AND/OR graph Remember 5
8 Explain game tree Remember 5
9
W
Define an articulation point? Remember 5
10 Define aconnected and bi-connected component. Remember 5

UNIT – III
1 Define greedy method Remember 8
2 Define job sequencing with deadlines problem Remember 8
3 Define minimum cost spanning tree Remember 8
TU

4 State the principle of optimality Remember 8

5 Define prims algorithm Remember 8
6 Definekruskal algorithm Remember 8
7 Define single source shortest path problem Remember 8
8 Define dynamic programming. Remember 8
9 List the features of dynamic programming Remember 8
10 Distinguish greedy method and dynamic programming Remember 8,9
JN

UNIT – IV
1 State the principle of Backtracking Remember 10
2 Write control abstraction for backtracking Apply 10
3 List the applications of backtracking? Remember 10
4 Define a dead node Remember 10
5 Differentiate live node and dead node Remember 10
6 Define state space tree Remember 10
7 Define is solution space Remember 10
8 Define solution states and answer state? Remember 10

2|Page

Downloaded From JNTU World (http://www.alljntuworld.in)

www.alljntuworld.in JNTU World

S. No Question Blooms Course

Taxonomy Outcome
Level
9 Explain 8 – Queens problem Apply 10
10 Explain Sum of Subsets problem Apply 10

UNIT – V
1 Define class P Remember 12
2 Compare NP-hard and NP-completeness Remember 12
3 Define NP- hard problem Remember 12
4 Define NP-complete problem Remember 12

ld
5 Define deterministic problem? Remember 12
6 Define non-deterministic problem Remember 12
7 Define a decision problem? Remember 12
8 Explain optimization problem Understand 12
9 Explainmaxclique problem? Understand 12

or
10 Define halting problem Remember 12

PART – B (LONGANSWER QUESTIONS)

Blooms Taxonomy Course
S. No Question
Level Outcome
W UNIT - I
1 Discuss various the asymptotic notations used for best case average case Understand
1
and worst case analysis of algorithms.
2 Differentiate between priori analysis and posteriori analysis. Understand 3
3 Discussbinary search algorithm and analyze its time complexity Understand 7
4 Explain quick sort algorithm and simulate it for the following data 20, Understand 7
35, 10, 16, 54, 21, 25
5 Explain Iterative binary search algorithm Understand 7
TU

6 Illustratemerge sort algorithm and discuss time complexity Understand 7

7 Describestrassen’s matrix multiplication. Understand 7
8 Discussamortized analysis Understand 3
9 Explain probabilistic analysis Understand 3
10 Sort the list of numbers using merge sort: 78, 32, 42, 62, 98, 12, 34, 83 apply 7

UNIT - II
1 Explain breadth first search algorithm with example Understand 5
JN

2 Explain depth first search algorithm with example Understand 5

3 Discuss various tree traversal techniques with examples Understand 5
4 Compare and contrast BFS and DFS. Understand 5
5 Explain in detail about AND/OR graphs Understand 5
6 Explain waiting rule for finding UNION of sets and collapsing rule Understand 5
7 Differentiate divide and conquer and greedy method Understand 8,9
8 Discuss game trees Understand 5

3|Page

Downloaded From JNTU World (http://www.alljntuworld.in)

www.alljntuworld.in JNTU World

UNIT - III

1 Explain in detail job sequencing with deadlines problem with example Apply 8
2 Explain single source shortest path problem with example Apply 8
3 Explain knapsack problem with example Apply 8
4 Explain prims algorithm with example Understand 8
5 Explainkruskal algorithm with example Understand 8
6 Explain the concept multistage graphs with example. Understand 8
7 Explain optimal binary search tree algorithm with example Understand 8
8 Explain 0/1 knapsack problem with example Understand 8

ld
9 Explain all pairs shortest path problem with example Understand 8
10 Describe the travelling salesman problem and discuss how to solve it Understand 9
using dynamic programming?
UNIT – IV
1 Write an algorithm for N-queens problem using backtracking Apply 11

or
2 Explain subset-sum problem and discuss the possible solution strategies Apply 10
using backtracking.
3 Describe graph coloring problem and write an algorithm for m-coloring Understand 10
problem
4 Write an algorithm for Hamiltonian cycle with an example Apply 10
5 Explain properties of LC search Apply 11
6 Describe control abstraction for LC Search Understand 11
7
W
Explain principle of FIFO branch and bound Apply 11
8 Explain principle of LIFO branch and bound Apply 11
9 Explain the method of reduction to solve travelling sales person problem Apply 11
using branch and bound
10 Explain TSP using branch and bound method with example Apply 11

UNIT – V
TU

1 State and prove cook’s theorem Remember 12

2 Explain deterministic and non-deterministic algorithms Apply 12
3 Write non deterministic algorithm for sorting and searching Apply 12
4 Write a non-deterministic knapsack algorithm Apply 12
5 Explainhow P and NP problems are related Apply 12
6 Distinguish NP- hard and NP-complete problems Understand 12
7 Explain decision problem with an example Apply 12
8 Explain chromatic number decision problem and clique decision problem Apply 12
JN

9 Explain the strategy to prove that a problem is NP-hard Apply 12

10 Explain intractable problems with examples Apply 12

PART – C (PROBLEM SOLVING AND CRITICAL THINKING QUESTIONS)

S. No Question Blooms Course

Taxonomy Level Outcome
UNIT – I
1 Solve the following recurrence relation Understand 4

4|Page

Downloaded From JNTU World (http://www.alljntuworld.in)

www.alljntuworld.in JNTU World

S. No Question Blooms Course

Taxonomy Level Outcome
𝑛
𝑇(𝑛) = {2𝑇 ( ) + 𝑛, 𝑎𝑛𝑑 𝑇(1) = 2
2
2 Solve the following recurrence relation Understand 4
T(n) = 7T(n/2)+cn2
3 Solve the recurrence relation Understand 4
𝑘, 𝑛=1
𝑇(𝑛) = { 𝑛
3𝑇 ( ) + 𝑘𝑛, 𝑛 > 1, 𝑛 𝑖𝑠 𝑝𝑜𝑤𝑒𝑟𝑜𝑓 2
2
4 Explain quick sort algorithm and simulate it for following data sequence: Apply 7
3 5 9 7 1 4 6 8 2

ld
5 Sort the list of numbers using merge sort Understand 7
33, 44, 2, 10, 25, 79, 86, 47, 14, 36
6 Show that the average case time complexity of quick sort is O(nlogn) Apply 7
7 Understand merge sort on letters H, K, P,C,S,K,R,A,B,L Understand 7
8 Understandstrassen’s matrix multiplication on following matrices Understand 7
 4 5  2 10 
5 9 , 1 6 

or
   
9 Write and solve recurrence relation for strassen’s matrix multiplication Apply 7
10 Solve the following recurrence relation Understand 4
𝑛
𝑇(𝑛) = {2𝑇 ( ) + 1, 𝑎𝑛𝑑 𝑇(1) = 2
2
UNIT - II
1
W
Illustrate BFS traversal of following graph
Understand 5
TU

2 List the articulation points from the following graph 5

Understand
JN

3 Writeinorder, preoreder, post order traversal of the following tree Understand 5

5|Page

Downloaded From JNTU World (http://www.alljntuworld.in)

www.alljntuworld.in JNTU World

S. No Question Blooms Course

Taxonomy Level Outcome
4 Illustrate DFS and BFS traversals of following graph
Understand 5

ld
5 Illustrate DFS traversal of following graph Understand 5

or
Illustrate BFS traversal of following graph Understand 5
W
7 List the articulation points from the following graph Understand 5
TU
JN

8 Writeinorder, preorder, post order traversal of the following tree Understand 5

6|Page

Downloaded From JNTU World (http://www.alljntuworld.in)

www.alljntuworld.in JNTU World

S. No Question Blooms Course

Taxonomy Level Outcome
9 Illustrate BFS and DFS traversals of following graph Understand 5

ld
10 Illustrate DFS traversal of following graph Understand 5

or UNIT - III
Compute the optimal solution for job sequencing with deadlines using
greedy method. N=4, profits (p1,p2,p3,p4) = (100,10,15,27),
Understand 8
W
Deadlines (d1,d2,d3,d4) = (2,1,2,1)
2 Compute the optimal solution for knapsack problem using greedy Understand 8
methodN=3, M= 20, (p1,p2,p3)= (25,24,15), (w1,w2,w3) =(18,15,10)
3 Construct minimum cost spanning tree using Understand 8
a) prims algorithm b) kruskal algorithm
TU

4 Apply single source shortest path algorithm for the following graph Apply 8
JN

5 Use optimal binary search tree algorithm and compute wij, cij, rij, Understand 9
0<=i<=j<=4,p1=1/10, p2=1/5, p3=1/10, p4=1/120, q0=1/5, q1=1/10,
q2=1/5, q3=1/20,q4=1/20.
6 Construct optimal binary search for (a1, a2, a3, a4) = (do, if,int, while), Understand 9
p(1 : 4) = (3,3,1,1) q(0 : 4)= (2,3,1,1,1)

7|Page

Downloaded From JNTU World (http://www.alljntuworld.in)

www.alljntuworld.in JNTU World

S. No Question Blooms Course

Taxonomy Level Outcome
7 Solve the solution for 0/1 knapsack problem using dynamic Apply 9
programming(p1,p2,p3, p4) = (11, 21, 31, 33), (w1, w2, w3, w4) = (2, 11,
22, 15), M=40, n=4
8 Solve the solution for 0/1 knapsack problem using dynamic programming Apply 9
N=3 , m=6 profits (p1,p2,p3) = (1,2,5) weights (w1,w2,w3) = (2,3,4)
9 Find the shortest tour of traveling sales person for the following cost Understand
matrix using dynamic Programming 9

∞ 12 5 7

ld
11 ∞ 13 6

4 9 ∞ 18

10 3 2 ∞

or
10 Calculate shortest distances using all pairs shortest path algorithm Understand 9

W
UNIT - IV
1 Sketch the state space tree degenerated by 4 queens problem Understand 10
2 Apply the backtracking algorithm to solve the following instance of the Understand 10
sum of subsets problem S={5,10,12,13,15,18} and d=30
3 Sketch the state space tree generated all possible 3-color,4-node graph Understand 10
TU

4 Identify Hamiltonian cycle from the following graph Understand 10

JN

5 Solve the following instance of travelling sales person problem using Understand 11
Least Cost Branch Bound

8|Page

Downloaded From JNTU World (http://www.alljntuworld.in)

www.alljntuworld.in JNTU World

S. No Question Blooms Course

Taxonomy Level Outcome

∞ 12 5 7

11 ∞ 13 6

4 9 ∞ 18

10 3 2 ∞

ld
6 Draw the portion of state space tree generated by LCBB by the following Understand 11
knapsack problem n=5 , (p1,p2,p3,p4,p5) =(10,15,6, 8, 4),
(w1,w2,w3,w4,w5)=(4,6,3,4,2) and m=12
7 Draw the portion of state space tree generated by FIFO knapsack for the Understand 11
instance N=4 , (P1, P2, P3, P4)= ( 10, 10, 12, 18 ) , ( w1, w2,w3,w4) = (
2, 4, 6, 9 ) , m=15
8 Solve the following instance of travelling sales person problem using Understand 11

or
Least Cost Branch Bound

W
9 Identify Hamiltonian cycle from the following graph Understand 10
TU

10 Apply the backtracking algorithm to color the following graph Understand 10

JN

9|Page

Downloaded From JNTU World (http://www.alljntuworld.in)

www.alljntuworld.in JNTU World

S. No Question Blooms Course

Taxonomy Level Outcome
UNIT - V
1 Show that satisfiability is at most three literals reduces to chromatic Remember 12
number
2 Prove Hamiltonian cycle is in NP Understand 12
3 Prove circuit-SAT is in NP Understand 12
4 List two problems that have polynomial time algorithms justify your Understand 12
answer
5 Explain 3CNF satisfiability problem Remember 12

ld
6 Explain P type problems with examples Remember 12

HOD, INFORMATION TECHNOLOGY

or
W
TU
JN

10 | P a g e

Downloaded From JNTU World (http://www.alljntuworld.in)