GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
326 views

Q: There are n  white dots and  n black dots, equally spaced in a line. We want to each white dot with some black dot in on-to-one fashion with a minimum total length of the wire. (See diagram above). Greedy algo. gives optimal solution for..

A) Only i

B) Only ii

C) Both

D) None

 

How to approach to such type of questions ?

asked in Algorithms by Loyal (2.7k points)  
retagged by | 326 views

Please log in or register to answer this question.

Related questions

0 votes
1 answer
2
+1 vote
1 answer
3
asked in Algorithms by LavTheRawkstar Boss (5.8k points)   | 121 views


Top Users Aug 2017
  1. ABKUNDAN

    4660 Points

  2. Bikram

    4366 Points

  3. akash.dinkar12

    3258 Points

  4. rahul sharma 5

    3042 Points

  5. manu00x

    2682 Points

  6. makhdoom ghaya

    2410 Points

  7. just_bhavana

    2100 Points

  8. Tesla!

    1918 Points

  9. stblue

    1682 Points

  10. joshi_nitish

    1608 Points


24,928 questions
32,024 answers
74,385 comments
30,113 users