Department of Computer Science and Engineering
INTERNAL TEST - II
Semester: III Session: July – Dec 2021
Course Name: Data Structure using C Course Code: 18CSI301
Date: 16-11-2021 Max Marks: 100
Time: 9:30 AM – 1:00 PM Duration: 3 Hours
Note:
i. All questions are compulsory.
ii. All questions carry 10 marks.
iii. Missing data can be assumed suitably.
Bloo
Q Mar CO’
Questions m’s
# ks s
Level
1. i Find the Pre-order traversal for the below given Binary tree? 1 CO4 L3
a. ABCDEFGHIJK.
b. HIDEBFJKGCA.
c. HDIBEAFCJGK.
d. ABDHIECFGJK.
ii In a Binary Tree, certain null entries are replaced by special pointers 1 CO4 L2
which point to nodes higher in the tree for efficiency. These special
pointers are called
a. Leaf
b. Branch
Page 1 of 6
, Department of Computer Science and Engineering
c. Path
d. Thread
iii Find the in degree and out degree of node D in the given figure? 1 CO4 L3
a. Indegree:1, Outdegree: 1
b. Indegree:1, Outdegree:0
c. Indegree:0, Outdegree:1
d. Indegree:2, Outdegree:1
iv If every node u in G is adjacent to every other node v in G, a graph is 1 CO5 L2
called ?
a) Isolated
b) Complete
c) Finite
d) Strongly connected
v What is the weight of Minimum Spanning Tree for the given figure? 1 CO5 L3
a) 23
b) 28
c) 27
d) 30
Page 2 of 6
INTERNAL TEST - II
Semester: III Session: July – Dec 2021
Course Name: Data Structure using C Course Code: 18CSI301
Date: 16-11-2021 Max Marks: 100
Time: 9:30 AM – 1:00 PM Duration: 3 Hours
Note:
i. All questions are compulsory.
ii. All questions carry 10 marks.
iii. Missing data can be assumed suitably.
Bloo
Q Mar CO’
Questions m’s
# ks s
Level
1. i Find the Pre-order traversal for the below given Binary tree? 1 CO4 L3
a. ABCDEFGHIJK.
b. HIDEBFJKGCA.
c. HDIBEAFCJGK.
d. ABDHIECFGJK.
ii In a Binary Tree, certain null entries are replaced by special pointers 1 CO4 L2
which point to nodes higher in the tree for efficiency. These special
pointers are called
a. Leaf
b. Branch
Page 1 of 6
, Department of Computer Science and Engineering
c. Path
d. Thread
iii Find the in degree and out degree of node D in the given figure? 1 CO4 L3
a. Indegree:1, Outdegree: 1
b. Indegree:1, Outdegree:0
c. Indegree:0, Outdegree:1
d. Indegree:2, Outdegree:1
iv If every node u in G is adjacent to every other node v in G, a graph is 1 CO5 L2
called ?
a) Isolated
b) Complete
c) Finite
d) Strongly connected
v What is the weight of Minimum Spanning Tree for the given figure? 1 CO5 L3
a) 23
b) 28
c) 27
d) 30
Page 2 of 6
