Scribd
Upload
39 views2 pages

FDS MID-2 Assignment Questions

Uploaded by

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

FDS MID-2 Assignment Questions

Uploaded by

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

Unit – 3-2

1. Describe types of trees and its applications.


2. Define Binary Tree? Give the properties of a Binary Tree.
3. Describe representation of Binary Tree using Arrays and Linked Lists.
4. List various operations on Binary Trees and explain.
5. Discuss in detail about recursive tree traversals on a binary tree.
6. List out various tree traversals (using recursive) on Binary tree and explain
7. Construct an expression tree for the postfix expression: a b + c d e + * *
8. Build the Binary tree from the given traversal techniques
In-order: G D H B E I A F J C
Level order: A B C D E F G H I J
9. Construct a Binary tree from a given postorder and inorder sequence:
Inorder: D G B A H E I C F
Postorder: G D B H I E F C A

10. Construct a Binary tree from a given preorder and inorder sequence:
Preorder: A B D G C E H I F
Inorder: D G B A H E I C F
11. Construct an expression tree for the Arithmetic expression:
(A + B * C) - ((D * E + F) / G)
12. Explain why threaded binary trees are called efficient binary trees? Give the merits of using a threaded
binary tree

Unit – 4
1. (a) Describe about Binary Search Trees. List out Applications of BST.
(b) Explain Binary Search Tree with the help of suitable example.
2. List out various Binary Search Tree operations. Write the steps for to creation and insertion operation of
BST.
3. List out different ways deletion operation on BST. Write the steps each case with example.
4. Describe how to perform search/ Traversal operations on BST. Explain each with example.
5. Construct Binary tree and Binary Search Tree from the given data
if, else, printf, scanf, for, while, goto, continue, static, auto, extern, typedef
6. List out different Balanced Trees. Explain any one of them with example.
7. Define AVL Tree? Explain each rotation with an example.
8. List out different rotations in AVL Tree and explain each with suitable example.
9. Explain an algorithm for inserting an element into the AVL Tree with suitable example.
10. Describe how to perform delete operation on AVL Tree

Unit- 5
1. Describe a graph and its types.
2. List graph properties and explain transposition of a graph.
3. State the different ways of representing graphs in memory and explain.
4. List the operations on graphs and explain.
5. Describe Depth first traversal algorithm.
6. Describe minimum spanning tree and explain prim’s algorithm with example.
7. List the steps of kruskal’s algorithm by describing the minimum spanning tree.
8. List the steps of single source Dijkstra’s shortest path algorithm.

You might also like