DR.

BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY,

LONERE
Branch: Computer Engineering and Allied Branches

Semester-III

Sub: Data Structures (BTCOC303)

Question Bank
Unit-1: Introduction

1. What is data? Explain Data types in shorts.

2. What is data structure? Explain ADT.
3. Explain sequential organization.
4. Write a short note on:
5. Explain forms of hashing of data structure.
6. Explain direct address table.
7. Explain hashing techniques.
a. Linear data structure
b. Non-linear data structure
8. Explain Storage representation.
9. What is sparse matrix? Explain the representation of it.
10. Explain transpose of Matrix.
11. What is hash table? Explain in detail.
12.
13. Give the brief explanation about open addressing.
14. What is perfect hashing? Explain in short.
15. What is data structure? Why to study data structure? Enlist the five areas of Computer
Science in which data structure is used.
16. What is garbage collection? Who will run garbage collection program? When it will
be run?
17. Suppose multidimensional arrays A and B are declare using A (0:5, -2:7) and B (0:5, -
1:4). Find the length of each dimension and the number of elements in array A and B.
18. What is primitive data structure? Enlist the differences between primitive and non-
primitive data structures.

Unit-2: Stack and Queues

1. Evaluate postfix expression from given infix expression.

b*c+d/e
2. How to efficiently implement k stack in a single array?
3. Evaluate postfix expression from given infix expression.
A + B * (C + D) / D * E
4. Convert the following infix expression to postfix expression.
A / B ^ C +D * E – A * C
5. Postfix to Infix conversion: abc-+de-fg-h+/*
6. Explain various stack operations with example.
7. Explain concept of stack abstract data types.
8. Differentiate between stack and queue.
9. Explain backtracking algorithm strategy.
10. Write pseudo code for various stack operations.
11. Write necessary ‘C’ functions to implement stack using array.
12. Write ADT for stack.
13. Give an ADT for queue.
14. Explain the concept of priority queue and give the application for the same.
15. Explain array and linked list implementation of queue.

Unit-3: Linked List

1. What is need of linked list? Explain any one application of doubly linked list (DLL)
with suitable example.
2. Write differences between array and linked list.
3. Explain what do you mean circular linked list.
4. What are advantages and disadvantages of linked list?
5. Compare sequential and linked memory organization.
6. Describe singly link list (SLL) operations.
7. Explain doubly linked list in detail.
8. Describe doubly link list (DLL) operations.
9. Elaborate dynamic storage management.
10. What is circular link list? Describe circular link list operations.
11. Explain traversal of linked list.
12. Write note on garbage collection.
13. Differentiate between singly linked list and doubly linked list.
14. Write a C function to insert node in single linked list.
15. Write a C function to delete node in single linked list.
16. Write a C function to insert node in doubly linked list.

Unit-4: Trees and Graphs

1. Explain basic tree concept.

2. What are the properties of binary search tree?
3. Write a short note on binary tree and its representation.
4. Write a short note on binary tree traversal.
5. Explain working of Inorder traversal.
6. Explain working of Preorder traversal.
7. Explain working of Postorder traversal.
8. Write a short note on creation of binary tree from traversal sequence.
9. What is insertion and deletion of nodes in binary tree?
10. Describe binary search tree traversal.
11. What are the operations on binary search tree?
12. Write a short note on threaded binary tree.
13. Explain Heap in binary tree.
14. Describe balanced tree.

Unit-5: Searching and Sorting

1. What is searching? What are the different categories of it?

2. Explain binary search tree in detail.
3. What is skip list? Explain the representation of it in detail.
4. What is insertion sort explain with example?
5. Explain selection sort in detail.
6. What is radix sort? Explain in detail.
7. Apply the selection sort to following list and explain each step.

25 79 41 9 34 60

8. Apply the insertion sort on following list

25 79 41 9 34 60

9. What is file handling? Explain in detail.

10. Explain with program the function of file handling.
11. What is selection sort? Sort the numbers in ascending order and also show the worst-
case time complexity of selection sort is O(n2).
12. Consider the stack size 6 memory cells. Suppose initially stack contains a, b, c, d, e
(top of stack). Then the following operations are executed in order. Show the stack
top and any other situation raised while doing each of operation.
(i) Push (ii) Pop(top)
13. Explain how to implement two stack in one array A[1…..N] in such a way that neither
stack overflow unless the total number of elements in both the stacks together is N.
Note that, Push( ) and Pop( ) operations should be run in O(1) time.
S.No. Array Linked List

An array is a consistent set of A linked list is an ordered set

1. fixed number of data items. of a variable number of data
items.

They are stored in contiguous They are not stored in

2. memory locations. contiguous memory
locations.

In the case of arrays, the memory In the liked lists, memory

3. allocation is done at compile allocation is done at run time.
time.

Arrays are fixed in size. Linked lists are dynamic in

4.
size.

Arrays require less memory Linked lists require more

5. space as compared to linked memory space.
lists.

In the case of arrays, the In the linked lists, the

6. insertion and deletion operations insertion and deletion
require more time to execute. operations take less time.

In arrays, accessing the elements In linked lists, the whole

7. is easier. linked list is to be traversed
to access the elements.