plz clarify it

3 Sep 2016 - 2:38pm

yes calculation is fully correct

First she has taken 21 square.

then taken 3 square of diagonal √2 , as each 2 diagonal gives 4 triangles. and each triangle one side must be 1 cm

then taken √2/2 , which is half of diagonal. So, gives 2 triangle as output.

It will give maximum number of triangles

3 Sep 2016 - 8:45am

But bro a solution means one solution

and a solution doesnot mean many solution

3 Sep 2016 - 12:32am

yes bro, but could u give me a reference where it is saying BFS traversal is false due to conflict?

I donot think conflict makes one BFS traversal true another false.


here so many conflict, but that doesnot make any BFS traversal false

3 Sep 2016 - 12:20am

Answer will be D)

2 Sep 2016 - 7:14pm

bro here question is about a solution

which is never possible here

2 Sep 2016 - 7:13pm

Here B) and C) both correct

2 Sep 2016 - 7:08pm

S1: if each edge increased by 1, then why there will be any change in shortest path?

2 Sep 2016 - 7:06pm

ST2: if I think about almost skewed tree , where a middle node has a branch. Height may be O(N)

2 Sep 2016 - 6:52pm

Insertion of binary heap of N element will take time to insert an element and also heapification time O(N log N)

2 Sep 2016 - 6:45pm