GATE CSE
First time here? Checkout the FAQ!
x
0 votes
196 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.5k points)  
edited by | 196 views

Please log in or register to answer this question.

Related questions

0 votes
1 answer
3
asked in Algorithms by Sarvottam Patel Junior (919 points)   | 40 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