Scribd
Upload
24 views

ADS&AA Assignment Questions_Students Copy

Uploaded by

bobby
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
24 views

ADS&AA Assignment Questions_Students Copy

Uploaded by

bobby
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

PRAGATI ENGINEERING COLLEGE

(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING-ARTIFICIAL INTELLIGENCE

ASSIGNMENT QUESTIONS

Academic Year: 2024-2025 Year & Semester: II-I


Subject: ADS &AA Subject Code :

List of
Blooms
Assignment Course
Unit Q.No. Taxonomy
Question Outcomes
Level
Mapped
I 1 What are the 3 K2 CO1
types of measuring
time complexity of
a Program? Give
examples.
I 2 Define Balance K2 CO1
Factor of an AVL
Tree. Give reasons
why an AVL tree
is better than a
BST.
I 3 List the properties K2 CO1
of B-Tree.
I 4 Outline the K3 CO1
mechanism of
deletion operation
in an AVL Tree
with a suitable
example.
I 5 Write the process K3 CO1
of insertion
operation in a B-
Tree.
I 6 Summarize the K2 CO1
various types of
rotations in an
AVL tree with an
example for each
type of rotation.
II 1 Write the K2 CO2
properties of a max
heap and min heap
and give an
example.
II 2 Write the K2 CO2
algorithm for DFS
with an example.
II 3 Describe Merge- K2 CO2
sort with an
example.
II 4 Explain about bi- K3 CO2
connected
components. Give
an example.

1
PRAGATI ENGINEERING COLLEGE
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING-ARTIFICIAL INTELLIGENCE

II 5 Discuss the K2 CO2


importance of
pivot element in
Quicksort method.
Illustrate with an
example.
II 6 Explain about K3 CO2
Stassen’s matrix
multiplication with
an example.
III 1 Explain the greedy K2 CO3
method to solve
Knapsack problem.
III 2 Outline the cost of K2 CO3
minimum cost
spanning tree with
suitable example.
III 3 Write short notes K2 CO3
on Bellman Ford
algorithm.
III 4 Show how an K3 CO3
Optimal Binary
Search Tree is
constructed with
an suitable
example.
III 5 Discuss how the K3 CO3
All pairs shortest
path problem is
solved using
Dynamic
programming.
III 6 Show how the K3 CO3
Travelling
Salesperson
problem is handled
using Dynamic
programming
principle.
IV 1 Outline the 8- K2 CO4
Queens Problem
and its possible
solution through
backtracking.
IV 2 Summarize the K3 CO4
Graph coloring
problem and how
its solved with
Backtracking.
IV 3 Explain 0/1 K3 CO4
Knapsack Problem
and how it is
solved with
Backtracking.
IV 4 Explain the general K2 CO4
method of Brach

2
PRAGATI ENGINEERING COLLEGE
(Autonomous)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING-ARTIFICIAL INTELLIGENCE

and bound.
IV 5 Solve the 0/1 K2 CO4
Knapsack problem
using fundamentals
of Branch and
Bound.
IV 6 Describe how the K3 CO4
solution to
Travelling
Salesperson
problem is
provided by
Branch and Bound
method
V 1 Bring out the K2 CO5
differences
between NP Hard
and NP complete
problems.
V 2 Explain Cook’s K2 CO5
theorem.
V 3 Discuss regarding K3 CO5
the Clique
Decision Problem
(CDP)
V 4 Explain about K3 CO5
Chromatic Number
Decision Problem
(CNDP)
V 5 Explain the Job K3 CO5
Shop Scheduling
problem and its
possible solution.
V 6 Solve the issue of K3 CO5
Scheduling
Identical
Processors
modeling it as NP-
Hard Scheduling
problem.

You might also like