COMPUTER FUNDAMENTALS

Detailed explanation-1: -Decision Node: When a sub-node splits into further sub-nodes, then it is called the decision node. Leaf / Terminal Node: Nodes do not split is called Leaf or Terminal node. Pruning: When we remove sub-nodes of a decision node, this process is called pruning. You can say the opposite process of splitting.

Detailed explanation-2: -There are three different types of nodes: chance nodes, decision nodes, and end nodes. A chance node, represented by a circle, shows the probabilities of certain results. A decision node, represented by a square, shows a decision to be made, and an end node shows the final outcome of a decision path.

Detailed explanation-3: -A decision node is a node in an activity at which the flow branches into several optional flows. There is exactly one incoming edge and an arbitrary number of outgoing edges, which each have a condition. A merge node is a node in an activity at which several flows are merged into one single flow.

Detailed explanation-4: -Leaf/Terminal Node: Nodes that do not split further are called Leaf/Terminal nodes.

Detailed explanation-5: -In general, decision nodes and branches represent the controllable factors in a decision problem; event nodes and branches represent uncontrollable factors.