BCA DA 1321 - Discrete Mathematics
BCA DA 1321 - Discrete Mathematics
Registration number:
This question paper contains FIVE printed pages and THREE parts
PART A
Answer ALL the questions 20 X 1 = 20
i) v=e
ii) v = e+1
iii) v = e-1
19. Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the
number of distinct cycles of length 4 in G is equal to
i) 15
ii) 30
iii) 45
iv) 360
20. Output values of Moore type FSM are determined by its ________
i) Input values
ii) Output values
iii) Clock input
iv) Current state
PART B
PART C
37. Find the shortest paths between K and L in the following graph using Dijkstra's
Algorithm
38. Define the states and draw a state diagram of “A coffee vending machine”.