Scribd
Upload
13 views3 pages

QB DS

Uploaded by

gurkeeratbambra
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
13 views3 pages

QB DS

Uploaded by

gurkeeratbambra
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

Christian college of Engineering and Technology

Question Bank of Data structure

Unit -1

1) Explain time and space Complexity in Detail


2) Explain Asymptotic notation
3) Write algorithm to delete last node from circular link list
4) What is time complexity ? Explain significance of big 0,theta and omega notations
5) Explain row major order and column major order with example
6) Explain Array implementation using singly link list and doubly link list
7) Write an algorithm to inset anew nodde at the end of singly linked list
8) Explain Sparse matrices and its Representation
9) Given an array and no. find two integers that some to given write an algorithm for this
10) Explain Efficiency of algorithm in terms of space and time

Unit -2
1) Explain Abstract Data Type in Detail
2) Write step to convert infix to postfix expression
3) Define overflow and under flow in stack
4) Explain tower of Hanoi problem also write its algorithm
5) Write an Algorithm for push ,pop and traversing of stack by using Array
6) Define circular Queue and write an algorithm to delete an item from array queue
7) Design an algorithm to infix to post fix expression with example infix Expression

K+L –M*N+(O^P)*W/U/V*T+Q
8) Explain Queue operation enqueue dequeue
9) Convert infix to postfix
A-B/(C*D^E)

10) Convert infix to postfix


A+[(B+C)+ (D+E)*F]G

Unit -3
1) Explain Binary search tree in Detail

2) Explain Array and link representation of Binary tree


3) Explain Inorder ,Preorder , Postorder with example
4) Findout preorder and postorder traversal

A+(B+C*D+E)+F/G

5) Write an algorithm for bst construct bst with following element


50,15,62,5,20,58,91,3,8,37,60,24
6) Write algorithm for preorder traversal
7) Write algo for post order traversal
8) Explain 4 types of Binary search tree with example
9) Apply Binary Search to find 123 in a list

35,89,114,123,143,191,197,211,240,286,845,890
10) Construct a max heap for the given array of the elements
1,5,6,8,12,14,16

Unit -4
1)Explain BFS and DFS in detail with example
2)Write an algorithm to implement Kruskal’s algorithm also explain with the help of a
suitable example.
3) For the Graph Shown below find the following
i. Adjacency list Representation
ii. Adjacency matrix representation
iii. Adjacency multilist representation

A
B

C D
V

4) Explain insertion and Deletion of a new element in Binary search tree along with algorithm

5) Define Graph and all type of terminology of graph

6) Explain Warshalls algorithm for shortest path in Graph

7) Write a program to insert and delete an element in array

Unit -5
1) Explain Sequential searching
2) Explain bubble sort with algorithm also write its program

3) Explain Quick sort algorithm so given sequence using Quick sort increasing order
50, 3,1,60,65,45,90,13,67
4) Define Hashing
5) Define AVL tree and explain all type of rotation
6) Write the binary Search algorithm and trace to search element 91 in the following list
7) 13,30,62,73,88,91
8) What do you understand by AVl tree ? Insert the following node into AVL tree
10,15,20,8,13,25,6,28
9) Explain B and B+ tree
10) Sort the Array by Radix sort
348,143,361,423,538,128,321,543,366

You might also like