Scribd
Upload
431 views

DS-IISEM-Question Bank

This document contains a question bank with multiple choice and descriptive questions divided into 5 units related to algorithms and data structures. Unit 1 covers fundamental concepts like algorithms, time and space complexity, recursion, data abstraction and data structures. Unit 2 covers linked lists, stacks, queues and their applications. Unit 3 covers binary trees, heaps, priority queues, disjoint sets and their related operations. Unit 4 covers searching and sorting algorithms like linear search, binary search, hashing and various sorting techniques. Unit 5 covers graphs, binary search trees, AVL trees, B-trees and their traversals and representations. The question bank is intended to assess students' understanding of key algorithms and data structures concepts.

Uploaded by

badugulasriman
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
431 views

DS-IISEM-Question Bank

This document contains a question bank with multiple choice and descriptive questions divided into 5 units related to algorithms and data structures. Unit 1 covers fundamental concepts like algorithms, time and space complexity, recursion, data abstraction and data structures. Unit 2 covers linked lists, stacks, queues and their applications. Unit 3 covers binary trees, heaps, priority queues, disjoint sets and their related operations. Unit 4 covers searching and sorting algorithms like linear search, binary search, hashing and various sorting techniques. Unit 5 covers graphs, binary search trees, AVL trees, B-trees and their traversals and representations. The question bank is intended to assess students' understanding of key algorithms and data structures concepts.

Uploaded by

badugulasriman
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/ 5

Question bank prepared by faculty (unit wise)

Unit-1

Part-A
1. Define the term algorithm .
2. Differentiate between recursive and iterative algorithms.
3. Describe best case, average case and worst-case efficiency of an algorithm
4. How do you measure the algorithm running time?
5. Define the term Time Complexity.
6. Define the term Space complexity.
7. Define the term Data abstraction?
8. Define data structure and its types.
9. List linear and nonlinear data structures.
10. List out any four applications of data structures?
11. List areas where data structures can be applied?
12. What is meant by an abstract data type (ADT)?
Part-B

1. Discuss various the asymptotic notations used for best case average case and worst-case
analysis of algorithms.
2. Discuss about various asymptotic notations with examples.
3. Define recursion? Explain with its Fibonacci series and factorial of a number.
4. Describe the reasons of using the space complexity and time complexity in measuring the
performance of a program?
5. Explain time and space complexities in detail
6. F(n)=3n2-n+4 show that f(n)=O(n2)
7. F(n)=5n2+10n convert this to Ω() notation.
8. Explain about ADTs with suitable examples.
9. What is recursion? What are the conditions for a recursive function to run? Write a
recursive function to implement the reversing a number?
10. Find omega notation for f(n)=4n2+7n+12.
11. Define data structure. Explain about linear and nonlinear data structures.

Unit-2

Part-A
1. State the different types of linked lists?
2. List the applications of stack?
3. List out the basic operations that can be performed on a queue?
4. With a neat diagram represent 2 elements (12, 10) in Circular linked list.
5. What is a stack?
6. Define Linked list?
7. Convert the infix expression (a+-(c* into postfix form?
8. List the basic operations carried out in a linked list?
9. Write the representation of double linked list with a neat diagram?
10. State the different ways of representing an expression?
11. List out the basic operations that can be performed on a stack?
12. What is an array? What are the different types of arrays?
Part-B
1. Explain the procedure to convert infix expression into postfix expression. Convert the
following expression ((A-(B+)*D^(E+F) into postfix form.
2. Explain different operations on single linked list? Write a C++ code snippet to create and
delete an element from single linked list
3. Explain the procedure to evaluate postfix expression and evaluate the given expression
623 + - 382 / + * 2 / 3 +
4. Explain different operations on circular linked list? Write a C++ code snippet to create
and delete an element from circular linked list
5. Write an algorithm to implement stack ADT using linked lists.
6. List and explain about double linked list insert and delete operations with an example.
7. Write a procedure to implement the following stack operations using linked list
i) push ii) pop
8. What is a circular queue? Explain the procedure for insert and delete operations
9. Explain the following operations in a double linked list
Insert an element
Delete an element
Reverse traversal of an element
10. Explain queue operation using array and linked list with an example each.
11. Explain Array and Linked representation of Sparse Matrix.
Unit-3
Part-A
1. Define full binary tree?
2. What is the function of find operation in disjoint sets?
3. List the different tree traversals?
4. Define Max heap?
5. Define tree?
6. List the operations can be performed on priority queue?
7. Define degree of the node?
8. Give the representation of full binary tree and complete binary tree with an example?
9. Define complete binary tree?
10. Give the representations for max tree and min tree.
11. Define path in a tree?
12. What are the tasks performed during post order traversal?
Part-B
1. construct a binary tree from a given pre order and in order sequence
Pre order: ABDGCEHIF
In order: DGBAHEICF construct a binary tree from a given pre order and in order sequence
Pre order: ABDGCEHIF
In order: DGBAHEICF
2. Explain tree traversal with an example.
3. Write a c++ program that uses functions to perform the following(each carry 10 marks)
i) Create a binary search tree of characters
ii) Traverse the above binary search tree recursively in order
4. Write a c++ program that uses functions to perform the following
Traverse the above binary search tree recursively in pre order, in order and post order
5. Define Mix heap. Construct a mix heap for the following {12,15,9,8,10,18,7,20,25}.
6. Explain about union –find problem with an example
7. Write inorder, preorder, postorder, level order traversals of the following tree with
procedure.

8. Explain about union –find problem with an example


(Or)
Explain smart union/union by rank algorithm with an example.
9. Define Max heap. Construct a max heap for the following {12,15,9,8,10,18,7,20,25}.
10. Explain priority Queue ADT with operations
11. Define threaded binary tree? Write about threaded binary tree using in order traversal
with an example.
12. Discuss max priority queue ADT with examples
Unit-4
Part-A
1. What is searching? List various search methods?
2. Define linear probing?
3. Define collision?
4. What is meant by linear search?
5. State different types of collision resolving techniques?
6. Mention the types of searching.
7. Define quadratic probing?
8. What is binary search?
9. What Do You Mean By Disjoint Set ADT?
10. List the various sorting methods?
11. Define sorting.
12. What are the collision resolution methods?
Part-B
1. Write a C++ program for binary search. Explain with an example.
2. Explain heap sort algorithm and simulate it for the following data
{82,90,10,12,15,77,55,23}
3. Define collision and discuss any two collision resolution techniques.
4. Explain radix sort with an example {82,901,100,12,150,77,55,23}
5. Explain about insertion sort with an example.
Demonstrate about merge sort with an example.
6. Differentiate linear search algorithm and binary search algorithm.
7. Insert the following list of elements into the hash table by using linear probing (size of
hash table is 10) {16,23,43,18,34,59,30,22} and explain.
8. Explain quick sort algorithm and simulate it for the following data {5,3,8,1,4,6,2,7}.
9. Write an algorithm for binary search and trace the following elements 4,5,6,10,11,12,15
to search 9 for an unsuccessful search.
10. Explain about collision resolution methods in hashing.
11. Explain selection sort and quick sort with an example.
12. Explain Linear and binary search with an example.
Unit-5
Part-A
1. What are the two traversal strategies used in traversing a graph?
2. Give an Example for binary search tree.
3. What is a weighted graph?
4. List the different AVL tree rotations to insert a node.
5. Define Graph.
6. Define AVL tree with an example?
7. Give an Example for directed graph and an undirected graph?
8. Define balance factor and what is the height of an AVL tree?
9. What are the representations of a graph.
10. State the operations on binary search tree.
11. Which data structures are used for BFS and DFS of a graph?
Part-B
1. Explain about adjacency matrix and adjacency list.
2. Explain graph search methods (BFS and DFS) with an example.
3. Explain various rotations of AVL trees maintaining balance factor while insertion takes
place.
4. Explain about binary search tree ADT with operations. Construct a binary search tree for
the following 100, 50, 200, 25, 90, 80, 150.
5. Explain graph ADT.Explain different ways representation of graphs.
6. Explain about binary search tree. Create binary search tree for the following elements
(23,32,24,36,15,12,39,2,19).
7. Explain the properties of binary tree and red black tree.
8. Explain about insertion operation on B-tree of order m with an example.
9. Define graph. Explain how graphs can be represented in adjacency matrix and adjacency
list.
10. Construct B-tree of order 5 for the following data
{3,14,7,1,8,5,11,17,13,6,23,12,20,26,4,16,18,24,25,19}
11. Write an algorithm to traverse a graph using breadth first search and depth first search.

You might also like