GATE CSE
First time here? Checkout the FAQ!
x
0 votes
176 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 | 176 views

Please log in or register to answer this question.

Related questions

Top Users Jan 2017
  1. Debashish Deka

    7906 Points

  2. Habibkhan

    4736 Points

  3. Vijay Thakur

    4474 Points

  4. sudsho

    4318 Points

  5. saurabh rai

    4200 Points

  6. Arjun

    3638 Points

  7. Bikram

    3496 Points

  8. santhoshdevulapally

    3470 Points

  9. GateSet

    3228 Points

  10. Sushant Gokhale

    3116 Points

Monthly Topper: Rs. 500 gift card

18,944 questions
23,897 answers
52,115 comments
20,213 users