Lovely Professional University 2010 B.Tech Computer Science and Engineering Assignment -3 Mathematics - Question Paper

HOMEWORK-3 Lecture no.-21
MTH-252
Discrete mathematics and probability theory

Q.1) Using prims algorithm obtain minimum spanning tree of the weighted graph (with attachment)

Q.2) Again use the Kruskal’s algorithm to obtain the minimum spanning tree of the weighted

graph.(with attachment)

Q.3) obtain the length of shortest path ranging from a and z in the provided weighted graph. Using

Dijkastra’s algorithm (with attachment)


Part-B

Q.1) Use Warshall’s algorithm to obtain matrix Q of shortest paths for the graph (with attachment)

Q.2) If repetitions are not allowed , How many 3-digit numbers can be formed from 6 digits

2,3,5,6,7 and 9?How many of these are less than 400?How many are even?

Q.3) A cricket team wins with probability 0.6, loses with probability 0.3 and draws with

probability 0.1.Tha team plays 3 games.(i) Determine the elements of the event A that team wins

atleast twice and does not lose and obtain P(A).(ii) Determine the elements of event B that team

wins,loses and draws and obtain P(B).

Earning:   Approval pending.