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. What is this algorithmic problem? Is it possible to solve it in a polynomial time?

Explanation / Answer

Suppose we take G is a group. The group conatined n numbers like n1,n2,n3,n4....n.

Now the process is

if n1 knows the rumor he/she tells to n2 or ,n3 or n4..n

or if n2 knows the rumor he/she tells to n1 or n3 ,..n

there is a chance to should konw the rumor any one person in the group.

if the rumor passing to one person to another it will reached to starting position.

in the final state who recieved last message they already know the message.according to this all are known the message.

here so many ways to know the message. like tarvlling sales amn problem.

Yes here we can represented as a algorithmic problem.

The algorithmic problem is

The algorithmic problem thinking is it can be perused as "algorithmic-problem thinking"; this implies taking care of issues that require the detailing of a calculation for their answer. Search the kowing persons.

The plan of calculations has dependably been a vital component of problem thinking yet, previously, the calculation has occasional been the center of consideration. The way that robotization is an ever-display highlight of our every day lives in the created world implies that we should give increasingly exertion on enhancing our aptitudes in algorithmic problem thinking. Calculations are the deciding result of the problem thinking process and it is basic that they are made unequivocal and are painstakingly concentrated on.

Yes. There are many problems that can be proven to in a polynomial time.

A calculation is said to be feasible in polynomial time if the quantity of steps required to finish the calculation for a given information is O(n^k) for some nonnegative whole number k, where n is the multifaceted nature of the data. Polynomial-time calculations are said to be "quick." Most recognizable numerical operations, for example, expansion, subtraction, increase, and division, and additionally processing square roots, forces, and logarithms, can be performed in polynomial time. Processing the digits of most fascinating numerical constants, including pi and e, should likewise be possible in polynomial time.

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

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