Just to clarify some of the bug reports I got. Some of you are misunderstanding the question/answers given, and I have no idea how to get back to you (you can include your email in the bug report description so its easier for us to get back to you). 1) How many cells in the Adjacency Matrix of this graph are not empty/zero? The vertices in this simple graph are labelled from 0 to v-1. Note that bidirectional/undirected edges are counted twice. (See first picture attached) ==> The correct answer is 22. 2) Click all the edges (in the order that they are processed) that make up the spanning tree induced by DFS starting from source vertex 2 for this graph. The neighbours of a vertex are listed in ascending vertex number. (See second picture attached) ==> Your answer: [[4,2],[4,1],[7,1],[3,7],[3,4],[1,8],[8,6],[6,0],[5,6]] ==> The correct answer is [[4,2],[4,1],[7,1],[3,7],[1,8],[8,6],[6,0],[6,5]] 3) Graph is too large. Part of it is hidden. ==> Zoom out (sorry, this cant really be helped at the moment) 4) Read the MST questions very carefully. Some are asking for MAXimum and some are asking for MINimum. All the best preparing for your online quiz 2 :)
Posted on: Fri, 17 Oct 2014 10:09:19 +0000
Recently Viewed Topics
© 2015