Q 1) Number of binary strings of length 5 that contain no two or more consecutive zeros, is:
a) 12 b) 15
c) 6 d) 13
Q 2) If G is a forest with n vertices and k connected components, then how many edges does G have?
a) n/k b) n-k
c)n-K+1 d) n-K-1
a) 12 b) 15
c) 6 d) 13
Q 2) If G is a forest with n vertices and k connected components, then how many edges does G have?
a) n/k b) n-k
c)n-K+1 d) n-K-1
Please provide full paper in pdf htet computer science 23 December 2017 wala
ReplyDeleteSee on another tab it is already available
ReplyDelete