United International University (UIU)

Dept. of Computer Science & Engineering (CSE)

Mid Exam Year: 2012 Trimester: Summer Program: MSCSE, Set-I
Course: CSE 6043 Graph Theory, Marks: 30, Time: 2 hours

There are EIGHT questions. Answer any FOUR. Figures in the right-hand
margin indicate full marks.
1. a) Define Graph Theory (MT).

[7.5]

2. Which search is better for finding the Airport by a minimum time to start at Farmgate? Justify your

[7.5]

3. Find the shortest path from UIU to NEW-MARKET (NM) using the Bellman-Ford algorithm where the

[7.5]

b) What are the applications of Graph Theory?

c) Write down the applications of the algorithms given for solving the problems given below.
i) Finding a minimum spanning tree from a weighted graph.
ii) Determination of an optimal tour from a weighted graph.
iii) Searching in a graph for Depth First manner.
iv) Finding the shortest paths from a source vertex in a directed weighted graph.
v) Finding a topological order from a directed acyclic graph.

answer by doing the mechanism of Depth First Search (DFS) and Breadth First Search (BFS).
Place
Adjacent
Farmgate
Manik Mia Avenue, Bijoy Sharoni
Manik Mia Avenue
Asad Gate, Bijoy Sharoni, Farmgate
Bijoy Sharoni
Mohakhali, Manik Mia Avenue, Farmgate
Mohakhali
Bijoy Sharoni, Farmgate, Airport, Gulshan
Airport
Mohakhali, Gulshan

distance between two locations are given below

Source
Destination
Distance(metre)
UIU
RS
100
RS
NM
200
UIU
SL
300
SL
NM
50
RS
SL
30

Here, UIU, RS and SL represent United International University, Riffles Square and Science Lab,
respectively.

4. Find an order of courses from the following graph using the topological order algorithm.

[7.5]

5. A postman starts his/her travel from Mohammadpur post office, traverses the places Adabor, Shymoli,

[7.5]

6. A flood destroys some communication links of Dhaka city. Some relief distribution centers are placed in

[7.5]

Lalmatia for distributing letters and finally returns to Mohammadpur post office. Design an optimal
tour for the postman by minimizing the time using the travelling sales person (TSP) algorithm.

the city so that whole cities can be covered by a minimum time by following the minimum cost link
using the Kruskals algorithm for finding a minimum spanning tree. Relief centers are placed in
Farmgate, Mohammadpur, Dhanmondi, Kolabagan, Mirpur, Gabtoli, and Shymoli. The distance
between two centers is given below.
Place
Farmgate
Dhanmondi
Mohammadpur
Mirpur

Adjacent
Dhanmondi, Kolabagan, Shymoli, Mirpur
Mohammadpur, Gabtoli, Shymoli
Gabtoli, Shymoli
Kolabagan, Shymoli, Gabtoli

Time(minute)
30, 50, 30, 55
15, 40, 20
28, 12
35, 14,7

7. Show that the greedy nearest neighbor algorithm does not always provide an optimal solution from the

[7.5]

8. a) Draw a recursion tree from the following graph using the recursive TSP algorithm.

[7.5]

following graph.

b) Show the adjacency structures for the following graph using the 2D array and linked list.