VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE

(AN AUTONOMOUS INSTITUTION)

Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284

Course: B.Tech Year / Semester: III/I

Subject Name: Design and Analysis of Algorithms Branch Name(s): CSE
Subject Code(s): CS501PC

DESCRIPTIVE QUESTION BANK

UNIT- 1
Q..NO DESCRIPTION OF QUESTION MARKS CO PO BTL
a List out the characteristics of an algorithm. 1 1 1 1
b Define an algorithm to returns nth term of the Fibonacci series. 1 2 1 1
c Explain the recurrence relation used to determine the time complexity in
1
divide and conquer algorithms and also demonstrate how to derive the time
10 3 1 2
complexity using the substitution method, assuming the constants a=2 and
b=2.
a Define the time complexity. 1 1 2 1
b Analyze the time complexity of merge sort 1 2 2 4
2 c Define the Quick Sort algorithm. Also Explain the recurrence relation
representing its worst-case time complexity and determine it by solving the 10 2 2 2
recurrence relation.
a Organize the following functions in ascending order based on their growth:
1 2 1 2
n, log n,n2,n3,nlogn,2n
b Analyze the time complexity of quick sort. 1 2 2 4
3
c Apply quick sort technique and arrange the records with the following values
in the ascending order. 10 2 2 3
2, 3, 8, 5, 4, 7, 6, 9, 1.
a List out the applications of divide and conquer 1 1 1 5
b Analyze the time complexity of Strassens matrix multiplication. 1 1 1 4
4 c Define the Merge Sort algorithm and apply it to sort the following elements:
5 1 2 2
310, 285, 179, 652, 351, 423, 861, 254, 450, 520.
d Explain the Strassen’s matrix multiplication algorithm 5 1 1 2
a Explain the recurrence relation representing time complexity of binary search. 1 1 1 2
b List various asymptotic notations. 1 2 2 4
5 c Apply quick sort algorithm to sort the list C, O, L, L, E, G, E in alphabetical
5 3 2 5
order.
d Solve the following recurrence: T(n)=4T(n/2)+n, Where 1n and is a power
5 1 1 2
of 2.
a Define an Order of growth 1 1 1 2
b Explain Big-Oh notation. 1 1 2 2
6
c Explain the Strassen’s matrix multiplication. 5 1 2 2
d Define the Binary Search algorithm. Also explain with an example. 5 1 1 2
UNIT-2
Q..NO DESCRIPTION OF QUESTION MARKS CO PO BTL
1 a Define a set and its representations. 1 1 2 1
 VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
(AN AUTONOMOUS INSTITUTION)
Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284
b Define Disjoint sets properties 1 1 2 1
c Define simple union and simple find algorithms. Also explain them with
10 2 2 2
examples.
a Define Backtracking. 1 1 2 1
b Illustrate the performance problems associated with the Simple Union and
1 1 2 2
2 Find algorithms.
c Define weighted union and collapsing find algorithms. Also analyze the
10 1 2 4
performance their benefits with examples.
a Define Backtracking algorithm 1 1 2 1
3 b Define Explicit and Implicit Constraints. 1 1 2 1
c Define and explain the n-queens problem. 10 1 2 2
a List the Applications of Backtracking 1 1 2 1
4 b Explain the 4-queen problem using backtracking. 1 2 2 2
c Define and explain Sum of subsets problem. 10 1 2 2
a Define state space tree. 1 1 2 1
b Find the sum of subsets for the following set of integers using fixed tuple
5 method. 1 1 2 1
{5, 10, 25, 50,100} for W=75.
c Define and explain graph coloring problem. 10 1 2 2
a Define hamiltonian cycle? 1 1 2 1
6 b Define planar graph and draw the example. 1 1 2 1
c Define and explain heap sort. 10 1 2 2
UNIT-3
Q..NO DESCRIPTION OF QUESTION MARKS CO PO BTL
a Define dynamic programming 1 1 2 1
b Define optimal binary search tree with an example 1 1 2 1
1 c Explain merging and purging rules in 0/1 knapsack problem. Find an optimal
solution to the 0/1 knapsack Instance n=4, m=15, (w1,w2, w3, w4)=(3,4,3,5), 10 2 2 2
and (p1,p2,p3,p4)=(10,5,7,11)
a Define optimal Solution? 1 1 2 1
b Give the statement of Reliability design problem. 1 1 2 4
c Obtain all pairs shortest paths for the following graph

2
10 2 2 1

3 a State the Principle of Optimality? 1 1 2 1

b Differentiate between Divide & Conquer and dynamic programming. 1 1 2 4
c Find the minimum cost tour for the following graph using dynamic 10 2 2 2
programming. Cost of the edges are given by the matrix shown in following
figure.
 VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
(AN AUTONOMOUS INSTITUTION)
Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284

4 a Define All pairs shortest path Problem? 1 1 2 1

b Define 0/1 Knapsack problem. 1 1 2 1
c Draw an Optimal binary search tree for n=4 identifiers
(a1,a2,a3,a4)=(do,if,int,while).The values for p’s and q’s are given as 10 2 2 2
p(1:4)=(3,3,1,1) And q(0:4)=(2,3,1,1,1).
a What is Travelling Salesperson Problem. 1 1 2 1
b Write down the Floyd Warshall algorithm to solve the all pairs shortest paths
problem on a directed graph. 1 1 2 1
5
c Explain about OBST general solution with an example and derive formulas for
10 2 2 2
constructing OBST using dynamic programming method
a List the applications of Dynamic programming? 1 1 2 1
6 b Explain briefly about Optimization problem? 1 1 2 2
c Write OBST algorithm . 10 2 2 1
UNIT-4
Q..NO DESCRIPTION OF QUESTION MARKS CO PO BTL
a Give brief description on greedy method. 1 1 3 1
b Construct control abstraction Algorithm of Greedy method. 1 1 3 5
c For given instances of job sequencing with deadline problem. n=5, (p1,
1
…….,p5)=(20,15,10,5,1) and deadlines (d1,….,d5)=(2,2,1,3,3) Obtain the
10 2 3 3
optimal solution.

a Write an algorithm of greedy knapsack. 1 1 3 1

2 b State the Job sequencing deadline problem 1 1 3 1
c Demonstrate Kruskal’s algorithm with an example. 10 2 3 4
a Define feasible Solution? 1 1 3 1
b Define minimum cost spanning tree. 1 1 3 1
3
c Write the Prim’s Algorithm and explain with an example.
10 2 3 2
a Define optimal Solution? 1 1 3 1
b Write any two characteristics of Greedy Algorithm. 1 1 3 1
4
c Write an Algorithm for single source shortest path and explain with an
10 1 3 1
example
a What are the drawbacks of dynammic programming 1 1 3 1
b Write high level description for job sequencing Algorithm. 1 1 3 2
5
c Write and Explain Greedy Algorithm for Job Sequencing with deadline
10 2 3 2
problem.
6 a What is Single Source Shortest Problem? 1 1 3 1
 VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
(AN AUTONOMOUS INSTITUTION)
Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284
b Differentiate between greedy method and dynamic programming. 1 1 3 1
c Discuss about fractional knapsack problem. Find an optimal solution to the
fractional knapsack with Instance n=2, m=20, (w1,w2, w3)=(18,15,10), and
10 2 3 3
(p1,p2,p3)=(25,24,15)

UNIT-5
Q..NO DESCRIPTION OF QUESTION MARKS CO PO BTL
a What do you mean by bounding? 1 1 3 1
b Write about the general method for Branch and Bound. 1 1 3 5
1 c Draw the portion of the state space tree generated by LCBB for the following
instances:
10 2 3 3
n=5, m=12, (P1………..P5) = (10, 15, 6, 8, 4)
(w1…………w5) = (4, 6, 3, 4, 2)
a Write the applications of Branch and Bound problem. 1 1 3 1
b Write the control abstraction algorithm for LC search. 1 1 3 1
2 c Explain the FIFO BB 0/1 Knapsack problem procedure with the knapsack
instance for n=4, m=15,(p1,p2,p3,p4)=(10,10,12,18), (w1,w2,w3,w4) =(2, 4, 10 3 3 2
6, 9). Draw the portion of the state space tree and find optimal solution.
a What is the Principle of Optimality? 1 1 3 1
b Write the non-deterministic sorting algorithm. 1 1 3 2
c Solve the Travelling Salesman Problem for the following graph 4 by using the
Branch and Bound Algorithm.

3
10 2 3 2

a What is meant by non-deterministic algorithm? 1 1 3 1

b What is the relation between NP-hard and NP-complete? 1 1 3 1
4 c i) Write a short notes on Clique problem.
ii) Write a short notes on 3-SAT Problem. 10 1 3 2

5 a Define Class P? 1 1 3 1
b What is NP-hard problem. 1 1 3 1
c State and Explain the cook’s theorem. What is the significance of this
10 2 3 2
theorem?.
6 a List the applications of Dynamic programming? 1 1 3 1
b Distinguish between deterministic and non deterministic algorithm. 1 2 3 4
c i) Prove that CNF satisfiability of AND/OR graph decision problem. 10 2 3 2
 VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
(AN AUTONOMOUS INSTITUTION)
Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284
ii) Give the 0/1 Knapsack LCBB algorithm.
 VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
(AN AUTONOMOUS INSTITUTION)
Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284

OBJECTIVE QUESTION BANK

UNIT-I
MULTIPLE CHOICE QUESTIONS:
1. The space complexity of any algorithm p, S(P) =
a) c + Sp b) c - Sp c) 1 - Sp d) 1 + Sp
2. Which of the following are algorithm design techniques
a)Brute force b)Divide and conquer c) Greedy method d)All
3. Which of the following characteristic of algorithm tells, each instruction should be un
ambiguous
A) Finiteness b) Effectiveness c) Definiteness d) None
4. Single line comments are written using……
a) \\ b) / c) // d);
5. Which of the following notation gives the bounded time
a) Big oh b) Big Omega c) Theta d) None
6. Which of the following representation gives upper bound time
a) Big oh b) Big Omega c) Theta d) None
7. The worst case time complexity of merge sort is …
a)O(log n) b)O(n log n) c)O(n2) d)O(1)
8. The worst case time complexity of quick sort is …
a)O(log n) b)O(n log n) c)O(n2) d)O(1)
9. The best case time complexity of binary search is …
a)O(log n) b)O(n log n) c)O(n2) d)O(1)
10. The time complexity of general matrix multiplication is ….
a)O(logn) b)O(nlogn) c)O(n2) d)O(n3)
Fill in the blanks:
11. The function which generates itself is called ………
12. The general 2×2 matrix multiplication requires……no. of additions, …….no. of
multiplications.
13. Strassen’s matrix multiplications requires……..no. of additions, ……..no. of
multiplications.
 VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
(AN AUTONOMOUS INSTITUTION)
Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284
14. The recurrence relation T(n) =aT(n/2)+F(n), where F(n) is ……..
15. The recurrence relation of divide & conquer is ……….
16. If a=b, then using Master’s method T(n)=………
17. Quick sort is ………… efficient than heap sort in the worst case.
18. The running time of a algorithm depends on ………….
19. Space complexity of algorithm S(P)=………….
20. The average running time per operation obtained by………… Analysis.
UNIT-1 – Objective Key.
Q.No. Answer Q.No. Answer
01 a 11 Recursive
02 D 12 8,4
03 C 13 18, 7
Time to divide the
04 C 14 problem into sub
problems
05 c 15 T(n) =aT(n/2)+F(n)
06 A 16 n
07 B 17 More
08 C 18 Input size
09 D 19 c + Sp
10 D 20 Step Count method
 VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
(AN AUTONOMOUS INSTITUTION)
Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284
UNIT-II

Objective Questions:
1. Each path through the tree represents a …….. in a binary tree
a) Sequence of comparisions b) elements comparisions
c) Sequence of elements d) comparisions
2. The sets A&B are said to be disjoint if
a)AUB= Ø b)AUB≠ Ø c)A∩B= Ø d)A∩B≠ Ø
3. The time required for find operation to find an element at level i of tree is _______.
a)O(i) b)O(2i) c)O(3i) d)O(i2)
4. The operations of disjoint sets are ____.
a)find b)union c)a&b d)none
5. Backtracking is allowed in ____ algorithm.
a)BFS b)DFS c)Prims d)Krushkal
6. In n-queens problem, nodes are numbered as in ______.
a)DFS b)BFS c)D-search d)both b&c

7. A back tracking algorithm on one problem instance might generate only

a) O(n)nodes b)Ω(n)nodes c)n nodes d)2n nodes
8. In n-queens problem when n=4 , then how many leaf nodes exist.
a)16 b)64 c)24 d)32
9. To solve the graph coloring problem we can use
a) Greedy method b) Divide &conquer c) Dynamic programming d) Backtracking
10. To solve sum of subset problem we can use
a) Greedy method b)Divide &conquer c) Dynamic programming d)Backtracking
11. The time complexity of graph coloring problem is ____.
12. The live node whose children are currently being expanded is called_____.
13. The minimum number of colors that can be used for graph coloring is called_____.
14. ______ describe the way in which the xi must relate to each other.
 VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
(AN AUTONOMOUS INSTITUTION)
Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284
15. ______ are those solution states s for which the path from the root to s defines a tuple that
is a member of the set of solution of problem.
16. In backtracking method __________ tree is built for finding the solution.
17. A graph is said to be bi-connected if_____.
18. A graph is said to be connected if _____.
19. A point which divides the graph into components is called ______.
20. A cycle that covers all the edges of the given graph, without having to cover any edge
twice is called______.

UNIT-2 – Objective Key.

Q.No. Answer Q.No. Answer
01 d 11 O(nmn)
02 c 12 Live Nodes
03 a 13 Chromatic Number
04 c 14 Explicit Constraint
05 b 15 Answer Nodes
06 a 16 State Space tree
07 a 17 No articulation point
path between every
08 c 18
pair of vertices
09 d 19 articulation point
10 d 20 Hamiltonian Cycle

UNIT-III

Objective Questions:
1. Which method can be used when the solution to a problem can be viewed as the result of
a sequence of decisions

a)Greedy method b)Divide &conquer

c) Dynamic programming d)Backtracking

 VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
(AN AUTONOMOUS INSTITUTION)
Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284
2. How many internal & external nodes will be there in a binary search tree representing n
identifiers

a) n,n b)n+1,n+1 c)n,n+1 d)n+1,n

3. In dynamic programming _____ solutions are not allowed.

a)feasible b)in feasible c)optimal d)non e

4. Dynamic programming will generate optimal solution using principle of ______.

a)Duality b)optimality c)Induction d)none

5. All pairs shortest path problem is solved using

a)Greedy method b)Divide &conquer

c)Dynamic programming d)Backtracking

6. The time complexity of matrix chain multiplication is_____.

O(n) b)O(n2) c)O(n3) d)none

7. The time complexity of OBST is_____.

a)O(n) b)O(n2) c)O(n3) d)none

8. Which of the following is an application of dynamic programming..

a) Quick sort b) MST c) Single Source Shortest path d) OBST

9. Which of the following is/are property/properties of a dynamic programming problem?

a) Optimal substructure
b) Overlapping subproblems
c) Greedy approach
d) Both optimal substructure and overlapping subproblems

10. If an optimal solution can be created for a problem by constructing optimal solutions for
its subproblems, the problem possesses ____________ property.
a) Overlapping subproblems
b) Optimal substructure
c) Memoization
d) Greedy

11. In dynamic programming, the technique of storing the previously calculated values is
called ___________
 VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
(AN AUTONOMOUS INSTITUTION)
Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284
12. The travelling sales man problem is to find the tour of _______ cost.

13. The probability that device i will work properly is called ____ of that device.

14. The reliability function at stage i is Øi(mi) defined as_______.

15. Sequences containing suboptimal sub sequences cannot be______.

16. The _____ states that whatever the initial state &decision are, the remaining decisions
must constitute an optimal decision sequence.

17. If a problem can be solved by combining optimal solutions to non-overlapping problems,

the strategy is called _____________

18. In 0/1 Knapsack problem the set S=(P, W) where P is___________and W is________.

19. We have two sets (P1,W1) and (p2,W2) when P1<P2 and W1>W2 then this property is
known as __________

20. Finding the shortest path between every pair of vertices is known as___________

UNIT-3 – Objective Key.

Q.No. Answer Q.No. Answer
01 C 11 Memoization
02 C 12 minimum cost
03 a 13 Reliability
04 b 14 (1-Ri)mi
05 c 15 Optimal
06 c 16 Principle of optimality
Overlapping
07 c 17
subproblems
08 d 18 profit and Weight
09 d 19 Dominance Rule
All pairs shortest path
10 b 20 problem
 VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
(AN AUTONOMOUS INSTITUTION)
Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284
UNIT-IV

Objective Questions:
1. The problem job scheduling with deadlines comes under ………..

a)Divide & Conquer b)Greedy method c)Dynamic Programming d)Back tracking

2. Greedy method suggests that optimize the objective function wrt…….

a) Condition b) Constraint c) both a&b d)none

3. In Greedy method at each stage, a decision is made regarding whether a particular
input is in ……….. solution

a)Infeasible b)Optimal c)sub optimal d)Feasible

4. The time complexity of Prim's algorithm using the adjacency matrix of a complete
graph……….

a)O(n) b)θ(n) c) θ(n2) d) O(n2)

5. Which of the following is true?
a) Prim’s algorithm initialises with a vertex
b) Prim’s algorithm initialises with a edge
c) Prim’s algorithm initialises with a vertex which has smallest edge
d) Prim’s algorithm initialises with a forest

6. Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is
used?
a) O(log V)
b) O(V2)
c) O(E2)
d) O(V log E)

7. 4. Prim’s algorithm is a ______

a) Divide and conquer algorithm
b) Greedy algorithm
c) Dynamic Programming
d) Approximation algorithm

8. Prim’s algorithm is also known as __________

a) Dijkstra–Scholten algorithm
b) Borůvka’s algorithm
c) Floyd–Warshall algorithm
d) DJP Algorithm
 VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
(AN AUTONOMOUS INSTITUTION)
Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284
9. Fractional knapsack problem is also known as __________
a) 0/1 knapsack problem
b) Continuous knapsack problem
c) Divisible knapsack problem
d) Non continuous knapsack problem

10. Fractional knapsack problem is solved most efficiently by which of the following
algorithm?
a) Divide and conquer
b) Dynamic programming
c) Greedy algorithm
d) Backtracking

11. In job scheduling we get the profit if the job completes in ………..

12. The objective of the knapsack problem___________

13. The time complexity of knapsack problem is ……..

14. The time complexity of kruskal algorithm is ………

15. In single source shortest path problem we visit the vertex v ………. to u.

16. Feasible is a ……… function.

17. The aim of greedy technique is ………

18. Let n=4, (P1,P2,P3,P4)=(100,10,15,27) and (d1,d2,d3,d4)=(2,1,2,1). The optimal solution

for the problem is ……..

19. The objective of Knapsack problem is to fill the knapsack that ……… the total profit
earned.

20. Dijkstra’s Algorithm is used to solve _____________ problems.

UNIT-4 – Objective Key.

Q.No. Answer Q.No. Answer
01 B 11 Deadline
To get maximum total
02 C 12
value in the knapsack
03 D 13 O (n log n)
 VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
(AN AUTONOMOUS INSTITUTION)
Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284
04 c 14 O(E log V)
05 A 15 Nearest
06 B 16 Boolean
To Find the optimal
07 B 17
solution
08 d 18 (1,4)
09 B 19 Maximizes
Single source shortest
10 c 20
path problem

UNIT-V
Objective Questions:
1. If there are m live nodes then addition and deletion of a node to a list can be carried out in
the time of
a) O(log m) b)O(1) c)O(m) d)None
2. For exploring new nodes ------- techniques are used
a)_DFS b)BFS c)D-search d)Both b&c
3. 3. In branch and bound method the basic idea is selection of ……
a) E-node b) B-node c)D-node d)None
4. Branch and bound is a __________
a) problem solving technique
b) data structure
c) sorting algorithm
d) type of tree
5. Which of the following is not a branch and bound strategy to generate branches?
a) LIFO branch and bound
b) FIFO branch and bound
c) Lowest cost branch and bound
d) Highest cost branch and bound
6. Any problem for which the answer is either zero or one is called---

a)decision problem b)Optimization problem c)clique problem d)All

 VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
(AN AUTONOMOUS INSTITUTION)
Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284
7. All deterministic search algorithms have time complexity of ---

a)O(n) b)O(1) c)O(n2) d)Ω(n)

8. The computing time for Choice, Failure, and Success are taken to be-----

a) O(1) b)O(n) c) Ω(n) d)None

9. A NP problem such that ,if it is in P, then ------

a) P=NP b)P≠NP c)P+NP d)None

10. Problems that can be solved in polynomial time are known as?
a) intractable b) tractable c) decision d) complete

11. Which of the following can traverse the state space tree only in DFS manner -----------

12. ---------- Algorithms have the property that the result of every operation is uniquely
defined.

13. If an NP hard problems can be solved in polynomial time then all --- problems can be
solved in polynomial time

14. …………. is the decision problem of determining whether a given com- puter program
halts on a given input

15. NP problems are divided in to …………and…………

16. Travelling sales man problem can be represented as………..

17. D-search is special case of ------------
18. In dynamic reduction we can make the choice of edge i→j with ---------- cost.
19. Typically optimization problems can be solved using -------
20. If there are m live nodes then to test whether a list is empty can be carried out in --- time.

UNIT-5 – Objective Key.

Q.No. Answer Q.No. Answer
01 B 11 Backtracking
Deterministic
02 D 12
Algorithm
03 A 13 NP complete
04 a 14 Halting problem
05 d 15 NP hard and NP
 VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
(AN AUTONOMOUS INSTITUTION)
Deshmukhi (V), Pochampally (M), Yadadri Bhuvanagiri Dist., TS-508284
complete
Complete Graph
06 a 16
G=(V,E)
07 d 17 LC Search
08 a 18 Least cost
09 a 19 optimization functions
10 b 20 O(m)