LOADING

Questions

NONLINEAR DATA STRUCTURE

Q-1(b)

Define data structure. Briefly explain linear and non linear data structures with their applications.

(7)
(Winter - Dec -
2015)
Q-3(b)

Convert A+(B*C-(D/E^F)*G) infix expression into postfix format showing stack status after every step in tabular form.

(7)
(Winter - Dec -
2015)
Q-4(a)

Create a Binary Search Tree for the following data and do in-order,Preorder and Post-order traversal of the tree.

40, 60, 15, 4, 30, 70, 65, 10, 95, 25, 34

(7)
(Winter - Dec -
2015)

With figure, explain the following terms: (1) Depth of a tree (2) Sibling nodes (3)Strictly binary tree (4) Ancestor nodes (5) Graph (6) Minimum spanning tree (7)Degree of a vertex.

(Winter - Dec -
2015)

Define the following terms.1) Graph 2)Tree3)Multi graph4) Weighted graph5)Elementary path6)Complete Binary tree7)Descendent node

(Winter - Dec -
2015)
ORQ-4(a)

What is Binary Search Tree? Write recursive algorithm/program to implement

in-order traversal of the Binary Search Tree.

(7)
(Winter - Dec -
2015)
Q-4(b)

Define the following with example :

Strictly binary tree

Complete binary tree

(7)
(Winter - Dec -
2015)

Generate a binary search tree for following numbers and perform in-order andpost-order traversals: 50, 40, 80, 20, 0, 30, 10, 90, 60, 70

(Winter - Dec -
2015)

List out different traversal way of tree and demonstrate any two with example.

(Winter - Dec -
2015)

Define Directed graph, spanning tree and minimum spanning tree.

 

 

Find minimum spanning tree for the graph shown in Figure 1.

(Winter - Dec -
2015)
ORQ-4(b)

Define height balanced tree. Construct a height balanced binary tree (AVL tree)

for the following data

32,16,44,52,78,40,12,22,02,23.

(7)
(Winter - Dec -
2015)
OR
Q-4(b)

Explain Right-in-threaded, left- in - threaded and full -in-threaded binary trees.

(7)
(Winter - Dec -
2015)

Write Kruskal’s algorithm for minimum spanning tree and explain with an example.

(Winter - Dec -
2015)
Q-5(b)

Show how graph can be represented using example?How path matrix can be found out using adjacency matrix

(7)
(Winter - Dec -
2015)