SRM VALLIAMMAI ENGINEERING COLLEGE

(An Autonomous Institution)

SRM Nagar, Kattankulathur – 603 203

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

QUESTION BANK

I SEMESTER
1912101–ADVANCED DATASTRUCTURES & ALGORITHM
Academic Year 2019 – 20 ODD

Prepared by

M.Priyadharshini,AP/CSE
 SRM VALLIAMMAI ENGINEERING COLLEGE
SRM Nagar , Kattankulathur-603203

DEPARTMENT OF COMPUTERSCIENCE & ENGINEERING

QUESTION BANK

SUBJECT : 1912101-ADVANCED DATASTRUCTURES & ALGORITHM

SEM/YEAR: I-M.E/I
UNIT I DESIGN OF EFFICIENT ALGORITHMS
Data structures: lists, queues, and stacks - Set representations - Graphs-Trees - Recursion -Divide-and-
conquer - Balancing -Dynamic programming -Sorting and Order Statistics - The sorting problem -
Radix sorting -Sorting by comparisons – Heap sort-an O(n log n) comparison sort – Quicksort-an O(n
log n) expected time sort.
PART-A
Q.No Questions BT Competence
Level
1 Express the term data structures. BTL Understand
2
2 Identify the types of data structures. BTL Analyze
4
3 List the advantages of data structures. BTL Remember
1
4 Tabulate the difference between stack and queue. BTL Remember
1
5 Distinguish graph and tree. BTL Understand
2
6 Interpret the various applications of stack. BTL Understand
2
7 Differentiate Recursion from normal function. BTL Analyze
4
8 Give the various sorting techniques. BTL Understand
2
9 What is meant by Recursion? BTL Remember
1
10 Apply any of the implementation strategy of stack. BTL Apply
3
11 Compose on the term set representation. BTL Create
6
12 Measure O (n log n) comparison strategy. BTL Evaluate
5
13 Formulate the equation to calculate running time of a program. BTL Create
6
14 State the various set representations. BTL Remember
1
15 Show the narration of dynamic programing. BTL Apply
3
16 Define graph. BTL Remember
1
17 Name the different types sorting techniques. BTL Remember
1
18 Compare heap sort and merge sort. BTL Analyze
4
19 Illustrate on comparison sort. BTL Apply
3
20 Evaluate an algorithm to perform any of the traversal. BTL Evaluate
5
PART B

1 i).Summarize on different types of data structures (7) BTL Evaluate

(6) 5
ii). Explain the various ADTs.
2 List the various set representations in data structures. (13) BTL Remember
1
3 i).Define deterministic data structures. (4) BTL Remember
1
ii).Describe ADT elaborate stack using it.
(9)
4. i). Identify the various operations in set representation. (6) BTL Remember
(7) 1
ii). Examine the applications of stack.
5 i).Discuss the Queue ADT. (7) BTL Understand
2
ii). Explain the concept of Recursion
(6)
6 Differentiate the various operations in stack and Queue BTL Analyze
4
7 Implement Tree traversal using an algorithm. BTL Apply
3
8 Recall the different types of trees along with example (13) BTL Understand
2
9 i).Formulate the Graph Traversal Techniques. (9) BTL Create
6
ii).Compose any application of graph.
(4)
10 Implement the Divide and Conquer strategy using an BTL Apply
3
algorithm.
11 Find the various sorting techniques write an elaboration for (13) BTL Remember
1
Radix sort
12 Compare and Contrast Heap sort and Quick sort BTL Analyze
4
13 Analyze theO(n log n) for any of the sorting techniques. (13) BTL Analyze
4
14 With suitable examples, Summarize on time sort on a quick (13) BTL Understand
2
sort.
 PART C
1 Evaluate Heap sort with your own example. BTL Evaluate
5
2 Integrate the sorting problems and analyze radix sort. BTL Create
6
3 Analyze on the applications of stacks and queues. BTL Create
6
4 Explain the dynamic programing with a suitable BTL5 Analyze
implementation.
UNIT II DATA STRUCTURES FOR SET MANIPULATION PROBLEMS
Fundamental operations on sets - Hashing - Binary search - Binary search trees - Optimal binary search
trees - A simple disjoint-set union algorithm. - Tree structures for the UNION-FIND problem -
Balanced tree schemes - Dictionaries and priority queues - Merge able heaps – Concatenable queues. -
Partitioning
PART-A
Q.No Questions BT Competence
Level
1 Apply the hashing technique to implement. BTL Apply
3
2 Analyze the fundamental operations of set. BTL Analyze
4
3 Construct the Binary Tree. BTL Apply
3
4 List the features of Binary search Tree. BTL Remember
1
5 What is optimal binary search? BTL Remember
1
6 Compare and Contrast Binary Tree and Binary search Tree. BTL Understand
2
7 Illustrate a simple disjoint-set union algorithm. BTL Apply
3
8 Perform traversal in Binary tree BTL Analyze
4
9 Contrast heaps and queues with examples. BTL Understand
2
10 Develop set union algorithm. BTL Create
6
11 Name the dictionaries. BTL Remember
1
12 Formulate the steps of merge able heaps. BTL Create
6
13 Evaluate priority Queues. BTL Evaluate
5
14 Define concatenable queues. BTL Remember
1
15 Express the term partitioning. BTL Understand
2
16 State UNION-FIND problem. BTL Remember
1
17 Interpret merge able heaps and concatenable queues. BTL Understand
2
18 Analyze on priority Queues. BTL Analyze
4
19 Label the algorithm for disjoint-set. BTL Remember
1
20 Create a binary search tree. BTL Evaluate
5
PART-B
1 i).Discuss fundamental operations of sets. (6) BTL Understand
2
ii).Express an example for the operations on set.
(7)
2 Illustrate Hashing technique? Give algorithm and example. BTL Apply
(13) 3

3 Describe about basic concepts of Binary Tree (13) BTL Remember

1
4 Develop algorithm to implement Binary Search Tree (13) BTL Create
6
5 i) .State the optimal binary search tree. (6) BTL Remember
(7) 1
ii).Develop an algorithm for the same.
6 i).Express the features of Binary Search Tree. (8) BTL Understand
(7) 2
ii).Differentiate Binary Tree and Binary Search Tree
7 Point out the steps in disjoint-set union algorithm. (13) BTL Analyze
4
8 i).Examine tree structure for UNION -FIND problem (8) BTL Remember
ii).Give an example for the same. (5) 1
9 Tabulate various balanced Tree schemes. BTL Remember
1
10 i).Design an algorithm for balanced tree schemes (7) BTL Understand
2
ii).Discuss on priority queues.
(6)
11 i).Explain the algorithm for priority queues. (6) BTL Evaluate
5
ii).Explain about Merge able heaps
(7)
12 Analyze on the following. BTL Analyze
(6) 4
i). Concatenable queues
ii).Partitioning. (7)

13 Arrange the following G,P,K,L,A,B,M,O,Z,C using. BTL Analyze

(6) 4
i). Binary Tree.
ii).Binary Search Tree. (7)
14 Construct a tree structure for UNION-FIND problem. BTL Apply
3
PART C
1 Createa tree that support the features of Binary search Tree (15) BTL Create
6
Evaluate the hashing techniques with example. (15) BTL Evaluate
2. 5

3 Summarize on any of the sorting techniques. (15) BTL Evaluate

5
4 Design an example for implementing radix sort (15) BTL Create
6
UNIT III-ALGORITHM DESIGN TECHNIQUES
Divide-and-Conquer Algorithms - The Problem of Multiplying Long Integers-Balancing Sub problems-
Dynamic Programming-The Triangulation Problem -Greedy Algorithms-Backtracking-Implementing
Backtrack Search-Branch-and-Bound Search-Local Search Algorithms – Introduction to String
Algorithms – Introduction to Randomized and approximation algorithms- Introduction to Parallel
Algorithms
PART-A
Q.No Questions BT Competence
Level
1 Express the term dynamic programming BTL Understand
2
2 Define backtracking. BTL Understand
2
3 Recall the algorithm for divide and conquer. BTL Remember
1
4 List the problem of multiplying long integers. BTL Remember
1
5 Distinguish long integers and short integers. BTL Understand
2
6 Distinguish dynamic programing from others. BTL Understand
2
7 Name the techniques for balancing sub problems. BTL Remember
1
8 Evaluate triangulation problem. BTL Evaluate
5
9 State the triangulation problems. BTL Remember
1
10 Design the triangulation problem. BTL Create
6
11 Classify the Greedy algorithms. BTL Analyze
4
12 Illustrate Backtrack search. BTL Apply
3
13 Assess the methods to implement backtrack search. BTL Evaluate
5
14 Tabulate the parallel algorithms. BTL Remember
1
15 Show the advantages of branch and bound strategy. BTL Apply
3
16 Point out the local search algorithms BTL Analyze
4
17 What is randomized algorithm? BTL Remember
1
18 Illustrate the approximation algorithm. BTL Apply
3
19 Classify the types of local search algorithms. BTL Analyze
4
20 Generalize the string algorithms. BTL6 Create
PART-B
1 Discuss the Divide and Conquer algorithms. (13) BTL Understand
2
2 State the problems of multiplying long integers. (13) BTL Remember
1

3 i).List the steps for Balancing of sub problems. (3) BTL Remember
(10) 1
ii).Describe the divide and conquer algorithm.
4 Design and develop the Triangulation problem with an (13) BTL Create
6
algorithm.
5 i).What is Greedy Technique? (5) BTL Remember
1
ii).Design and implement an algorithm for Greedy method.
(8)
6 Summarize on Backtracking along with an example. BTL Understand
2
7 i).Differentiate backtrack search from the other searching (7) BTL Analyze
4
methods.
ii).Select the example to narrate the backtrack search. (6)
8 Recommend the techniques BTL Evaluate
i).Dynamic programming (7) 5

ii).Balancing the sub problems. (6)

9 Examine the Branch and Bound technologies with an (13) BTL Apply
3
example.
10 i).Analyze the Local search algorithms. (7) BTL Analyze
4
ii).Demonstrate string algorithm along with an example.
(6)
11 Express the local search algorithm along with an example. (13) BTL Understand
2
12 i).Explain the String algorithm. (7) BTL Analyze
ii).Point out the advantages of parallel algorithm. 4
( 6)
13 Tabulate the difference between local search algorithms BTL Remember
 1
14 Show the advantages of Randomized algorithm along with the (13) BTL Apply
3
apllications
PART C
1 Create an example that supports divide and conquer BTL6
Create
algorithm.
2 Explain in detail about backtracking with your example. (15) BTL Evaluate
5
3 Evaluate greedy technique with a suitable example. BTL5 Evaluate

4 Plan the algorithm for branch and bound strategy. (15) BTL Creating
6

UNIT IV ALGORITHMS ON TREES

Binary Search Trees: Basics – Querying a Binary search tree – Insertion and Deletion-
Red-Black trees: Properties of Red-Black Trees – Rotations – Insertion – Deletion -B-
Trees: Definition of B- trees – Basic operations on B-Trees – Deleting a key from a B-Tree- Fibonacci
Heaps: structure – Mergeable-heap operations- Decreasing a key and deleting a node-Bounding the
maximum degree.
PART-A
Q.No Questions BT Competence
Level
1 Describe Binary search Tree. BTL Understand
2
2 Illustrate on insertion and deletion of Red Black Tree. BTL Apply
3
3 List the properties of Red Black Tree. BTL Remember
1
4 Analyze the term rotation. BTL Analyze
4
5 Quote the importance of Red Black Tree. BTL Remember
1
6 Define B Tree BTL Remember
1
7 Express the insertion operation in B Tree BTL Understand
2
8 State deletion key in B Tree. BTL Remember
1
9 Differentiate Binary search tree and B Tree. BTL Understand
2
10 Show the operations of B Tree. BTL Apply
3
11 Compare Red Black tree and B Tree. BTL Evaluate
5
12 Define Fibonacci Heap. BTL Remember
1
13 Integrate the deletion operation of the B Tree. BTL Create
6
14 Discriminate Binary Search Tree and Red Black tree. BTL Evaluate
5
15 Quote rotation process in trees. BTL Remember
1
16 Express the deletion mechanism of binary search tree. BTL Understand
2
17 Formulate the operation of merge able heaps. BTL Create
6
18 Categorize the process of decreasing the key value and BTL Analyze
deleting a node. 4
19 Differentiate Fibonacci heap and merge able heap. BTL Analyze
4
20 Classify on bounding on maximum degree. BTL Apply
3
PART-B
1 i).Define Binary Search Tree. (4) BTL Remember
ii).List the features of binary search tree with an example. 1
(9)
2 i).Give an example for insertion in B Tree. (4) BTL Understand
ii).Summarize the features of B Tree.
2
(9)
3 Express in detail about querying Binary search tree.. (13) BTL Understand
2
4 Solve the insertion and deletion logic in (13) BTL Apply
3
W,R,G,P,F,U,K,C,A,Z for B Tree
5 Demonstrate the basic operations with an example. BTL Remember
i) B tree. (6) 1

ii) Binary search tree. (7)

6 i).Point out the basic operations of Binary search tree BTL Analyze
ii).Compare and contrast B Tree and Binary search tree (7) 4

(8)
7 Evaluate the features of Red Black Tree with an example. (13) BTL Evaluate
5
8 i).Classify the insertion process of Red Black tree (9) BTL Analyze
ii).Analyze on rotation of a node. 4
(4)
9 Formulate the basic operations of B Tree... (13) BTL Create
6
10 Elaborate in detail about the following
(8) BTL Remember
i).Deletion operation of B Tree
1
ii).Give your example for the above (5)
11 Explain Fibonacci Heap by constructing its structure. (13) BTL Analyze
4
12 List and explain the various operations of merge able heap (13) BTL Remember
1
with an example.
13 Illustrate the following in detail BTL Apply
3
i).Fibonacci Heap structure
(8)
ii).Merge able Heap operations (7)

14 Discuss the following in detail BTL Understand

(7) 2
i). Decreasing the key and deletion.
ii).Bonding on maximum degree. (6)
PART C
1 Explain in detail about the B Tree (15) BTL
Create
6
2 Evaluate an example for heap sort (15) BTL
Evaluate
5
3 Create a tree that satisfies the features of red black tree. (15) BTL Create
6
4 Analyze the importance of Fibonacci and merge able heaps. (15) BTL Create
6
UNIT V-ALGORITHMS ON GRAPHS
Minimum-cost spanning trees- Depth-first search - Biconnectivity-Depth-first search of a directed
graph - Strong connectivity- Path-finding problems -A transitive closure algorithm - A shortest- path
algorithm - Path problems and matrix multiplication - Single-source problems - Dominators in a
directed acyclic graph: putting the concepts together
PART-A
Q.No Questions BT Competence
Level
1 Distinguish strong connectivity and weak connectivity. BTL Understand
2
2 Define the term minimum cost spanning tree BTL Remember
1
3 Give an example for minimum cost spanning tree BTL Understand
2
4 Compare depth first and breadth first. BTL Analyze
4
5 What is biconnectivity? BTL Remember
1
6 Define directed graph. BTL Remember
1
7 State strong connectivity. BTL Remember
1
8 Evaluate the path finding problems. BTL Evaluate
5
9 Formulate a transitive closure algorithm. BTL Create
6
10 Analyze the shortest path algorithm. BTL Analyze
4
11 Integrate the list of path problems. BTL Create
6
12 State an example for matrix multiplication BTL Remember
1
13 Summarize the path algorithm for matrix operation. BTL Understand
2
14 Quote the term single source problem. BTL Remember
1
15 Point out the path finding algorithms BTL Analyze
4
16 Show the difference in directed and undirected graph. BTL Apply
3
17 Illustrate the dominators in directed graph. BTL Apply
3
18 Assess the difference between cyclic and acyclic graph BTL Evaluate
5
19 Differentiate directed and undirected graph BTL Understand
2
20 Demonstrate the term biconnectivity. BTL Apply
3
PART-B
1 i).List the features of spanning tree (8) BTL Remember
1
ii). Identify the characteristics of minimum cost spanning tree.
(5)
2 Elaborate in detail the minimum cost spanning tree (13) BTL Remember
1
3 i).Give the briefing of biconnectivity. (7) BTL Understand
2
ii).Identify the algorithm for depth first search.
(9)
4 Express the steps for depth first search with an example, BTL Understand
2
5 i). Analyze the steps for depth first search
BTL Analyze
ii).What do you understand by biconnectivity
4
6 i).Define strong connectivity. (5) BTL Remember
1
ii).Examine depth first search with an example
(8)
7 i).Demonstrate path finding algorithms (7) BTL Apply
3
ii).Illustrate transitive closure algorithm
(6)
8 i).Evaluate the advantages of path finding algorithm. (7) BTL Evaluate
5
ii).Summarize the concept of strong connectivity.
(6)
9 Design a shortest path algorithm with an example (13) BTL Create
6
10 Classify the term transitive closure algorithm. (13) BTL Analyze
4
11 Point out the following in detail BTL Analyze
(7) 4
i).Path finding algorithm
ii).Shortest path algorithm. (6)
12 Describe in detail about the depth first search with own (13) BTL Remember
1
example.
13 Discuss on single source problem and path problems in matrix (13) BTL Understand
2
multiplication
14 Calculate the performance of dominators in directed acyclic (13) BTL Apply
3
graph
PART C
1 Create a minimum cost spanning tree. BTL
Create
6
2 Design and explain path problems in matrix multiplication (15) BTL
Evaluate
6
3 Evaluate breath first search. BTL Evaluate
5
4 Summarize on the term biconnectivity. (15) BTL Evaluate
5