Scribd
Upload
66 views6 pages

DSPD QB

The document contains questions from various units on the topics of data structures and algorithms including sorting, searching, stacks, queues, linked lists, trees, graphs and their traversals. Questions cover concepts like asymptotic analysis, different sorting and searching algorithms, implementation of stacks, queues and linked lists, binary trees, binary search trees, tree traversals, graphs and graph algorithms.

Uploaded by

dindyalsingh2310
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
66 views6 pages

DSPD QB

The document contains questions from various units on the topics of data structures and algorithms including sorting, searching, stacks, queues, linked lists, trees, graphs and their traversals. Questions cover concepts like asymptotic analysis, different sorting and searching algorithms, implementation of stacks, queues and linked lists, binary trees, binary search trees, tree traversals, graphs and graph algorithms.

Uploaded by

dindyalsingh2310
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/ 6

Priyadarshini College of Engineering, Nagpur

Session 2022-2023
Question Bank
Department: Comp. Tech Subject: DSPD
Subject Code: BTCT211T Semester: 4th sem

Unit : 1
1. Elabortae the steps for sorting following elements using quick sort. Also specify its time
complexity in all cases. 21 06 56 61 44 07 09 76 75 32.
2. Search the following elements using linear search as well as binary search. Give the step
by step representation for successful as well as unsuccessful search. Also specify time
complexity of both 80 75 45 90 30 40 12 15 93 08.
3. Sort the following array using Bubble sort : 10,1,9,11,46,20,15,0,72,2.
4. Explain asymptotic notation.
5. How to decide performance of an algorithm? Explain big O notation in brief.
6. Suppose 'A' array contains 10 elements as follows :
10,23,44,11,2,66,3,9,7,63. Sort array 'A' using Quick Sort.
7. Explain in brief Abstract Data Type.
8. Explain the concept of data structure in detail. Also explain abstract data type.
9. Write down the algorithm for merge sort and sort the sequence of following numbers using
an algorithm. 45, 23, 11, 35, 67, 87, 24, 66.
10. How to decide performance of an algorithm? Explain big O notation in brief.

11. What do you mean by Divide and conquer strategy? Give suitable example for the same.
12. Explain the following terms:
i) Data structure and its types
ii) Abstract data type.
iii) Flowchart and its symbols.
iv) Time and space complexity.
13. What do you mean by analysis of algorithm? Explain different asymptotic notations use
for analysis of algorithm.
Unit : 2

1. What is stack? State the difference between stack and queue.


2. Explain queue with example. What operation can be perform on queue?
3. Convert the following expression into postfix using stack.
i) A *(B + C)- (G +H) / L +P
ii) x *( y + z) / A - B * (C+ D / E)
iii) a+ b * c +(d*e + f ) *g
4. Explain :
i) Priority queue
ii) Double ended queue
5. Explain array representation of queue.
6. Define queue? How it is differ from stack? Write any two application of queue.
7. Write a Aalgorithm to implement PUSH and POP operation on stack and display
on the output screen.
8. What is linked list? How is it represented in to memory?
9. Discuss dynamic memory allocation. State advantages and disadvantage of it.
10. Write algorithm for PUSH and POP operation on stack.
11. Write down the insertion and deletion process in a circular queue. Explain with
example.
12. Write short notes on:-
i) Multiple stacks
ii) Circular queue.
iii)Priority queue.
Unit : 3
1. What is doubly linked list? Write down the algorithm for inserting a node to the
beginning and deleting a node from a doubly linked list.
2. What is Doubly linked List? Write an algorithm to reverse the links of doubly
Linked list?
3. Write a note on :
i) Singly linked list
ii)Circular linked list.
4. Implement typical stack operations using a linked list.
5. Write an algorithm to search an element in singly linked list.
6. What is Doubly Linked list ? Write an algorithm to reverse the links of singular
linear linked list ?
7. Write ''C'' functions to perform following operations on singly linked list:
i) Insert node at beginning.
ii)Insert node at end.
8. Explain various types of linked list with proper representation and example.
9. Write an algorithm for insertion in the doubly linked list.
i) Insertion at beginning.
ii) Insertion at end
iii) Insertion at specific location.
10. Write down the insertion and deletion process in a circular queue. Explain with
example.
Unit : 4
1. Explain Binary search tree ? Construct binary search tree for following data:-
43,49,69,20,33,31,2,1,5,7.
2. Define & explain with example. i) Tree ii) Binary tree iii) Binary search tree iv) Complete
Binary tree v) Full Binary tree vi) A V L tree vii) Threaded Binary tree.
3. Write short notes on threaded binary trees.
4. What is an AVL tree? Explain with suitable example, how height is balanced in an AVL
tree after a new insertion.
5. Convert following tree in to binary tree

L
A

M N O
B C

P Q
F
D E R

6. What is binary tree? Draw the binary tree for the following expression
i) (a+(b*c)/(d*e))
ii) A+ (B * C ) / D
iii) (A+ B) * (C+ D) * (E+ F)

7. Construct a tree for following pre order and inorder traversal.


Preorder : G B Q A C K F P D E R H
In order : Q B K C F A G P E D H R
8. Write an algorithm for postorder traversal of Binary Tree
9. What is binary Search Tree? If we delete a node from BST and then insert the node again
in BST, is the resulting BST necessarily the same as before. Justify your answer with a
suitable example.
10. What is Binary search tree? For the given, sequence, create a binary search tree
60,25,75,50,66,15,33,44.
11. Explain various kinds of traversals in a binary tree and illustrate the same for following
example.
Unit : 5

1. What is a graph ? Explain Also obtain for the following graph.


i) Indegree & outdegree of each node ii) The adjacency matrix
iii) The adjacency list iv) The adjacency multilist

2. Differentiate between BFS and DFS techniques of graph traversal.


3. Explain the depth first search on any graph with suitable example.
4. Explain Breadth first search on a graph with suitable example.
5. Describe DFS algorithm. Find out the DFS traversal of the following graph starting at
node A.

6. Find the minimum cost spanning tree using Kruskal's method for the following graph.

7. Why B tree is considered a better structure than B-tree for implementation of an indexed
sequential.

8. What is height balanced tree? Explain what you mean by balance factor. Construct a
height balanced tree from the following sequence of integer.
40 30 20 10 05 50 60 80 70
9. Define the following.10 i)Complete graph. ii)Degree of a graph. iii) Path of a graph.
iv) Strongly connected component. v)Hamiltonian path. vi) Isolated Vertex. Explain
each term with a suitable example.
10. Define graph what are different types of graphs and different ways of representation of
graphs? Explain each with suitable example.
11. Explain prims algorithm to find minimum cost spanning tree with suitable example.
12. How many minimum spanning trees does the following graph have? Draw them.

13. Find the minimum spanning tree for the following graph.

14. Describe DFS algorithm find out DFS traversal of the following graph starting at node A.

You might also like