Scribd
Upload
827 views2 pages

BCS401 2nd IA Question Paper

BCS401 2nd IA Question Paper

Uploaded by

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

BCS401 2nd IA Question Paper

BCS401 2nd IA Question Paper

Uploaded by

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

BCS401

Shanti Vardhak Education Society’s

Dept. of CSE / CSE(DS)


Class : 4th Semester (A & D) 2nd IA Test Max. Marks: 25
Sub : ADA (BCS401) 4 July 2024 Max. Time : 1:00 Hr.
Module-III
Q. 1] A) What is balanced search tree? Explain types of rotation. 6.5 M
B) Construction of a 2-3 tree for the list 9, 5, 8, 3, 2, 4, 7 6M
OR
Q. 2] A) What is heap? Explain types of heap with example. 6.5 M
B) Construct a shift table for the pattern BABY and search for the same in the
6M
text BOBBY-LIKES-BABY
Module-IV
Q. 3] A) Apply Floyd’s algorithm to compute all pairs shortest path for the
following graph.
2
a b
6 6.5 M
3 7

c d
1
B) Obtain the optimal solution for the knapsack problem M = 10, n = 4
weights (W1, W2, W3, W4) = (7, 3, 4, 5) and 6M
profits (P1, P2, P3, P4)=(42, 12, 40, 25)
OR
Q. 4] A) Apply Warshall’s algorithm to compute transitive closure for the graph
shown below
a b
6.5 M

c d

B) Solve the following TSP which is represented as undirected graph. 6M

2
a b
7
5 8 3

c d
1
** Best of Luck **
BCS401
Shanti Vardhak Education Society’s

Dept. of CSE / CSE(DS)


Class : 4th Semester (A & D) 2nd IA Test Max. Marks: 25
Sub : ADA (BCS401) 4 July 2024 Max. Time : 1:00 Hr.
Module-III
Q. 1] A) What is balanced search tree? Explain types of rotation. 6.5 M
B) Construction of a 2-3 tree for the list 9, 5, 8, 3, 2, 4, 7 6M
OR
Q. 2] A) Construction of an AVL tree for the list 5, 6, 8, 3, 2, 4, 7 by successive
6.5 M
insertions.
B) Construct a shift table for the pattern BABY and search for the same in the
6M
text BOBBY-LIKES-BABY
Module-IV
Q. 3] A) Apply Floyd’s algorithm to compute all pairs shortest path for the
following graph.
6
a b
4
6.5 M
3
2
11

c
B) Construct a heap for the list 1, 8, 6, 5, 3, 7, 4 by successive insertion using
6M
top – down approach.
OR
Q. 4] A) Apply Warshall’s algorithm to compute transitive closure for the graph
shown below
x y
6.5 M

w z
B) Solve the following TSP which is represented as undirected graph. 6M

2
a b
7
5 8 3

c d
1
** Best of Luck **

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy