Scribd
Upload
4 views2 pages

Ada Final QP

Uploaded by

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

Ada Final QP

Uploaded by

PALLAVI Y
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Sub.

Name : Analysis & Design of


MAHARAJA INSTITUTE OF
Algorithms
TECHNOLOGY MYSORE
( BCS401)
Dept. of Computer Science and
Engineering/ Artificial Intelligence and Schedule: date 03/06 /2024 and
Engineering 9:30AM-10:45AM
Ist Internal Assessment
4th . Sem
Total Marks: 30
Instructions to students
* Answer any one full question from each part

Q# Question Description M BTL COs


Part A
Use quick sort algorithm to sort the following set of numbers. Write the L3
a 9 CO2
quick sort algorithm 5,3,1,9,8,2,4,7

Apply Strassen’s multiplication to multiply the following matrices.


1 Give its time complexity.
b 6 L3 CO2

OR
Apply large integer multiplication for 62X39 and give its time
a complexity 9 L3 CO2

Build pre-order, post-order and in- order traversal for the given graph

2
b 6 L3 CO2

Part B
3 a Build all pair shortest path for the given graph using Floyds algorithm 7 L3 CO4
write Floyds algorithm

Page 1 of 2
Using Prims algorithm construct minimum spanning tree for the
following graph. Write Prims algorithm

b 8 L2 CO4

OR
Build single source shortest path using Dijkstras algorithm for the given
graph with initial node as A .write Dijkstras algorithm

a 7 L3 CO5

Using knapsack algorithm solve the following knapsack problem. Write


knapsack algorithm
Item Weight value
b 1 2 12 8 L2 CO6
2 1 10
3 3 20
4 2 15
Approval
Signature of In-charge Staffs

Prof. Reena Mol V U Prof. Seema C K Prof. Pallavi Y Prof Prakruthi S Shashank H P

DEC Members Academic coordinator HOD

Page 2 of 2

You might also like