Scribd
Upload
10 views2 pages

2nd Mid Ads Subjective

This document outlines the mid-exam questions for the Advanced Data Structures course at Malla Reddy Engineering College for MTech I Semester. It includes questions on topics such as infix to postfix conversion, collision resolution methods, sorting algorithms, tree traversals, and various tree structures. Each question is associated with Bloom's Taxonomy levels and marks, indicating the expected depth of understanding required from students.

Uploaded by

kalpanamrec23
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
10 views2 pages

2nd Mid Ads Subjective

This document outlines the mid-exam questions for the Advanced Data Structures course at Malla Reddy Engineering College for MTech I Semester. It includes questions on topics such as infix to postfix conversion, collision resolution methods, sorting algorithms, tree traversals, and various tree structures. Each question is associated with Bloom's Taxonomy levels and marks, indicating the expected depth of understanding required from students.

Uploaded by

kalpanamrec23
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
You are on page 1/ 2

MR 20

CODE: A5101
MALLA REDDY ENGINEERING COLLEGE (AUTONOMOUS)
I MTech I Semester II mid exam
Subject: ADVANCED DATA STRUCTURES Branch: CSE
Name of the Faculty: Max. Marks:
Instructions:
1. All the questions carry equal marks
2. Solve all the questions

Bloom’s Taxonomy Mark


Q.No. Questions CO’s
Level s
Module III
1. Briefly explain about infix to postfix conversion using stack? L2 3 4
2. Describe about collision resolution methods? L2 3 4

3. Explain the algorithm to perform Quick Sort. Also analyze 3 4


L2
the time complexity
4. Analyze the comparison of sorting methods? L4 3 4
Module IV

1.. Explain tree traversals with 4 4


L2
example
2. Define Binary Tree, and describe the insertion and deletion 4 4
L1
procedure for binary tree.
3. Compare Binary tree and threaded binary tree. L2 4 4
Memorize the concept of threaded binary tree? Analyze the
4. impact of such a representation on the tree traversal L1 4 4
procedure?
5. Illustrate about minimum cost spanning tree using kruskal’s 4 4
L1
algorithm?
4 4
6. Identify the recursive and non-recursive traversals? L1

7. Describe the applications of graphs? L1 4 4

8. Write short notes on the following algorithm? 4 4


L3
a)Dijkstar’s b)Kruskal’s
Module V

Explain about Binary search tree ADT? L2 5 4


1.

2. Define B-Tree. Outline its properties and insert & delete 5 4


L1
operations
3. Evaluate Insertion, deletion and display procedures of AVL 5 4
L2
tree.
4. Explain Red black tree. Explain the properties and operations 5 4
L2
of red black tree with example.
5. Classification about pattern matching with KMP algorithm? L1 5 4

6. Write a short notes on 5 4


L3
a)compressed tries b)suffix tries
7. Comparison of Binary-Search Tree & AVL Tree& B-Trees L2 5 4

Signature of the Faculty Signature of HOD

You might also like