GATE CSE
First time here? Checkout the FAQ!
x
–1 vote
125 views

There are n white dots and n black dots. Equally spaced in a line. You want to connect each white dot with some block dot in one to one fashion with a minimum total length of wire.
Consider 2 examples:

 

Greedy algorithm gives optimal solution for

  •  Only (i)

     

  • Only (ii)

     

  • Both (i) and (ii)

     

  • None of these
asked in Algorithms by Loyal (3.8k points)   | 125 views
What does it mean by total length of wire?

Please log in or register to answer this question.

Related questions

0 votes
1 answer
1
asked in Algorithms by Sarvottam Patel Junior (919 points)   | 40 views
0 votes
0 answers
3
asked in Algorithms by Tushar Shinde Loyal (2.5k points)   | 196 views
Top Users Feb 2017
  1. Arjun

    4898 Points

  2. Bikram

    4102 Points

  3. Habibkhan

    3748 Points

  4. Aboveallplayer

    2986 Points

  5. sriv_shubham

    2288 Points

  6. Smriti012

    2222 Points

  7. Arnabi

    1946 Points

  8. Debashish Deka

    1920 Points

  9. mcjoshi

    1614 Points

  10. sh!va

    1462 Points

Monthly Topper: Rs. 500 gift card

20,793 questions
25,951 answers
59,557 comments
21,976 users