GICSA

DOC NO: 4026

Question Bank

Program (UG/PG): UG

Name of Department: M.Sc. / B.Sc. / BCA

Academic Year: 2024-2025

Semester: III

Subject Code: 20200301

Subject Name: Data Structures

Name of the Institute: Gandhinagar Institute of

Computer Science and Applications.

M.Sc. / B.Sc. (IT / CS / DS) / B.C.A 20190103 DS

 GICSA

Theory Assignment #1

1. Define Data structure.

2. Show classification of Data Structure.
3. Write characteristics of array.
4. Explain and show memory map of 1D array.
5. Define array. Write characteristics of array.
6. Draw memory map for single dimension array and derive formula to find out
size of array and location of any element into that array.
7. Draw memory map for row major and column major (two dimension) array
and derive formula to find out size of array and location of any element into
that array.
8. Write algorithm for following operations on single dimension array.
9. Insert, delete, update, search, traversal, reverse, count
10. Write algorithm to find out second minimum and second maximum in a
single dimensional array of integer.
11. Derive formulas for A[LB:UB] array to find out address of a[i,j], where Ao
is base address and S is element size.
12. Derive formulas for A[RL:RU][CL:CU] row major array to find out address
of a[i,j], where Ao is base address and S is element size.
13. Write applications of array.
14. Derive formulas for A[0:9] array to find out address of a[5], where Base
address of array is 102 and Size of element is 4 Byte.
15. Derive formulas for A[0:9, 0:3] array to find out address of a[5,2], where
Base address of array is 208 and Size of element is 2 Byte.

Practical Assignment #1

1. Write menu driven program for various array operations.

2. Write a menu driven program to accept N values from user, search given
value from it and display it.
3. Write a menu driven program to perform binary search using iterative
method.
4. Write a menu driven program to perform binary search using recursive
method.
5. Write a program to implement selection sort.

B.Sc. / B.C.A / M.Sc. 10190103, WF

 GICSA

6. Write a program to implement bubble sort.

7. Write a program to implement merge sort.
8. Write a program to implement quick sort.
9. Write a program to implement insertion sort.

Theory Assignment #2

1. Define Stack structure.

2. Define Queue structure.
3. Write characteristics of Stack structure.
4. Explain overflow and underflow situation in stack.
5. Write characteristics of Queue structure.
6. Explain overflow and underflow situation in queue.
7. Write characteristics of Circular queue.
8. Explain drawbacks of queue. Write advantages of queue.
9. Explain overflow and underflow situation in circular queue.
10. Write algorithm for insert and delete operation in circular queue.

Practical Assignment #2

1. Write menu driven program for various stack operations using array for
following operations. (i) Push (ii) Pop (iii) Display (iv) Peep (v) Change.
2. Write a menu driven program to accept Integer value from user, convert
it into binary number value using Stack and display it.
3. Write menu driven program for various queue operations using array for
following operations (i) Insert (ii) Delete (iii) Display (iv) Count.
4. Write menu driven program for various operations on circular queue for
following operations (i) Insert (ii) Delete (iii) Display.

Theory Assignment # 3

1. Differentiate array and Link list.

2. Define link list and write all characteristics of it.
3. Write advantages of link list compare to the array.
4. List different types of link list and draw node structure for each.
5. Write algorithms for following operations in Single link list.

B.Sc. / B.C.A / M.Sc. 10190103, WF

 GICSA

Insert front, insert last, delete, count, display

6. Write algorithms for following operations in Double link list.
Insert front, insert last, delete, count, display
7. Write algorithms for following operations in Circular link list.
Insert front, insert last, delete, count, display
8. Write algorithms to find maximum value in Single link list.
9. Define link list. What are the advantages and limitations of link list?
10. Explain insert_front and delete_front operation for single link list.
11. What is double link list? What is an advantage of it over single link list?
Explain insert_front and delete_last operations on double lisk list.
12. Define circular link list. What is advantages of it over single link list?
Explain insert operations on circular link list.
13. Differentiate Single Link List and Double Link list.
14. Differentiate Single Link List and Circular Link list.
15. List area of application for stack, queue and link list in real life.

Practical Assignment # 3

1. Write ‘C’ program for following operations in Single link list.

Insert front, insert last, delete, count, display
2. Write ‘C’ program for following operations in Double link list.
Insert front, insert last, delete, count, display
3. Write ‘C’ program for following operations in Circular link list.
Insert front, insert last, delete, count, display
4. Write ‘C’ program to check palindrome using stack made with Single Link
List.
5. Write ‘C’ program to find binary number of given number using stack.

Theory Assignment # 4

1. What is binary search tree?

2. Demonstrate creation of binary search tree using following values.
45, 33, 21, 76, 25, 14, 15, 50, 77, 99, 5
3. Construct binary search tree with following values and traverse it with
inorder method.
55, 30, 20, 77, 69, 70, 80, 99, 19, 12, 33

B.Sc. / B.C.A / M.Sc. 10190103, WF

 GICSA

4. Demonstrate various traversals on that tree.

5. Write algorithm to traverse BST in in-order, preorder and post-order.
6. Write algorithm to find min and max value from this tree.
7. What is difference between tree and graph?
8. Define acyclic graph.
9. What are advantages of graph over tree? List area of application for tree
and graph in real life.
10. Explain use of adjacency matrix for graph with suitable example.
11. Write program to implement Breath First Search on graph.
12. Write program to implement Depth First Search on graph.
13. Prepare Adjacency matrix for following graph.
14. Show tracing of DFS algorithm for following graph.
15. Show tracing of BFS algorithm for following graph.

Practical Assignment # 4

1. Write program to implement binary search tree. And to perform various

traversal on tree.
2. Write a menu driven program to implement binary search tree. Write
separate functions for following operations. Use array to built tree.

Built tree
Insert node at proper position
Search node by value and display value of parents’ node and its left / right
position in that sub tree.
Delete node from tree
Traverse tree in preorder.
Traverse tree in inorder.
Traverse tree in postorder.
3. Write program to implement Breath First Search on graph.
4. Write program to implement Depth First Search on graph.

B.Sc. / B.C.A / M.Sc. 10190103, WF