Scribd
Upload
9 views3 pages

Adsa QB

Uploaded by

putacash
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
9 views3 pages

Adsa QB

Uploaded by

putacash
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/ 3

Unit – I ROLE OF ALGORITHMS IN COMPUTING & COMPLEXITY

ANALYSIS

Part A
1 Define Algorithm.
2 Compare Stack and Queue.
3 What is the importance of an efficient algorithm?
4 Define Asymptotic Notations
5 What is best-case efficiency?
6 What is Big-O Notation?
7 What is Omega Notation?
8 What is Theta Notation?
9 What is Recursion?
10 Define Data Structure.
11 What are the types of Data Structures?
12 Compare Array and Linked list.
13 Define Stack and its operations.
14 Compare Time and Space Complexity.
15 What is the Substitution method?

Part B
1 Describe real-time applications of data structures.
2 Discuss the importance of efficient algorithms.
3 Illustrate iteration function for Fibonacci using C++.
4 Explain the Basic Tree Terminologies.
5 Explain Average and Worst case analysis.
6 Illustrate the Recurrence method with an example
7 Demonstrate the types of Data Structures
8. Describe the Time complexity for Binary and Linear Search.
Part C
1 Develop a C++ program using In order Tree traversal.
2 Design Asymptotic notations of algorithms.

Unit – II HIERARCHIAL DATA STRUCTURES

Part A
1 What is Hierarchical Data Structure?
2 Define Binary Search Tree.
3 What are Disjoint Sets?
4 List the Applications of Tree data structure.
5 Compare Min heap and Max heap.
6 What is a mergeable heap?
7 List properties of Red-Black Tree.
8 What is a B-Tree?
9 List the properties of B-Tree
10 What is Fibonacci heap?
11 What is Heap Data Structure?
12 What are the types of Heaps?
13 List out the Heap Operations.
14 Write two applications of Heap Data Structure.
15 Define Binary tree.
16 Draw a Left and right skewed tree.
17 What is RR conflict in Red Black Tree?
18 How are the rotations performed in Red Black Tree?
Mention the steps involved in deleting a node from a Binary Search
19
Tree.
20 Write the advantages and disadvantages of B-tree.
Part B
1 Analyze the Fibonacci heap and Mergeable heap.
2 Illustrate insertion and deletion operations of BST.
3 Demonstrate Heap implementation.
4 Discuss tree traversal techniques with an example
5 Explain Red-Black Tree insertion operations with examples.
6 Describe insertion and deletion operations in B-Tree.
7 Compare and contrast B Tree and Binary search tree
8 Analyze Binary Search Tree and Red-Black Tree.
Part C
1 Develop the construction of BST for the following data
10, 08, 15, 12, 13, 07, 09, 17, 20, 18, 04, 05
2 Design Red-Black Tree 8,18,5,15,17,25,40 and 80

Unit – III GRAPHS

Part A

1 Define Graph.
2 Draw a weighted graph.
3 What is a directed graph?
4 What is an undirected graph?
5 What is topological sort?
6 Draw the in-degree and out-degree of a graph.
7 Draw vertices and edges in a graph.
8 Write BFS algorithm.
9 What are the two traversal strategies used in traversing a graph?
10 Draw Articulation Points (or Cut Vertices) in a Graph
11 Define a biconnected graph.
12 Draw a spanning tree of the graph.
Mention two algorithms for the minimum spanning tree (MST)
13
problem.

Part B

1 Analyze the various representations of graphs with examples.


2 Describe the Breadth-First Search algorithm with an example.
3 Illustrate Depth-first Search implementation with an example
4 Discuss various applications of Graphs.
5 Illustrate Prim’s algorithm with an example.

Part C
1 Design Kruskal’s algorithm with an example.
2 Develop the Topological sort with your own and justify your answer.

You might also like