NAME OF PROGRAMME: BCS

SEMESTER / YEAR: V/3RD YEAR

SUBJECT NAME (SUBJECT CODE):
DESIGN AND ANALYSIS OF ALGORITHM(BCS-351)
SECTION-A (Very Short Answer Type Questions)
UNIT-I
S.No. Question COURSE
OUTCOMES
a) What is an algorithm? CO1
b) Define space complexity. CO1
c) Define time complexity. CO2
d) What do you mean by the term asymptotic notation? CO2
e) Why do we need to analyse the algorithm? CO3
f) Why do we need to design an algorithm? CO3
g) What is order of growth? CO4
h) What is greedy algorithm? CO4
i) Why correctness of algorithm is important? CO5
j) What do you mean by correctness of algorithm? CO5
UNIT-II
S.No. Question COURSE
OUTCOMES
a) What is randomized algorithm? CO1
b) What are applications of divide and conquer algorithm? CO1
c) What are applications of greedy algorithm? CO2
d) What is the difference between greedy method and dynamic CO2
programming?
e) List the features of dynamic programming? CO3
f) What are the advantages of greedy algorithm? CO3
g) What are applications of dynamic programming? CO4
h) What is an algorithm design technique? CO4
i) Give two real time problems that could be solved using greedy CO5
algorithm?
j) Give two real time problems that could be solved using divide CO5
and conquer algorithm?
UNIT-III
S.No. Question COURSE
OUTCOMES
a) What is sorting? CO1
b) What are advantages of sorting? CO1
c) What is bubble sort? CO2
d) List the various sorting techniques? CO2
e) What is searching? CO3
f) What are the various types of searching techniques? CO3
g) Define quick sort? CO4
h) Define merge sort? CO4
i) What is the time complexity of quick sort? CO5
j) What is the time complexity of heap sort? CO5
UNIT-IV
S.No. Question COURSE
OUTCOMES
a) Define amortized analysis? CO1
b) What are red black trees? CO1
c) What are balanced trees? CO2
d) Name two advanced analysis technique? CO2
e) Who gave the concept of red black tree? CO3
f) What is the time complexity of red black tree? CO3
g) What is the time complexity of decision tree? CO4
h) What is the full form of B-tree? CO4
i) Write the applications of B-tree? CO5
j) Write the applications of red black tree? CO5
UNIT-V
S.No. Question COURSE
OUTCOMES
a) List the name of two graph algorithms. CO1
b) What is the full form of BFS? CO1
c) What is the full form of DFS? CO2
d) What is minimum spanning tree? CO2
e) What is the other name of string matching algorithm? CO3
f) List the name of any two String matching algorithm? CO3
g) What is the full form of KMP? CO4
h) Who introduced the KMP algorithm? CO4
i) How many spanning trees can a graph have? CO5
j) What is graph? CO5
SECTION-B (Short Answer Type Questions)
UNIT-I
S.No. Question COURSE
OUTCOMES
a) What are the characteristics of an algorithm? CO1
b) What are the advantages and disadvantages of an algorithm? CO1
c) Difference between worst case, best case and average case CO2
efficiency?
d) Write an algorithm for adding n natural numbers. CO2
e) What are different types of algorithm? CO3
f) Why analysis of algorithm is important? CO3
g) What is dynamic programming? CO4
h) What is the need of an algorithm? CO4
i) What is the difference between algorithm and flowchart? CO5
j) Write the time complexity of for loop? CO5
UNIT-II
S.No. Question COURSE
OUTCOMES
a) Write a short note on space time trade off? CO1
b) Explain the general principle of greedy algorithm? CO1
c) Give the recurrence relation of divide and conquer algorithm. CO2
d) Give the recurrence relation of greedy algorithm. CO2
e) Give the recurrence relation of dynamic algorithm. CO3
f) What are steps involved in divide and conquer algorithm? CO3
g) What are steps involved in greedy algorithm? CO4
h) What are steps involved in dynamic algorithm? CO4
i) Write a short note on algorithm design techniques? CO5
j) Write a short note on iterative techniques? CO5
 UNIT-III
S.No. Question COURSE
OUTCOMES
a) Write two elementary sorting techniques? CO1
b) Write the name of two elementary sorting techniques? CO1
c) Write the name of two linear time sorting techniques? CO2
d) How we do the analyse the time complexity? CO2
e) Distinguish between radix sort and count sort? CO3
f) Distinguish between quick sort and merge sort? CO3
g) What is linear search? CO4
h) What is binary search? CO4
i) Compare the complexity of heap sort and quick sort? CO5
j) Distinguish between linear search and binary search? CO5
UNIT-IV
S.No. Question COURSE
OUTCOMES
a) List two advantages of red black trees. CO1
b) List two advantages of decision trees. CO1
c) What is lower bound theory? CO2
d) What is the time complexity of inserting in red black tree? CO2
e) What is the time complexity of deleting in red black tree? CO3
f) What are the uses of red black tree? CO3
g) What are the uses of decision tree? CO4
h) What are the searching operations in red black tree? CO4
i) What are the different types of balanced tree? CO5
j) How can we decide the color of node in red black tree? CO5
UNIT-V
S.No. Question COURSE
OUTCOMES
a) What are the various applications of minimun spanning tree? CO1
b) What is Depth first search? CO1
c) What is Breadth first search? CO2
d) Distinguish between BFS and DFS? CO2
e) What are applications of BFS? CO3
f) What are applications of DFS? CO3
g) What are applications of minimum spanning trees? CO4
h) What are the components of KMP algorithm? CO4
i) List the properties of minimum spanning trees? CO5
j) What are the components of graph? CO5

SECTION-C [Descriptive Answer Type Questions / Case Study (for MBA COURSES only)]

UNIT-I
S.No. Question COURSE
OUTCOMES
a) Explain the various techniques of designing an algorithm? CO1
b) Write an algorithm to find the factorial of a number and find its CO1
time complexity?
c) What are the general rules followed for writing an algorithm? CO2
d) How to find correctness of algorithm? Explain with an example. CO2
e) Write an algorithm to finding minimum and maximum number in CO3
an array and find its time complexity?
f) Explain backtracking algorithm along with an example. CO3
g) Explain randomised algorithm along with an example. CO4
h) Differentiate between algorithm and pseudocode. CO4
i) Write an algorithm of binary search along with its time CO5
complexity.
j) Explain branch and bound method with example. CO5
UNIT-II
S.No. Question COURSE
OUTCOMES
a) Explain Divide and Conquer Method along with its algorithm? CO1
b) What are the iterative design techniques? CO1
c) Explain greedy algorithm along with its algorithm? CO2
d) Explain the greedy knapsack problem? CO2
e) Explain iterative algorithm design issues? CO3
f) Compare the efficiency of divide and conquer algorithm and CO3
greedy algorithm.
g) Explain in detail any one application of divide and conquer CO4
algorithm?
h) Explain in detail any one application of greedy algorithm? CO4
i) Explain in detail any one application of dynamic algorithm? CO5
j) What does dynamic programming have in common with divide CO5
and conquer?
UNIT-III
S.No. Question COURSE
OUTCOMES
a) Write down the merge sort algorithm along with its worst case, CO1
best case and average case analysis.
b) Write an algorithm to sort the following numbers CO1
28,56,12,67,34,2, 40,23 using quick sort.
c) Write quick sort algorithm and explain. CO2
d) Write insertion sort algorithm and along with its time complexity. CO2
e) Sort the sequence 67,89,35,89,12,32,78. CO3
f) Write bucket sort algorithm and along with its time complexity. CO3
g) Write count sort algorithm and along with its time complexity. CO4
h) Mention some methods for finding the pivot element in quick CO4
sort?
i) Explain five real time applications of merge sort? CO5
j) Explain five real time applications of insertion sort? CO5
UNIT-IV
S.No. Question COURSE
OUTCOMES
a) Explain the properties of red black trees? CO1
b) Write the steps for inserting the numbers 15,17,90,56,23,12 in red CO1
black tree?
c) What are the rules for creating red black trees? CO2
d) Write an algorithm for searching in red black tree? CO2
e) Write an algorithm for searching in decision tree? CO3
f) Explain the different methods for doing amortised analysis? CO3
g) Compare the efficiency of red black tree and decision tree? CO4
h) Write an algorithm for doing amortised analysis? CO4
i) Explain the decision tree algorithm with an example. CO5
j) Explain the various lower bounding techniques. CO5
UNIT-V
S.No. Question COURSE
OUTCOMES
a) What are the advantages, disadvantages and applications of CO1
graph?
b) Explain Kruskal’s minimum cost spanning tree algorithm? CO1
c) Explain an algorithm for generating minimum cost spanning CO2
tree.
d) Explain DFS with suitable example. CO2
e) Explain BFS with suitable example CO3
f) Explain spanning trees with suitable example CO3
g) Write a detailed note on KMP algorithm and discuss its CO4
complexity.
h) Write an algorithm of BFS also find its time complexity. CO4
i) Write an algorithm of DFS also find its time complexity. CO5
j) Explain Prim’s minimum cost spanning tree algorithm? CO5