QUESTION BANK
BSc. II YEAR
DATA STRUCTURES
Short Answers Type Questions
1. Explain recursion. Write a recursive algorithm to calculate factorial of a
number.
2. What is data structure? Explain various types of data structure.
3. Give the applications of stack.
4. Write an algorithm to convert Infix expression into postfix expression.
5. Describe abstract data type with example.
6. Write the applications of queue data structure.
7. Explain stack as static data structure.
8. What is link list. Explain its type with suitable diagram.
9. Write the applications of linked list.
[Link] the applications of binary tree.
[Link] algorithm to sort a list using bubble sort.
[Link] between stack and queue data structures.
[Link] is graph. Explain the types of graph with example.
14. Write algorithm for insertion sort. Explain with the help of example.
[Link] we need data structure?
[Link] between linear and non-linear data structures.
[Link] the features of abstract data type (ADT).
[Link] are the disadvantages of linked list?
[Link] the advantages of linked list?
[Link] are the advantages linked list over array?
[Link] short notes on threaded binary tree.
[Link] is an algorithm? Discuss the different steps in the development of an
algorithm?
[Link] between primitive and non-primitive data structures.
[Link] between iteration and recursion.
[Link] the use of stack in implementing recursive procedures?
[Link] the following infix expression into postfix form (A+B)*(C+D)*E^F
[Link] the prefix and postfix form for: A+B*(C-D)/(E-F)
[Link] an algorithm for in-order traversal of a binary tree.
[Link] the method of representing graphs by using matrices?
1
[Link] the use of graph in data structures?
Long Answers Type Questions
1. What do you mean by Array? Describe the storage structure of array. Also
explain various types of array in detail.
2. What is stack? Why it is known as LIFO? Write algorithm of PUSH and
POP operation on stack.
3. What is queue? Why it is known as FIFO? Write an algorithm to insert and
delete an element from a simple queue.
4. Explain circular queue? Write an algorithm to insert and delete an element
from a circular queue.
5. Explain how to represent singly linked list with help of diagram and
example.
6. What is minimum spanning tree. Write algorithm to find the minimum
spanning tree.
7. Write and explain algorithm to insert element at the beginning of circular
linked list.
8. Explain algorithm to delete element from circular linked list.
9. Write and explain algorithm to insert element at the beginning of singly
linked list.
[Link] algorithm to delete element from singly linked list.
[Link] and explain algorithm to insert element at the beginning of doubly
linked list.
[Link] algorithm to delete element from doubly linked list.
[Link] is tree traversal. Explain the in-order, preorder and post-order
traversal.
[Link] between depth first search and breadth first search.
[Link] how infix expressions are converted to polish notation. Illustrate
your answer with suitable example?
[Link] the implementation of circular queue using array. How an “empty
queue” is distinguished from a “full queue”? Write necessary functions to
perform all valid operations on circular queue.
[Link] down the steps to invert a singly-linked list to circular linked list?
[Link] quick sort algorithm with the help of an example.
[Link] heap sort. Construct heap sort for the initial key set 42, 23, 74,11,
65,58,94,36,99,87.
[Link] the advantages and disadvantages of linked list over array?
2
[Link] an algorithm for binary search and discuss its speed compared with
linear search.
[Link] the improvement in performance of binary trees brought by using
threads.
[Link] the difference between a general tree and a binary tree. What is a
complete binary tree? Give an algorithm for deleting a value X from a
given binary tree.
[Link] an algorithm for the depth first search of a graph? State its
advantages and disadvantages?
[Link] the Prim's algorithm to find minimal spanning tree for a graph.
[Link] the Kruskal’s algorithm to find minimal spanning tree for a graph.
References
1. Das, Vinu V. Principles of data structures using C and C++. New Age
International, 2006.
2. Software Engineering: A Practitioner's Approach, Author: Roger S. Pressman
3. Data Structures Through C (A practical Approach), Author: G.S. Baluja
4. An Integrated Approach to Software Engineering Author: Pankaj Jalote
5. Data Structures using C++ Author: D.S. MalikSecond Edition
6. Principles of Data Structures using C and C++ Author: Vinu V Das New Age
International Publishers
7. A Practical Introduction to Data Structures and Algorithm Analysis Author:
Clifford A. Snaffer Third Edition (Java)
8. Data Structures and Algorithms Made Easy Narasimha Karumanchi
