There is a group of n people, some of them know each other. One of the people he

Question

There is a group of n people, some of them know each other. One of the people heard a rumor, that he/she can secretly tell just to 1 person he/she knows. That person, in turn, can tell a rumor to other person and so on. If the person hear the rumor that he/she already know, this person will not share it with anyone else (assuming that if he/she heard it twice, than probably everybody knows it). You need to find out, is it possible that eventually everybody will hear the rumor? Represent this problem as one of the algorithmic problems that we studied in our class. What is this algorithmic problem? Is it possible to solve it in a polynomial time?

Explanation / Answer

To answer the given question,

The topic under which the problem to be considered is not given in the question,

what all algorithmic problems were studied in the class is not given in the question, which are needed to answer.

  

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.