quinta-feira, 15 de agosto de 2024

Question 1 - Topological Sorting

Question:  There is a very complex process that can be optimized in a chip factory. All engineers decided to put together their knowledge and list where each part of this chip needs to be inserted, in order, to achieve the final assembly. Below you will find those dependecies, which graph best represents the overall process?

  • Part 1: needs to be inserted into Part 2, then Part 4 and Part 5;
  • Part 2: needs to be inserted into Part 4, then Part 5;
  • Part 3: needs to be inserted only into Part 2;
  • Part 4: needs to be inserted into Part 5;
  • Part 5: does not have to be connected to anything;
  • Part 6: needs to be inserted into Part 7;
  • Part 7: needs to be inserted into Part 5;
  • Part 8: needs to be inserted into Part 3;
  • Part 9: needs to be inserted into Part 7.

Answer:






  1. None of the above
Answer: B

Um comentário:

  1. Very interesting question, but there are some problems. The reader gets confused, because part 1 is inserted in part2, then part 4 and part 5. However, it is not clear if insertion in part 2 already qualifies as insertion in part 4 as well, since part 2 must be inserted in part 4. The same doubt appears regarding the chain 1 -> 2 -> 4 -> 5. Also, when you say that part 5 does not have to be connected to anything, we remain in doubt whether the link 4 -> 5 means a connection or not. If it does, then 5 IS connected to 4, contradicting the previous statement. The reader wonders why you didn't just say that part 5 does not have to be inserted (instead of connected) into anything.

    ResponderExcluir