APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY Previous Years Question Paper & Answer
University : APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
Course : B.Tech
Semester : SEMESTER 5
Subject : Graph Theory and Combinatorics
Year : 2019
Term : DECEMBER
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : CS 309
Page:4
PDF Text (Beta):
forest. Apply it to find the spanning tree /spanning forest for any graph of your choice.
19 a) Write Dijkstra’s Shortest path algorithm and apply this algorithm to find the shortest
path
20 a) Write Kruskal’s algorithm to find the minimum spanning tree of a graph G .Apply it
E192047
to find the MST for the graph given below
©
6
Pages:4
(10)
(10)
Similar Question Papers
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY =>
B.Tech =>
SEMESTER 3 =>
Circuits and, Networks =>
2017 => JANUARY =>
Download
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY =>
M.Tech =>
SEMESTER 2 =>
Antenna Theory and Design =>
2016 => MAY =>
Download
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY =>
B.Tech =>
SEMESTER 7 =>
Meat and Poultry Processing =>
2020 => DECEMBER =>
Download
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY =>
B.Tech =>
SEMESTER 7 =>
Information Theory & Coding =>
2021 => DECEMBER =>
Download
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY =>
B.Tech =>
SEMESTER 4 =>
Measurements and Instrumentation =>
2019 => MAY =>
Download