Professional Documents
Culture Documents
VL2019205000392 Da02 PDF
VL2019205000392 Da02 PDF
VL2019205000392 Da02 PDF
DEPARTMENT OF MATHEMATICS
WINTER SEMESTER – 2019∼2020
MAT1016 – Applied Discrete Mathematical Structures
A2+TA2+TAA2+V3 Slot
DIGITAL ASSIGNMENT – II
Instructions:
(i). Last Date for Submission of Digital Assignment – II (DA–II) : 29th February 2020.
(ii). Mention the Register Number, Name, Slot Details, Course Code and Course Title in the
First Page of the Assignment. Also mention the Register Number and Name in every
T
page of the document.
VI
(iii). Submit the softy copy of answers for all the following questions as a single PDF
–
document into V-Top Login properly on or before the mentioned last date.
S
SA
1. Show that the number of edges in a simple graph with n vertices is at-most
ic
n n(n − 1)
C2 = .
at
2
m
2. Apply the Dijkstra’s algorithm to find the shortest path between the vertices a and z in the
he
following weighted graph and hence compute the total weight of the obtained shortest
at
T
**********
VI
–
S
SA
s–
ic
at
m
he
at
M
Page 2