Академический Документы
Профессиональный Документы
Культура Документы
MCA Department
SEMESTER – 2 (GTU)
Subject Name: DATA STRUCTURES Subject Code: 620001
Question Bank
Unit –I (Analysis of Algorithms)
61. What is non linear data structure and how it differs from linear data structure describe with
suitable example?
62. What are Graphs? How they can be represented?
63. Distinguish the following terms
a. Vertex d. Loops
b. Edges e. Isolated Node
c. Arcs
64. What do you mean by simple graph? Explain with suitable example?
65. Write Rules for Multi Graph?
66. Differentiate: Connected Graph & Unconnected Graph
67. Explain the following terms:
a. Weighted Graph c. Paths
b. Null Graph d. Cycle
68. What is path also explain various terms in concern to path?
69. Explain Directed graph? What are Indegree, Outdegree and Degree of node in detail?
70. Write short note: Trees.
71. What are general trees? How binary tree are more applicable then general tree?
72. Explain the following terms in context to Tree.
a. Leaves e. Height
b. Parent f. Width
c. Sibling g. Level
d. Root
73. Write the following detail for below mentioned tree:
a. Leaves Node =
b. Parent Node =
c. Sibling Node for B & E
d. Root =
e. Height =
f. Width =
g. Level =
74. What is Binary Search Tree? How they differ from General Trees and also explain various
traversal techniques of Binary Search Tree?
75. Create a Binary Search tree for the following data and do Inorder, Preorder & Postorder
traversal of the tree. (40, 60, 25, 50, 30, 70, 35, 10, 55, 65, 12).
76. Create a Binary Search Tree from the following data: ABCDEFG and do converse Inorder,
converse preorder and converse Postorder traversal?
77. Describe forms of representation of Binary Search Tree with suitable examples?
78. Write and interactive algorithm/ program to traverse a Binary Search Tree in
a. Inorder b. Preorder c. Postorder
79. Write and Recursive algorithm/ program to traverse a Binary Search Tree in
a. Inorder b. Preorder c. Postorder
80. Write an algorithm/ program to create a Binary Search tree?
Prepared By: Akshay K. Gondalia 3|Pa ge