Scribd
Upload
10 views

Chapter Wise List of Questions

Uploaded by

patilaniketvilas6433
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
10 views

Chapter Wise List of Questions

Uploaded by

patilaniketvilas6433
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/ 4

Chapter Wise List of Questions

Chapter 1

1. What are the advantages of Linked List over Array .


2. Explain any two operations on Linked List
3. Wrtie an algorithm for traversing a linked list.
4. What is the purpose of Linked List.Enlist Application of Linked List.
5. Write an algorithm to implement singly linked list, also write algorithm to search a
given node from list.
6. Write an algorithm to display the contents in reverse order of singly linked list
7. What is the purpose of Linked List.
8. Define linked list, write an algorithm to implement doubly linked list.
9. Write an algorithm to display the contents in reverse order of doubly linked list.
10. Write an algorithm to count number of nodes in singly linked list.
11. Explain need of circular queue
12. What is the purpose of linked list?
13. Write an algorithm delete element from linked list whose sum is equal to zero.
14. Write an algorithm for double link list with insert from beginning, delete from end
and display functions

Chapter 2

1. Define stack, explain representation of stack using array and linked list.
2. Convert the following infix expression into its equivalent postfix form show contents
of stack in table format. Represent operator in stack and expression at each step.
A*(B+C^D) – E ^ F* (G/H)
3. Write an algorithm to implement following operations on Queue
(1) Insert (2) Delete (3) isFull (4) IsEmpty
4. Write an algorithm to implement circular queue.
5. Write an algorithm to implement queue using linked list.
6. Explain need of circular queue.
7. Evaluate the following prefix expression – + AB – * C + DE where A = 16, B = 4,
C = 3, D = 6, E = 7 Show contents of stack at each step in tabular form.
8. Discuss use of priority queue.
9. Write short Note on :- Application of stack, Priority queue
10. Convert infix to postfix form. Represent operator in stock and expression at each step.
11. A* (B – C D) + E F * (G/H).
12. Show the stack contents for each step during conversion of given a) Posfix expression
into infix : ABCD ^ –* EF ^ GH/*+
13. Write a program to implement priority queue using link list
Chapter 3

1. Write a short Note on Binary Tree


2. Explain different types of Tree with suitable example.
3. Draw a Binary search tree for following .also write preorder ,postorder,Inorder
traversal for given elements.
23,89,34,67,99,2,55,45,78,12,56
4. Construct binary Tree for the following
Inorder- 9,5,1,7,2,12,8,4,3,11
Post order- 9,1,2,12,7,5,3,11,4,8
5. Draw a binary search tree for following. Also write preorder ,postorder,Inorder for
this.
40, 20, 10, 50, 90, 30, 60, 70, 95, 55, 25, 80, 45.
6. Apply the algorithm to draw Binary search tree for the following data.
10, 08, 15, 12, 13, 07, 09, 17, 20, 18, 04, 05
7. Construct Binary Tree for following data 10, 25, 2, 4, 7, 13, 11, 22 and determine
inorder, postorder & preorder?
8. Define BST, explain traversal of binary tree with example.
9. Draw Binary tree from given traversal
inorder : 4, 2, 5, 1, 6, 7, 3, 8
Postorder : 4, 5, 2, 6, 7, 8, 3, 1
10. Write an Algorithm for preorder ,postorder and inoder with example.
11. Write a function for RL & LR rotation .
12. Draw AVL tree for following
40,20,10,50,90,30,60,70,95
13. Draw AVL Tree for following: 40, 20, 10, 50, 90, 30, 60, 70, 95, 55, 25, 80, 45.
14. Draw AVL tree for the following:
Nita, Mark, Prit, Rave, Somu, Jogi, Amar, Parm, Namo, Saro, Sita.
15. Define BST, explain traversal of binary tree with example
16. Construct AVL tree for the following 68, 82, 70, 49, 38, 75, 9, 82
17. Construct AVL tree for the following.
May, Feb, June, Mar, July, Dec, Jan.
Chapter 4
(1) List and Explain different type of graph representation technique.
(2) Give the Adjacency Matrix and linked list representation of undirected graph

(3) Compare BFS and DFS


(4) Explain Depth First search with suitable example
(5) Explain Breadth First search with suitable example
(6) Apply DFS algorithm on the following graph and show the steps.

(7) Generate DFS, BFS starting from node E, adjacency matrix adjacency list for
following graph. Also write algorithm for DFS and BFS.

(8) Generate DFS, BFS starting from node E, adjacency matrix adjacency list for
following graph. Also write algorithm for DFS and BFS.

(10)

11.A graph is implemented by adjacency matrix .Write a non-recursive algorithm


for DFS.
Chapter 5

Q1.Define Hash function & Collision

Define term Collision? Explain various techniques to resolve collision.

Q3.Write an algorithm for Min Heap to perform operation

1.Finding minimum value in min heap (algorithm)

2.Insert (algorithm)

Q3.Write an algorithm for Min Heap to perform operation

1.Finding minimum value in min heap (algorithm)

2.Insert (algorithm)

Q4.Difference between Separate chaining and Open Addressing

Q5.

Q6.

Q7.

You might also like