TUTORIAL SHEET 5 1. Fill in the blanks : a) b) c) 1. 1. 1. 1. 1. 1.

Number of arcs in the transitive closure graph of a strongly connected directive graph of N vertices will be . A minimum spanning tree of a graph of N nodes will have..edges. A binary tree with N nodes has e actly .null branches.

!an we say that a tree is a directed graph" #efine the term internal sort and what is the difference between internal and e ternal sort" $hat are the limitations of di%kstra&s algorithm" ' plain (uick sort with the help of an e ample. $rite down the algorithm for topological sort and e plain it with the help of an e ample. $hat are its limitations" $hat is a spanning tree" $hat is minimum spanning tree" Find the minimum spanning tree using kruskal&s algorithm..

). ).

' plain different types of internal sort method" *i) sort the following list of data using the follwing sorting algoriths : 1+, -., ., /, +-, /0, .+, +1 a) 2adi sort b) 3eap sort c) 4nsertion sort d) 5hell sort

6.

*ii) find out the following thing in the graph whose ad%acency matri is as follows : a a b c d 1 1 1 1 b 1 1 1 1 c 1 1 1 1 d 1 1 1 1

$here a, b, c and d are vertices in the graph. a) 7ath matri of the graph b) 8ransitive closure of the graph c) 5hortest path using floyd warshall9s algorithm d) 5hortest path using floyd di%kastral9s algorithm e) 5ink and source vertices in the graph f) #egree of each vertice

11.

$rite down the following functions : algorithm: a) b) ;uick sort 3eap sort

11. $hat do you mean by the term simple path" 1+. $hat is the difference between a cycle and a loop"