Solved

# Decision Tree

Posted on 2011-10-25
261 Views

Omedi wants to get from point A to some point on the subway (represented by the thick dotted line). At each intersection, he can decide to go either south or east. How many different paths can he take? Draw a decision tree representing the different possible paths.

p24.JPG
0
Question by:mustish1

LVL 31

Accepted Solution

A---->--- B --->----C
|             |            |
D---->---E---->----F
|             |            |
H---->----I ---->---J

The graph you want is as above, (all vertical edges directed downwards)

Now form the decision tree starting from A, (as in the last question), but terminate at any leaf when you hit either

H, I, J, F or C

The number of paths is the number of leaves.

I can't do more than that else I am doing the question.
0

LVL 31

Expert Comment

To be technically correct he graph is actually this, as once you hit the subway you are done

A---->--- B --->----C
|             |
D---->---E---->----F
|             |
H            I
0

Author Closing Comment

Thanks.
0

## Featured Post

### Suggested Solutions

Lithium-ion batteries area cornerstone of today's portable electronic devices, and even though they are relied upon heavily, their chemistry and origin are not of common knowledge. This article is about a device on which every smartphone, laptop, an…
This story has been written with permission from the scammed victim, a valued client of mine – identity protected by request.
Articles on a wide range of technology and professional topics are available on Experts Exchange. These resources are written by members, for members, and can be written about any topic you feel passionate about. Learn how to best write an article t…
Saved searches can save you time by quickly referencing commonly searched terms on any topic. Whether you are looking for questions you can answer or hoping to learn about a specific issue, a saved search can help you get the most out of your time o…