Scribd
Upload
3 views1 page

Module-3 Question Bank

This document is a question bank for the Analysis and Design of Algorithms course at SRI Krishna Institute of Technology. It includes various questions related to AVL trees, 2-3 trees, heaps, and string matching algorithms, along with their corresponding learning outcomes and difficulty levels. The questions are designed to assess students' understanding of key concepts and their ability to apply algorithms in practical scenarios.

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 PDF, TXT or read online on Scribd
3 views1 page

Module-3 Question Bank

This document is a question bank for the Analysis and Design of Algorithms course at SRI Krishna Institute of Technology. It includes various questions related to AVL trees, 2-3 trees, heaps, and string matching algorithms, along with their corresponding learning outcomes and difficulty levels. The questions are designed to assess students' understanding of key concepts and their ability to apply algorithms in practical scenarios.

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 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-3 Question Bank

SL# Question CO Level Marks


1. Define AVL Trees. Explain its four rotation types CO3 L2 10
2. Define AVL tree with an example. Give worst case efficiency
of operations on AVL tree. Construct an AVL tree of the list of
CO3 L3 10
keys: 5, 6, 8, 3, 2, 4, 7 indicating each step of key insertion and
rotation.
3. Define 2-3 tree. Give the worst case efficiency of operations on
2-3 tree. Build 2-3 tree for the list of keys 9, 5, 8, 3, 2, 4, 7 by CO3 L3 10
indicating each step of key insertion and node splits.
4. Construct bottom up heap for the list 2,9,7,6,5,8. Obtain its time
CO3 L3 10
complexity
5. Define heap. Explain the properties of heap along with its
CO3 L2 10
representation.
6. Design Horspools algorithm for string matching. Apply Horspools
algorithm to find the pattern BARBER in the text: CO3 L3 10
JIM_SAW_ME_IN_A_BARBERSHOP

Faculty Signature

You might also like