High Quality Content by WIKIPEDIA articles! A decision-to-decision path, or DD-Path, is a path of execution (usually through a graph representing a program, such as a flow-chart) that does not include any conditional nodes. That is, it is the path of execution between two decisions. Essential complexity refers to a situation where all reasonable solutions to a problem must be complicated (and possibly confusing) because the "simple" solutions would not adequately solve the problem. It stands in contrast to accidental complexity, which arises purely from mismatches in the particular choice of tools and methods applied in the solution. This term has been use since, at least, the mid-1980s. The Turing Award winner, Fred Brooks, has used this term and its antonym of accidental complexity since the mid-1980s. He as also updated his views in 1995 for an anniversary edition of the book titled ", Mythical Man-Month, Silver Bullet Refired.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.