Jump to content

anum

Members
  • Posts

    6
  • Joined

  • Last visited

Recent Profile Visitors

The recent visitors block is disabled and is not being shown to other users.

anum's Achievements

Lepton

Lepton (1/13)

0

Reputation

  1. What is f(x) − f(x + 2) if f(x + 1) = x(x + 2)?
  2. anum

    urgent help

    I have read the above description . I only need help not answers as i wrote in my question . Please read again . I wrote i need help , so i should be helped before directing me to read such instructions again thanks
  3. anum

    urgent help

    Hi, can somebody please help me with these two questions? 1)Suppose a social network contains a number of people, each of whom has one of two “opinions” (e.g. a preference for Mac versus PC). Each person is connected with a set of “friends”, some of the other people in the network. You can choose any person in the network and let them see the opinions of their friends, and if most of the friends have the same opinion, then the chosen person will change their opinion to the one shared by the majority of their friends. If there’s an equal split, you can choose their opinion. Assuming the network is connected, can we always find a sequence of people so as to ensure that they all end up with the same opinion? 2)Two ants walk on a line in a random fashion. They begin 10cm apart. At each time step, each ant has a probability of 1/2 to move 1cm to the left, and probability 1/2 to move 1cm to the right. What is the probability that after 7 time steps, the ants have met one another (i.e., passed through the same point)?
  4. can somebody please help me with below question? It is urgent homework help. much appreciated In your own words, explain what is meant by dynamic programming. Give an example of a problem for which this would be a useful approach, and describe briefly how dynamic programming would solve this problem. You should aim to write 1/2-1 page
  5. Hi, can somebody please help me with these two questions? 1)Suppose a social network contains a number of people, each of whom has one of two “opinions” (e.g. a preference for Mac versus PC). Each person is connected with a set of “friends”, some of the other people in the network. You can choose any person in the network and let them see the opinions of their friends, and if most of the friends have the same opinion, then the chosen person will change their opinion to the one shared by the majority of their friends. If there’s an equal split, you can choose their opinion. Assuming the network is connected, can we always find a sequence of people so as to ensure that they all end up with the same opinion? 2)Two ants walk on a line in a random fashion. They begin 10cm apart. At each time step, each ant has a probability of 1/2 to move 1cm to the left, and probability 1/2 to move 1cm to the right. What is the probability that after 7 time steps, the ants have met one another (i.e., passed through the same point)?
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.