Two Marks:
1. Compare arrays vs list.
2. Which are called the articulation point or cut vertex. State with an example.
3. Differentiate between linear and binary search.
4. State any 2 significant differences between the insertion and quick sort.
5. Define the term data structure and mention their importance.
6. List the properties of Binary Search Tree.
7. Define articulation point or cut vertex.
8. Find out the in degree and out degree of a given graph
9. Generalize and develop a function to insert an element into a queue and delete an element
from a queue, in which the queue is implemented as a linked list.
10. Compose an algorithm to Reverse the elements of singly linked lists, count the number of
nodes in a given singly linked list. Searching the element from the linked list.
11. Show the simulation using stack for the following expression to convert infix to postfix: p*q+
(r-s/t) and A+B*(C-D)/(P-R)
12. Write an algorithm for pre-order, in-order and postorder traversal of a binary tree.
13. Brief about collision resolution techniques.
14. Differentiate between linear and binary search algorithms.
15. List the properties of B-Tree.
16. Define bi-connectivity.
17. Find out the in degree and out degree of a given graph
18. Brief about Rehashing.
19. Develop a simple algorithm for a linear search.
20. Differentiate the illustration of SLL, DLL, DCLL with the neat diagram.
21. Convert the infix (a+b)*(c+d) into postfix expression.
22. Give examples of Linear and Non-Linear Data Structures
23. Define a Doubly Linked List with suitable examples.
24. Distinguish between stack and queue
25. Convert the infix (a+b)*(c+d)/f into postfix & prefix expression.
26. Define node, degree, siblings, depth/height, level.
27. Calculate the Depth and height of the root node.
28. List the properties of B-Tree.
29. Distinguish between Internal sorting and External sorting.
30. Find out the in degree and out degree of the vertices.
14 Marks:
Unit 1:
1. Compose an algorithm to insert the elements of singly linked lists and searching the element
from linked list.(Insert a node in the beginning, Insert a node in the middle, Insert a node in
the last)
2. Compose an algorithm to Reverse the elements of singly linked lists, count the number of
nodes in a given singly linked list. Searching the element from the linked list.
3. Doubly Linked List
Unit 2:
1. Stack using Linked List.
2. Show the simulation using stack for the following expression to convert infix to postfix for
the expression a*b+(c-d/e).
3. Show the simulation using stack for the following expression to convert infix to postfix:
p*q+ (r-s/t).
4. Illustrate the array implementation of queue with an example. Explain how the isFull and
isEmpty will be incorporated in the queue.
5. Generalize and develop a function to insert an element into a queue and delete an element
from a queue, in which the queue is implemented as a linked list.
6. Stack using array
Unit 3:
1. Construct an AVL Tree by inserting numbers from 1 to 8.
2. Build Min Heap and max heap.
3. Write an algorithm for pre-order, in-order and postorder traversal of a binary tree.
4. Show the result of inserting 3, 1, 4, 6, 9, 2, 5, 7 into an initially empty binary search tree.
Show the result of deleting the root.
5. Write the procedures for AVL single and double rotations and illustrate with the example.
6. B tree
Unit 4:
1. Find the minimum cost spanning tree in the given graph using Prims and kruskal's
algorithm.
2. Shortest path algorithm
3. Write a pseudo code to perform a topological sort on a graph.
4. Graph traversal
Unit 5:
1. Quick sort.
2. Apply a rehashing method for your own set of key values and show how rehashing works
better when load factor threshold is reached.
3. Linear and Binary Searching
4. Sorting
5. Articulation point
6. Given input {4371,1323,6173,4199,4344,9679,1989} and a hash function h(x) =x mod10.
Prepare the resulting for the following: a. Separate chaining hash table. b. Open addressing
hash table using linear probing.
7. Simulate the insertion sort algorithm and show the step by step procedure to sort the
given data values: 23,11,37,28,15,19,55,9
8. Given input {1989, 4371,4199,6173,4344,1323, 9679} and a hash function h(x) =x
mod10. Show the working principle of Separate chaining and Open addressing with
this input.
