National Higher School of Nanosciences
and Nanotechnology Second Year Bachelor
Subject: Computer science 3 2025-2026
2025-2026
Tutorial 03
Exercise 01
Respond with yes or no and justify your answer.
Graph Tree Rooted Tree Forest
Exercise 02
How many different spanning trees do the following graphs have?
1/3
Exercise 03
Run Kruskal's algorithm on the weighted graphs below.
Exercise 04
Let the graph below.
- Find the minimum weight tree and then the maximum weight tree.
Exercise 05
Let the graph below.
- Determine the minimum spanning tree using Prim's algorithm.
5 9
a g h
7 7 2
19
13 c 23 f 19
11
5 10
5
b 4 d 13 e
2/3