8CSGC6601: Advanced Data Structures using C and Lab

Question Bank
Module I
1. Define Data Structure. Explain the classification of data structure
2. What are the operations that can be performed on data structure? Explain.
3. What is searching? What are the different searching techniques?
4. Write the algorithm for Linear Search
5. Write the algorithm for Binary Search. Trace the algorithm and search for key element 20
from the following set of numbers 14,20,45,56,69,77,90
6. Write a C program to search for a key element using Linear search
7. Write a C program to search for a key element using Binary Search
8. Differentiate Linear search and Binary search
9. Define Sorting. List the different sorting techniques
10. Sort the following array of numbers 10,56,33,78,21,45,15,100 using Bubble sort technique
11. Write the algorithm for Bubble Sort
12. Write a C program to implement Bubble sort
13. What is Abstract Data Type ?
14. Write an algorithm to traverse an array of N elements.
15. Write an algorithm to insert an element at a specific position in an array.
16. Write an algorithm to delete an element from a given position in an array.
17. What is algorithm analysis? Explain steps involved in Algorithm analysis.
18. Explain the two major measures of efficiency of algorithms.
19. What is the time space tradeoff? Give any two examples.
20. How is a multi dimensional array declared and initialized? Give examples.
21. Write a C program to read and print elements in a 3 dimensional array.
22. Define Sparse matrix. What are its advantages?
23. How is a sparse matrix represented in memory? Give one example.
24. Write a C program to represent a 2d sparse matrix of size m x n to array representation with
row,column and value.

Module II
25. Compare Array and Linked list
26. Write a short note on memory management functions in C with an example for
each.
27. Define Linked list. What are the types
28. Write down the advantage of Circular Linked list
29. Write down the disadvantage of Circular Linked list
30. Compare Single and Double linked list
31. Compare Linear(single) and circular linked list
32. List out the Advantages of Linked list
33. List out the disadvantages of Linked list
34. Write an Algorithm to count the number of nodes in a singly linked list
35. Write an Algorithm to traverse a singly linked list
36. Write an Algorithm to insert a node a) in the beginning b) in the end of a singly
linked list c) after a specific node
37. Write an algorithm to delete a node from a) beginning b) end c) specific key
element of a singly linked list
38. Write an algorithm to search for a specific key element in a singly linked list

Module III
39. Define stack. How is it represented in memory? List the operations on stack.
40. Write the algorithm for the following operations on stack. A) push an element b)
pop an element c) display the contents of stack
41. Write a C program to implement all stack operations – PUSH,POP AND
DISPLAY
42. List the applications of stack.
43. Convert the following infix expressions to prefix and postfix expression a)
A^B+C*D-(E/F) b) A/B*C-D+E
44. Convert the infix expression A*(B+C)-D/(E+F) to postfix expression using stack.
Evaluate that postfix expression using stack with A=5, B=3, C=4, D=2, E=3, F=2
45. Write an algorithm to convert the infix expression to postfix expression using stack
46. Write a C program to convert infix expression to postfix expression using stack
47. Write an algorithm to evaluate postfix expression using stack
48. Write a C program to evaluate postfix expression using stack
49. Define Queue. How is it represented in memory?
50. Explain the types of queue in detail.
51. Write a C Program to implement Linear queue operations
52. Write an algorithm to a) add elements b) remove elements c) display elements in to
the circular queue

Module IV
53. Define the following terminologies related to trees - Root, Parent, Child, Siblings,
Degree, Internal node, Leaf/terminal node, Level, Height, Depth, Subtree, Forest,
Binary Tree, Binary Search Tree, Complete Binary tree, Rooted Binary tree,
Strictly binary tree, Almost complete Binary tree, Skewed binary tree
54. How Binary Tree can be represented in memory
55. Draw a complete binary tree with 3 levels (with root node at level 0). How many nodes are
present in this tree?
56. Explain the different traversal techniques in a binary tree
57. Write the inorder, preorder and postorder traversals of the following tree.

58. Write the recursive algorithm for inorder, preorder and postorder traversals.
59. What is min heap and max heap
60. Explain heapsort.
61. Write a C program to sort a set of numbers using Heapsort.
62. Define Binary Search Tree? Construct a binary search tree 14,15,4,97,18,3,5,16,4,20,17,9,14,5
63. Construct a Binary tree from the given preorder and inorder traversal .
preorder sequence A B C D E F G H I
Inorder sequence B C A E D G H F I
64. Explain threaded binary tree? What are the types and show the diagrammatic
representation.

Module V
65. Define a Graph
66. Define the following terminologies related to Graphs - Edge, vertex, directed edge,
undirected edge, directed or digraph, complete graph, strongly connected graph,
weighted graph, degree/indegree/outdegree of a vertex, Loop, Path, Cyclic graph,
acyclic graph
67. Explain in detail how can graphs be represented in memory (or) Explain adjacency
matrix and adjacency list representation of graph with an example
68. Define Path Matrx? Where does the path matrix is used?
69. Explain Floyd Warshal Algorithm to fins the path matrix.
70.