Boolean Algebra in Software Testing Methodologies

Steps:

1. Label each decision with an uppercase letter that represents the truth value of the predicate. The YES or TRUE is labeled with a letter (say A) and the No r FALSE branch with the same letter over scored (say Ā)

2. The truth value of a path is the product of the individual labels. Concatenation or products mean "AND". For example the straight-through path of Image 6, which goes via nodes 3,6,7,8,10,11,12 and 2, has a truth value of ABC. The path via nodes 3,6,7,9 and 2 has values of (ABC)̄
Using convention, the truth functional values for several of the nodes can be expressed in terms of segments from previous nodes. Use the node name to identify the point
N6 = A+ĀB̄C̄
N8 = (N6)B + ĀB = AB + ĀB̄C̄B + ĀB
N11 = N8(C) + (N6)B̄C
N12 = N11 + ĀB̄C
N2 = N12 + (NB)C̄ + (N6)B̄C
There are only two numbers in boolean algebra: zero (0) and one (1)
One means "always true" and zero means "always false"

Share on Google Plus

About Data Sciences by Venu

Hi, My name is Venugopala Chary and I'm Currently working as Associate Professor in Reputed Engineerng College, Hyderabad. I have B.Tech and M.tech in regular from JNTU Hyderabad. I have 11 Years of Teaching Experience for both B.Tech and M.Tech Courses.