(Approved by AICTE, Affiliated to Anna University & Accredited by NBA)

DEPARTMENT OF SCIENCE AND HUMANITIES

MODEL EXAMINATION – expected questions
Part A
1. Define data structure and how the data types are classified at the higher level.
2. Define English ruler function.
3. Differentiate between linear and non-linear data structure.
4. List the applications of stack?
5. Justify why binary search cannot be performed using linked list.
6. Which hash function maintains the record in order of hash field values?
7. What is the advantage of using multiway search tree?
8. Give the balance factor of an AVL tree.
9. Define DAG and shortest path of a graph.
10. Define complete graph and finite graph?
11. List the various operations performed on list.
12. State the difference between array and linked list.
13. Give the applications of linked list.
14. What are the advantages and disadvantages of linked list?
15. Define Singly Linked List.
16. Mention the basic principle behind the quick sort.
17. Enlist 4 internal sorting techniques.
18. What do you mean by heap?
19. What are the 2 stages in which heap sort is conducted?
20. Mention the sort which iteratively passes through a list to exchange the first
element with any element less than repeats with a new first element.
21. Draw a minheap for the following numbers: 12, 42, 25, 63, 9. [N/D’11]
22. Define binary tree. Give the binary tree node structure. [N/D’12]
23. How does the AVL tree differ from binary search tree? [N/D’12]
24. How do we calculate the balance factor for each node in an AVL tree?
25. What is an acyclic graph? How it differs from undirected acyclic graph?
26. What is meant by strongly connected and weakly connected in a graph? May’12
27. 14. Name the different ways of representing a graph.
28. Define graph traversals or what are the 2 traversal strategies used in a graph?
29. Name two algorithms two find minimum spanning tree.
30. Differentiate between BFS and DFS.
 Part B
31. Explain in short about python classes and objects.
32. List out all Object-Oriented Programming (OOPs) concept and explain in detail.
33. Explain in detail about the shallow and Deep copy class with suitable example.
34. Explain the asymptotic notations in detail and their types with a suitable
example program.
35. Write a program to perform all the operations in single linked list?
36. What is stack? Explain the various operations to be performed on stack with
suitable example program.
37. Write a program to sort the elements using insertion sort and illustrate the
steps to perform the same with the following array elements. A [20 15 8 2 0 65
50 34].
38. Write a program to perform binary search and explain it with example.
39. Explain about hashing and different hashing techniques in open addressing.
40. Prove or show that the worst-case time of the extraction operation on a heap
implemented as an array is O (log n).
41.Consider the following set of values and use them to build the indicated type
of tree by adding one value at a time in the order listed: V [30 63 2 89 16 24
19 52 27 9 4 45]
(i) binary search tree. (6)
(ii) AVL tree. Give an explanation when there is a change in the root nodes.
42.Elaborate all possible types of the graph traversals that could be made in the
following graph

43.Explain the topological ordering with example in detail?

44. Given the following adjacency matrix, draw the weighted graph.
45. Write short notes on: (Take a graph of your choice)
(a) Biconnectivity
(b) Cut-vertex
(c) Give a linear algorithm to determine whether a graph is biconnected.
46.Find all the articulation points in the graph given below. Show the depth-first
spanning tree and the values of number and low for each vertex.
(a) (b)

47.Explain the tree traversals. Give all the essential aspects.

48. Define Tree. Explain the tree traversals with algorithms and examples.
49. Define AVL trees. Explain its rotation operations with example.
50. Explain the operation and implementation of Insertion sort and shell sort.
51. Write selection sort algorithm and explain. Trace the algorithm for the following
list of numbers. 90,77,60,99,55,88,66.
52. Create extendible hash structure to insert the following key elements: 2, 3, 5, 7,
11, 17, 19, 23, 29, and 31. Show the extendable hash structure for this file, if the hash
function is h(x) = x mod 8 and buckets can hold three records.
53. Write the procedure to convert the infix expression to postfix expression and steps
involved in evaluating the postfix expression. Convert the expression A - (B / C + (D
% E * F) / G) * H to postfix form. Evaluate the given postfix expression 9 3 4 * 8 + 4
/ -.
54. Define priority queue with diagram and give the operations.
55. List the applications of stack and queue
 PART-C
56. Convert the given expression in to postfix expression ABC*/D+E-FQY*+ in to
prefix and then to infix expression and explain the procedure in detail.
Illustrate the steps.
57. Consider the given undirected graph and apply Kruskal’s algorithm to find the
minimum spanning tree. Illustrate the steps. (CO5) (K4)

58. Consider the graph given below.

(i) Write the adjacency matrix of G.
(ii) Write the path matrix of G.
(iii) Is the graph biconnected?
(iv) Is the graph complete?
59. Write procedure to perform topological sort for the graph given below:

60.Distinguish between B Tree and B+ Tree. Create a B tree of order 5 by inserting

the following elements: 3, 14, 7, 1, 8, 5, 11, 17, 13, 6, 23, 12, 20, 26, 4, 16, 18, 24,
25 and 19