Data Structure  (2130702)

BE | Semester 3  Unit : Nonlinear Data Structure

Q3 (c) Summer-2019   Explain the working of the Prim’s algorithm with suitable example.

 Unit : Nonlinear Data Structure

Q3 (b) Summer-2019   List out graph traversal techniques & explain any one using suitable example.

 Unit : Nonlinear Data Structure

Q3 (c) Summer-2019   Apply Djkstra’s algorithm on following graph with Node A as the starting node.

 Unit : Nonlinear Data Structure

Q4 (b) Summer-2019   Given Inorder and Preorder traversal, find Postorder traversal.
Inorder: Y B K C F A G X E D H Z
Preorder: G B Y A C K F X D E Z H

 Unit : Nonlinear Data Structure

Q4 (b) Summer-2019   Draw a Binary expression tree for the following and perform preorder traversal:

 Unit : Nonlinear Data Structure

Q4 (c) Summer-2019   Explain insert and delete operations in AVL trees with suitable examples.

 Unit : Nonlinear Data Structure

Q5 (a) Summer-2019   Define: i) Cyclic Graph ii) Siblings iii) Strictly Binary Tree

 Unit : Nonlinear Data Structure

Q5 (b) Summer-2019   Explain Threaded binary trees with suitable examples.

 Unit : Nonlinear Data Structure

Q5 (c) Summer-2019   Discuss different representations of a graph.

 Unit : Nonlinear Data Structure