Scribd
Upload
53 views2 pages

DS Question Bank 2

Uploaded by

Krishna Lokesh Naidu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
53 views2 pages

DS Question Bank 2

Uploaded by

Krishna Lokesh Naidu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Question Bank– 2

Subject: Data Structures & Applications – BCS304 S emester/Section: III, A&B

MODULE -3

1. What is circular doubly linked list ? Write a C function to perform the following operations
on circular doubly linked list:
i. Insert a node at the beginning
ii. Delete a node from the list
2. Explain the concept of Sparse matrix using Linked List. Represent the following sparse
matrix in the linked list format.

3. Explain additional list operations with a suitable code snippet.

4. List out the difference between Single Linked List and Double Linked List. Write the
functions to perform following operations on double linked list :
i. Insert a node at rear end of the list
ii. Delete a note at rear end of the list

5. Develop a function to delete a node whose information field is specified in singly linked
list.

6. Define a tree. With suitable example explain i) Binary tree ii) Complete binary tree iii)
Level of a node iv) Skewed binary tree v) Degree of the tree

7. Explain and write a C function to traverse the a tree using


i) Pre – Order Traversal
ii) Post – Order Traversal
iii) Inorder Traversal

8. List and explain representation of a Binary Tree.

9. Draw a Binary tree for the following expression : ((6 + ( 3 – 2 ) * 5 ) ^ 2 + 3. Traverse


the above generated tree using Pre – Order and Post – Order and also write their respective
functions.
10. Construct a binary tree from the Post-order and In-order sequence given below

a) In-order: G D H B A E I C F
Post-order: G H D B I E F C A

b) Inorder : E A C K F H D B G
Preorder : F A E K C D H G B

11. For the given data, draw a binary search tree.


100, 85, 45, 55, 110, 20, 70, 65

12. Explain threaded binary tree using a suitable example and write a code snippet to
demonstrate inserting a Node into a threaded binary trees.

13. What is the advantage of threaded binary trees over binary trees? Explain the construction
of threaded binary tree for 10, 20, 30, 40 and 50.

MODULE – 4

1. Explain Binary Search Trees. Construct a binary search tree (BST) for the following
elements: 100, 85, 45, 55, 120, 20, 70, 90, 115, 65, 130, 145. Traverse using in-order, pre-
order, and post-order traversal techniques. Write recursive C functions for the same.

2. Explain Forest. Transform the given forest into a Binary tree and traverse using inorder,
preorder and postorder traversal.

3. Define selection tree. Construct min winner tree for the runs of a game given below. Each
run consists of values of players. Find the first 5 winners.

4. Define the Disjoint set. Consider the tree created by the weighted union function on the
sequence of unions: union(0,1), union(2,3), union(4,5), union(6,7), union(0,2), union(4,6),
and union(0,4). Process the simple find and collapsing find on eight finds and compare
which find is efficient.

You might also like