1 votes 1 votes how is statement iv always true?? Algorithms algorithms test-series + – Akriti sood asked Jan 23, 2017 Akriti sood 459 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Rahul Jain25 commented Jan 23, 2017 reply Follow Share Yes 4 is not always true consider a triangle. all edges form cyclem 0 votes 0 votes Pavan Kumar Munnam commented Jan 23, 2017 reply Follow Share and i think statement 3 is true as all the edges will be distinct when the first best MST is formed second best MST is formed by removing a edge with the next highest edge so the second best also will be unique correct me if i'm wrong!! 1 votes 1 votes Akriti sood commented Jan 24, 2017 reply Follow Share yes @pavan,i also think the same,dts y i marked that answr –1 votes –1 votes mcjoshi commented Jan 24, 2017 reply Follow Share @Akriti, even i marked same(C). but see option (4) it says edges that do not lie in any cycle must be in MST, it doesn't say what if they lie in cycle. So (4) is true. And for (3) who knows maybe someone can draw a graph. But not sure. maybe it depends on how weights are distributed (1+4) = (3+2) 0 votes 0 votes Akriti sood commented Jan 24, 2017 reply Follow Share 3rd sttement says that MST will include all edges not in cycle,it also means that we can include any edge not in ycle even if it is the maximum size edge,but thats not true..right?? anmd since,weights are unique,so second best will just not contain the minimum weight edge,rest all same.can u give nay counter example for 3rd?? 0 votes 0 votes mcjoshi commented Jan 24, 2017 reply Follow Share no even if a max weight edge is not in cycle it is to be included, consider graph:: AC = 100,DC = 101,CB = CE = BE = 1 0 votes 0 votes mcjoshi commented Jan 24, 2017 reply Follow Share So, (4) is definitely true. And According to me (3) is also true, but i mean to say maybe there exists a counter example for option (iii) statement. 0 votes 0 votes Akriti sood commented Jan 24, 2017 reply Follow Share alright..thanks @mcjoshi..:) 1 votes 1 votes Please log in or register to add a comment.