MCS-021

Data And File Structures

(Suggestions)
Analysis of algorithm(Block-1, Unit-1)
1. Describe the asymptotic notations in detail.
2. Define "Time Complexity" and "Space Complexity". What are
the differences between them?

Arrays(Block-1, Unit-2)
1. What is a Sparse Matrix? What are the advantages and
disadvantages of Sparse Matrix representation?
2. Define sparse matrix. Write an algorithm that accepts a 6 x 5
sparse matrix and outputs in 3-tuple representation.
3. Write an algorithm for the addition of two Sparse Matrices.
4. Write an algorithm for multiplication of two sparse matrices.

5. Write an algorithm that accepts two polynomials as input and

prints the resultant polynomial due to the addition of input
polynomials. (Block-1,page-28)

Linked list (Block-1, Unit-3)

1. Write algorithm to insert, delete and display elements in a
singly linked list.(Block-1,page-38)

2. Write an algorithm to create, insert, delete and display the

content of a doubly linked list.(Block-1,page-44)

3. Design algorithms for various operations performed on

circularly linked list. (Block-1,page-46)
Stack (Block-2, Unit-4)
1. Write the functions/algorithm to perform Push and Pop
operations of stack.
(Or, Write an algorithm to implement a stack, using arrays.)
(Block-2, page-7)

2. Explain in detail the algorithmic implementation of multiple

stacks. (Block-2,page-13)

Queue (Block-2, Unit-5)

1. Write a procedure/algorithm to create, insert and delete an
element in queue.(Block-2,page-17)

2. What is a circular queue? Write an algorithm for insertion and

deletion in a circular queue using array. (Block-2,page-22)

3. What is a Dequeue? Write an algorithm to insert and delete the

node in a Dequeue using array.(Block-2,page-25)
Binary Tree (Block-2, Unit-6)
1. Define binary tree. (Block-2, page-37) what are the traversals in
binary tree? Explain each traversal with an example.
(Block-2, page-40, section-6.7.1)

2. Write the recursive algorithm for various tree traversals.(block-

2,page-40,section-6.7.1)

3. Write the non-recursive algorithm for various tree

traversals.(block-2,page-42,section-6.7.2)

4. Construct a binary tree using the following pre - order and in -

order traversals :
Pre-order: ABGHMCDEF
In-order: BHMGADFEC

[Construct a binary tree using the following

Pre-order and in-order sequences:
Pre-order: 35, 31, 15, 7, 33, 32, 43, 38, 40, 49
In-order: 7, 15, 31, 32, 33, 35, 38, 40, 43, 49]

5. Explain the process of converting any Tree into a Binary Tree.

BST (Block-3, Unit-7)
1. What is a BST? Explain with an example. What are its
limitations?

2. create a binary search tree for following numbers start from

empty BST
45, 26, 10, 60, 70, 30, 40.
Trace the algorithm to insert the node 20 into the BST.
3. Create a Binary Search Tree for the following alphabets. Start
from an empty BST.
U, B, D, K, V, A, L

AVL tree (Block-3, Unit-7)

1. Define "AVL Tree". Write any two applications of AVL Trees.
(Block-3,page-9,page-13)
2. draw AVL tree by inserting the following
Elements one by one:
7, 13, 27, 9, 11, 14, 8, 37, 24
3. Explain the types of rotations performed on AVL trees with an
example of each. (Block-3,page-10)

B-Tree (Block-3, Unit-7)

1. Explain various operations performed in a B-tree. (Block-
3,page-14)
Splay Tree (Block-4, Unit-11)
1. What is a Splay Tree? How does it differ from a Tree?
2. Explain the process of creating a Splay Tree using an example.

Red-Black Tree (Block-4, Unit-11)

1. What are red-black trees? Explain the properties of a red-black
tree.
2. Write an algorithm for inserting a node in a Red-Black tree.
Write step by step working of algorithm using an example.
3. Discuss any two applications of red-black trees in detail.

AA- tree (Block-4, Unit-11)

1. Compare and contrast the Splay trees with AA trees.
2. Construct an AA - Tree using the following nodes. Show all
intermediate steps and balancing of tree.
17, 4, 25, 98, 28, 33, 42, 11, 6, 73
Graphs (Block-3, Unit-8)

1. Dijkstra’s algorithm
2. Krushkal’s algorithm
3. Prims’s algorithm
4. BFS
5. DFS

1. Explain Dijkstra's algorithm with an example.

2. Explain prim's algorithm with an example.

3. Explain Kruskal's algorithm with an example.

4. What is DFS? What is BFS? Explain the differences between

them.
5. Write the algorithm for each of the following:
(i) Depth First Search
(ii) Breadth First Search
Searching (Block-3, Unit-9)
1. What are the pre conditions for applying binary search on any
list containing Integer values? Write the algorithm and
manually run it on the following list of number :
10 27 23 56 38 66 45
What is worst case complexity of the above algorithm?

Sorting(Block-4, Unit-10)
1. Explain Quick Sort algorithm. Trace the algorithm for the
following set of data :
25, 0, 8, 78, 6, 34, 56, 90, 100

2. Write an algorithm for Heap Sort. Write a procedure to sort the

following sequence :
25 57 48 37 12 92 86 33. Use Heap Sort
3. illustrate inserting an element into a heap with the following
numbers :
2, 3, 81, 64, 4, 25, 36, 16, 9, 49

4. Compare Heap sort and Quick sort with each other.

File Structures(Block-3, Unit-12)

1. Discuss the various file organisation methods. Also, list the

advantages and disadvantages of each.
(Sequential file organisation, Direct File organisation and Indexed
sequential file organisation)

2. Compare any two file organisations.

 Thank you so much for watching!
Please Subscribe.
Email: [email protected]