Academic Task Number: III Course code: MTH-401

Date of allotment: 21/10/2022 Course title: Discrete Mathematics

Date of submission: 01/11/2022 Maximum Marks: 30
Academic Task Type: Continuous Assessment Test (Subjective)

Question Question Statement Course Bloom’s Marks

Number Outcome level per
Question

Q1 Find the adjacency matrix and the incidence of the CO4 L3:
graph given in Q2 (ignore the weights). Apply 10

10
Using Dijkstra’s Algorithm, find the shortest path
Q2 tree of the graph given in the figure.

CO4 L3:
Apply

Write down the chromatic number of the 10

graphs K9, Cn≥3, Wn≥4 and the one given below.
Q3

CO4 L3:
Apply

 Academic Task Number: III Course code: MTH-401

Date of allotment: 21/10/2022 Course title: Discrete Mathematics
Date of submission: 01/11/2022 Maximum Marks: 30
Academic Task Type: Continuous Assessment Test (Subjective)

Question Question Statement Course Bloom’s Marks

Number Outcome level per
Question

Q1 Find the adjacency matrix and the incidence of the CO4 L3:
graph given in Q2 (ignore the weights). Apply 10

10
Using Dijkstra’s Algorithm, find the shortest path
Q2 tree of the graph given in the figure.

CO4 L3:
Apply

State Brook’s theorem. Also, write down the 10

chromatic number of the graphs K9,9 and the one
Q3 given below.

CO4 L3:
Apply

 Academic Task Number: III Course code: MTH-401

Date of allotment: 21/10/2022 Course title: Discrete Mathematics
Date of submission: 01/11/2022 Maximum Marks: 30
Academic Task Type: Continuous Assessment Test (Subjective)

Question Question Statement Course Bloom’s Marks

Number Outcome level per
Question

Q1 Find the adjacency matrix and the incidence of the CO4 L3:
graph given in Q2 (ignore the weights). Apply 10

10
Using Dijkstra’s Algorithm, find the shortest path
Q2 tree of the graph given in the figure.

CO4 L3:
Apply

State Brook’s theorem. Also, write down the 10

chromatic number of the graphs K9,9 and the one
Q3 given below.

CO4 L3:
Apply