Scribd
Upload
2 views2 pages

Module-2 Question Bank

This document is a question bank for the Analysis and Design of Algorithms course at Sri Krishna Institute of Technology, focusing on various algorithm design techniques. It includes questions on divide and conquer, sorting algorithms, matrix multiplication, and optimization problems like the Travelling Salesman and knapsack problems. Each question is categorized by its learning outcome, level of difficulty, and marks allocation.

Uploaded by

sushma.aids
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views2 pages

Module-2 Question Bank

This document is a question bank for the Analysis and Design of Algorithms course at Sri Krishna Institute of Technology, focusing on various algorithm design techniques. It includes questions on divide and conquer, sorting algorithms, matrix multiplication, and optimization problems like the Travelling Salesman and knapsack problems. Each question is categorized by its learning outcome, level of difficulty, and marks allocation.

Uploaded by

sushma.aids
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

SRI KRISHNA INSTITUTE OF TECHNOLOGY

(Accredited by NAAC, Approved by A.I.C.T.E. New Delhi, Recognised by Govt. of Karnataka & Affiliated to V.T U.,
Belagavi)
#57, Chimney Hills, Hesaraghatta Main Road, Chikkabanavara Post, Bengaluru- 560090

Department of Artificial Intelligence and Machine Learning


Subject Name: Analysis and Design of Algorithms Subject Code:
BCS401 SEM: 4th DIV: A
Faculty: Prof. Manzoor Ahmed

Module-2 Question Bank

SL# Question CO Level Marks


Explain the concept of divide and conquer. Design an algorithm for
1. CO2 L2 10
merge sort and derive its time complexity
2. Design an insertion sort algorithm and obtain its time complexity.
CO2 L3 10
Apply insertion sorton these elements. 25,75,40,10,20,
3. Explain Strassen’s matrix multiplication and derive its time
CO2 L3 10
complexity
4. Design an algorithm for quick sort algorithm. Apply quick sort on
CO2 L3 10
these elements. 25,75,40,10,20,05,15
5. What is divide and conquer? Develop the quick sort algorithm
and write its best case. Make use of this algorithm to sort the list CO2 L3 10
of characters: E, X, A, M, P, L, E.
6. Distinguish between decrease & conquer and divide & conquer
algorithm design techniques with block diagram. Develop CO2 L3 10
insertion sort algorithm to sort a list of integers and estimate the
efficiency.
7. Define topological sorting. List the two approaches of topological
CO2 L3 10
sorting and illustrate with examples.
8. Solve the Following Travelling Salesman Problem which is
represented by the graph. And also find the Analysis of the
same.
CO2 L3 08

9. Solve the following instance of greedy knapsack problem where


n=4, m=10, p = (40, 42, 25,12) and w = (4, 7, 5, 3).And also CO2 L3 08
find
the Analysis of the same.
10. Apply the DFS based Algorithm to solve the Topological sorting
CO2 L3 8
problem for the following digraph:
SRI KRISHNA INSTITUTE OF TECHNOLOGY
(Accredited by NAAC, Approved by A.I.C.T.E. New Delhi, Recognised by Govt. of Karnataka & Affiliated to V.T U.,
Belagavi)
#57, Chimney Hills, Hesaraghatta Main Road, Chikkabanavara Post, Bengaluru- 560090

11. Apply the Source Removal Method based Algorithm to solve


the Topological sorting problem for the following graph:

CO2 L3 8

Faculty Signature

You might also like