[{"data":1,"prerenderedAt":73},["ShallowReactive",2],{"wiki-test-design-decision-table-testing-en":3},{"meta":4,"html":8,"headings":9,"words":72},{"title":5,"description":6,"published":7,"updated":7},"Decision table testing","Decision table testing: conditions, actions and rules, full and collapsed tables, impossible combinations, coverage and Gherkin scenarios from a table.","2026-11-03","\u003Cp>\u003Cstrong>Decision table testing\u003C/strong> is a black-box test technique in which \u003Cspan class=\"wiki-term\" tabindex=\"0\" data-wiki-term=\"test-case\">test cases\u003C/span> are derived from a decision table: a table that lists the conditions of a business rule, the actions that follow from them, and the combinations of condition values that lead to each set of actions. Each combination is a rule of the table, and each rule that can occur in practice becomes at least one test case.\u003C/p>\n\u003Cp>The technique is defined in the international standard ISO/IEC/IEEE 29119-4:2021, Software testing, Part 4: Test techniques (clause 5.2.6, coverage in clause 6.2.6), and in the ISTQB Certified Tester Foundation Level syllabus, version 4.0.1 (section 4.2.3). The same standard describes cause-effect graphing (clause 5.2.7), a related technique described in The Art of Software Testing by Glenford Myers, first published in 1979. Both techniques work with decision rules: ISO/IEC/IEEE 29119-4 defines a decision table as a tabular representation of decision rules that link causes, expressed as Boolean conditions, to effects.\u003C/p>\n\u003Ch2 id=\"the-problem-decision-tables-solve\" class=\"wiki-heading\">The problem decision tables solve\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"the-problem-decision-tables-solve\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h2>\n\u003Cp>Business rules are written as sentences: "Members get a discount. Orders from 100.00 are delivered free. Gold members always get free delivery." Each sentence is clear on its own. The questions arise between them: does a Gold member get both discounts, does free delivery apply to a guest, what happens when two sentences contradict each other.\u003C/p>\n\u003Cp>Tests written directly from such text check the cases that the text mentions explicitly. Combinations that the text does not mention remain untested, and they are often the place where the implementation and the expectation differ. A decision table lists every combination of conditions, so each of them receives an explicit outcome or is marked as impossible. The ISTQB syllabus names two results of the technique: it identifies all combinations of conditions systematically, and it helps find gaps and contradictions in the requirements.\u003C/p>\n\u003Ch2 id=\"structure-of-a-decision-table\" class=\"wiki-heading\">Structure of a decision table\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"structure-of-a-decision-table\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h2>\n\u003Ch3 id=\"conditions-and-actions\" class=\"wiki-heading\">Conditions and actions\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"conditions-and-actions\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h3>\n\u003Cp>A decision table has two kinds of rows. \u003Cstrong>Conditions\u003C/strong> are the inputs of the rule: facts about the data or the situation that determine the outcome, such as "the customer is a registered member" or "the order total is 100.00 or more". \u003Cstrong>Actions\u003C/strong> are the outputs: what the system does, such as "apply a 10 percent discount" or "deliver free of charge".\u003C/p>\n\u003Ch3 id=\"rules\" class=\"wiki-heading\">Rules\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"rules\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h3>\n\u003Cp>Each column of the table is a \u003Cstrong>decision rule\u003C/strong>: one combination of condition values and the actions that result from it. ISO/IEC/IEEE 29119-4 describes a decision rule as a combination of conditions and actions that produces a specific outcome. A column is read from top to bottom: "if C1 is true, C2 is false and C3 is true, then perform A2 and A3".\u003C/p>\n\u003Ch3 id=\"notation\" class=\"wiki-heading\">Notation\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"notation\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h3>\n\u003Cp>The ISTQB syllabus v4.0.1 uses the following entries in the cells of a table.\u003C/p>\n\u003Cdiv class=\"wiki-table wiki-table--cols-2\">\u003Ctable>\n\u003Cthead>\n\u003Ctr>\n\u003Cth>Entry\u003C/th>\n\u003Cth>Meaning\u003C/th>\n\u003C/tr>\n\u003C/thead>\n\u003Ctbody>\n\u003Ctr>\n\u003Ctd>T\u003C/td>\n\u003Ctd>The condition is satisfied\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>F\u003C/td>\n\u003Ctd>The condition is not satisfied\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>-\u003C/td>\n\u003Ctd>The value of the condition is irrelevant for the outcome\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>N/A\u003C/td>\n\u003Ctd>The condition is infeasible for the rule\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>X\u003C/td>\n\u003Ctd>The action occurs\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>Blank\u003C/td>\n\u003Ctd>The action does not occur\u003C/td>\n\u003C/tr>\n\u003C/tbody>\n\u003C/table>\u003C/div>\n\u003Ch3 id=\"limited-entry-and-extended-entry-tables\" class=\"wiki-heading\">Limited-entry and extended-entry tables\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"limited-entry-and-extended-entry-tables\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h3>\n\u003Cp>In a \u003Cstrong>limited-entry decision table\u003C/strong> all condition and action values are Boolean: true or false, apart from irrelevant and infeasible entries. In an \u003Cstrong>extended-entry decision table\u003C/strong> some conditions or actions take more values, for example ranges of numbers, \u003Cspan class=\"wiki-term\" tabindex=\"0\" data-wiki-term=\"equivalence-partition\">equivalence partitions\u003C/span> or discrete values such as "guest, member, gold member".\u003C/p>\n\u003Cp>An extended-entry table is shorter, because one row replaces several Boolean conditions. Its values are often equivalence partitions, and how such partitions are chosen is described in the article \u003Ca href=\"/en/wiki/test-design/equivalence-partitioning-and-boundary-values\" class=\"wiki-link wiki-link--article\">Equivalence partitioning and boundary values\u003C/a>.\u003C/p>\n\u003Ch2 id=\"from-the-business-rule-to-the-full-table\" class=\"wiki-heading\">From the business rule to the full table\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"from-the-business-rule-to-the-full-table\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h2>\n\u003Cp>The example rule of an online store is:\u003C/p>\n\u003Cul>\n\u003Cli>registered members get a 5 percent discount, and members with Gold status get 10 percent;\u003C/li>\n\u003Cli>orders with a total of 100.00 or more are delivered free;\u003C/li>\n\u003Cli>members with Gold status always get free delivery;\u003C/li>\n\u003Cli>only registered members can have Gold status.\u003C/li>\n\u003C/ul>\n\u003Cp>The rule has three Boolean conditions and three actions. A \u003Cstrong>full decision table\u003C/strong> contains every combination of condition values. For n Boolean conditions this is 2 to the power of n columns, here 8. For an extended-entry table the number is the product of the numbers of values of all conditions.\u003C/p>\n\u003Cp>The full table of the example is shown below.\u003C/p>\n\u003Cdiv class=\"wiki-table wiki-table--cols-6\">\u003Ctable>\n\u003Cthead>\n\u003Ctr>\n\u003Cth>\u003C/th>\n\u003Cth>1\u003C/th>\n\u003Cth>2\u003C/th>\n\u003Cth>3\u003C/th>\n\u003Cth>4\u003C/th>\n\u003Cth>5\u003C/th>\n\u003Cth>6\u003C/th>\n\u003Cth>7\u003C/th>\n\u003Cth>8\u003C/th>\n\u003C/tr>\n\u003C/thead>\n\u003Ctbody>\n\u003Ctr>\n\u003Ctd>C1 Registered member\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>C2 Gold status\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003Ctd>N/A\u003C/td>\n\u003Ctd>N/A\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>C3 Total 100.00 or more\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>A1 Discount 10 percent\u003C/td>\n\u003Ctd>X\u003C/td>\n\u003Ctd>X\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>A2 Discount 5 percent\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>X\u003C/td>\n\u003Ctd>X\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>A3 Free delivery\u003C/td>\n\u003Ctd>X\u003C/td>\n\u003Ctd>X\u003C/td>\n\u003Ctd>X\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>X\u003C/td>\n\u003Ctd>\u003C/td>\n\u003C/tr>\n\u003C/tbody>\n\u003C/table>\u003C/div>\n\u003Cp>Columns 1 to 4 describe members, columns 7 and 8 describe guests. Columns 5 and 6 combine "not a member" with "Gold status", which the rule excludes; the entry N/A in C2 marks this.\u003C/p>\n\u003Ch2 id=\"impossible-combinations\" class=\"wiki-heading\">Impossible combinations\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"impossible-combinations\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h2>\n\u003Cp>Columns 5 and 6 are \u003Cstrong>infeasible combinations\u003C/strong>: combinations of condition values that cannot occur. They appear whenever conditions depend on each other. Typical sources are conditions that exclude each other ("age under 18" and "age 65 or over"), conditions that imply each other ("Gold status" requires "registered member") and conditions on the same value with different thresholds.\u003C/p>\n\u003Cp>The syllabus describes removing infeasible columns as a simplification of the full table. In the example the simplified table has 6 columns. Whether a combination is infeasible is a statement about the system, not only about the rule. If an import or an API can create a guest record with Gold status, the combination can occur, and the table needs a rule for it.\u003C/p>\n\u003Cp>An extended-entry table can remove such combinations by construction. A single condition "customer type: guest, member, gold member" replaces C1 and C2, and the table has 3 times 2, that is 6, columns, all of them feasible.\u003C/p>\n\u003Ch2 id=\"decision-table-coverage\" class=\"wiki-heading\">Decision table coverage\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"decision-table-coverage\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h2>\n\u003Cp>In decision table testing the coverage items are the columns that contain feasible combinations of conditions. \u003Cstrong>Decision table coverage\u003C/strong>, as the ISTQB syllabus v4.0.1 defines it, is the number of exercised columns divided by the total number of feasible columns, expressed as a percentage. 100 percent coverage requires test cases that exercise all of these columns.\u003C/p>\n\u003Cp>In the example the feasible columns are 1, 2, 3, 4, 7 and 8. Test cases for columns 1, 3, 4, 7 and 8 exercise 5 of 6 feasible columns, which gives 83 percent. Column 2, a Gold member with an order below 100.00, remains unexercised.\u003C/p>\n\u003Cp>The measure depends on the table that is counted. The same five test cases give 100 percent against the collapsed table described below, because there columns 1 and 2 are one column. A coverage figure for a decision table is therefore reported together with the table it refers to.\u003C/p>\n\u003Ch2 id=\"collapsing-a-table\" class=\"wiki-heading\">Collapsing a table\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"collapsing-a-table\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h2>\n\u003Ch3 id=\"irrelevant-entries\" class=\"wiki-heading\">Irrelevant entries\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"irrelevant-entries\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h3>\n\u003Cp>The number of columns of a full table grows exponentially with the number of conditions: 10 Boolean conditions give 1024 columns. The syllabus names two ways to reduce it: a minimized decision table and a risk-based approach.\u003C/p>\n\u003Cp>A table is minimized by merging columns in which some conditions do not affect the outcome. In the example, columns 1 and 2 have the same actions and differ only in C3: for a Gold member the order total does not matter. They are merged into one column with the entry "-" for C3. The collapsed table has five columns.\u003C/p>\n\u003Cdiv class=\"wiki-table wiki-table--cols-6\">\u003Ctable>\n\u003Cthead>\n\u003Ctr>\n\u003Cth>\u003C/th>\n\u003Cth>R1\u003C/th>\n\u003Cth>R2\u003C/th>\n\u003Cth>R3\u003C/th>\n\u003Cth>R4\u003C/th>\n\u003Cth>R5\u003C/th>\n\u003C/tr>\n\u003C/thead>\n\u003Ctbody>\n\u003Ctr>\n\u003Ctd>C1 Registered member\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>C2 Gold status\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>C3 Total 100.00 or more\u003C/td>\n\u003Ctd>-\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003Ctd>T\u003C/td>\n\u003Ctd>F\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>A1 Discount 10 percent\u003C/td>\n\u003Ctd>X\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>A2 Discount 5 percent\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>X\u003C/td>\n\u003Ctd>X\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>A3 Free delivery\u003C/td>\n\u003Ctd>X\u003C/td>\n\u003Ctd>X\u003C/td>\n\u003Ctd>\u003C/td>\n\u003Ctd>X\u003C/td>\n\u003Ctd>\u003C/td>\n\u003C/tr>\n\u003C/tbody>\n\u003C/table>\u003C/div>\n\u003Cp>The other columns cannot be merged: each pair differs in at least one action or in more than one condition. Algorithms for minimization are outside the scope of the Foundation Level syllabus.\u003C/p>\n\u003Ch3 id=\"risks-of-collapsing\" class=\"wiki-heading\">Risks of collapsing\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"risks-of-collapsing\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h3>\n\u003Cp>An irrelevant entry is a claim that the condition does not affect the outcome. A test case for a collapsed column uses one value of that condition, and the other value remains untested. If the implementation gives a Gold member free delivery only from 100.00, a test case for R1 with an order of 150.00 passes. Only an order below 100.00, that is column 2 of the full table, reveals the \u003Cspan class=\"wiki-term\" tabindex=\"0\" data-wiki-term=\"defect\">defect\u003C/span>.\u003C/p>\n\u003Cp>Collapsing therefore trades coverage of combinations for a smaller number of test cases. Three practices limit the risk:\u003C/p>\n\u003Cul>\n\u003Cli>\u003Cstrong>Full table as reference.\u003C/strong> The full or simplified table is kept, and coverage is reported against it as well as against the collapsed one.\u003C/li>\n\u003Cli>\u003Cstrong>Both values for high-risk rules.\u003C/strong> A collapsed column of a rule with high risk is tested with each value of the irrelevant condition.\u003C/li>\n\u003Cli>\u003Cstrong>Revision on change.\u003C/strong> When a requirement changes, collapsed columns are expanded again, because a condition that was irrelevant can become relevant.\u003C/li>\n\u003C/ul>\n\u003Cp>Columns of a collapsed table must not overlap. If one combination of condition values matches two columns with different actions, the table, and usually the requirement behind it, contains a contradiction.\u003C/p>\n\u003Ch2 id=\"rules-named-by-their-outcome\" class=\"wiki-heading\">Rules named by their outcome\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"rules-named-by-their-outcome\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h2>\n\u003Cp>Column numbers say nothing about the content of a rule. A name that states the outcome makes the table readable and gives each test case a title that can be checked against the requirement. The names of the collapsed table in the example are:\u003C/p>\n\u003Cdiv class=\"wiki-table wiki-table--cols-2\">\u003Ctable>\n\u003Cthead>\n\u003Ctr>\n\u003Cth>Rule\u003C/th>\n\u003Cth>Name\u003C/th>\n\u003C/tr>\n\u003C/thead>\n\u003Ctbody>\n\u003Ctr>\n\u003Ctd>R1\u003C/td>\n\u003Ctd>Gold: 10 percent, free delivery\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>R2\u003C/td>\n\u003Ctd>Member, 100.00 or more: 5 percent, free delivery\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>R3\u003C/td>\n\u003Ctd>Member, below 100.00: 5 percent, paid delivery\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>R4\u003C/td>\n\u003Ctd>Guest, 100.00 or more: no discount, free delivery\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>R5\u003C/td>\n\u003Ctd>Guest, below 100.00: no discount, paid delivery\u003C/td>\n\u003C/tr>\n\u003C/tbody>\n\u003C/table>\u003C/div>\n\u003Cp>The name of the rule becomes the title of the test case. A failed test case then points to a business rule rather than to a column number. Links between such test cases and the requirement are described in the article \u003Ca href=\"/en/wiki/test-management/requirements-traceability\" class=\"wiki-link wiki-link--article\">Requirements traceability and coverage\u003C/a>.\u003C/p>\n\u003Ch2 id=\"test-cases-from-the-table\" class=\"wiki-heading\">Test cases from the table\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"test-cases-from-the-table\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h2>\n\u003Cp>Each column becomes at least one test case. The condition entries become the \u003Cspan class=\"wiki-term\" tabindex=\"0\" data-wiki-term=\"precondition\">preconditions\u003C/span> and inputs, the action entries become the \u003Cspan class=\"wiki-term\" tabindex=\"0\" data-wiki-term=\"expected-result\">expected results\u003C/span>. Concrete values are taken from the partitions of each condition:\u003C/p>\n\u003Cdiv class=\"wiki-table wiki-table--cols-5\">\u003Ctable>\n\u003Cthead>\n\u003Ctr>\n\u003Cth>Rule\u003C/th>\n\u003Cth>Customer\u003C/th>\n\u003Cth>Order total\u003C/th>\n\u003Cth>Expected discount\u003C/th>\n\u003Cth>Expected delivery\u003C/th>\n\u003C/tr>\n\u003C/thead>\n\u003Ctbody>\n\u003Ctr>\n\u003Ctd>R1\u003C/td>\n\u003Ctd>Gold member\u003C/td>\n\u003Ctd>40.00\u003C/td>\n\u003Ctd>10 percent\u003C/td>\n\u003Ctd>Free\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>R2\u003C/td>\n\u003Ctd>Member\u003C/td>\n\u003Ctd>100.00\u003C/td>\n\u003Ctd>5 percent\u003C/td>\n\u003Ctd>Free\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>R3\u003C/td>\n\u003Ctd>Member\u003C/td>\n\u003Ctd>99.99\u003C/td>\n\u003Ctd>5 percent\u003C/td>\n\u003Ctd>Paid\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>R4\u003C/td>\n\u003Ctd>Guest\u003C/td>\n\u003Ctd>100.00\u003C/td>\n\u003Ctd>None\u003C/td>\n\u003Ctd>Free\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>R5\u003C/td>\n\u003Ctd>Guest\u003C/td>\n\u003Ctd>99.99\u003C/td>\n\u003Ctd>None\u003C/td>\n\u003Ctd>Paid\u003C/td>\n\u003C/tr>\n\u003C/tbody>\n\u003C/table>\u003C/div>\n\u003Cp>C3 is a condition on an ordered value, so its values are taken at the boundary: 100.00 for "true" and 99.99 for "false". The table and \u003Cspan class=\"wiki-term\" tabindex=\"0\" data-wiki-term=\"boundary-value-analysis\">boundary value analysis\u003C/span> thus check both the combinations and the edge of the threshold. For R1 the order total of 40.00 is chosen below the threshold, the case that a defect in the irrelevant condition would affect.\u003C/p>\n\u003Ch2 id=\"gherkin-scenarios-from-a-table\" class=\"wiki-heading\">Gherkin scenarios from a table\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"gherkin-scenarios-from-a-table\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h2>\n\u003Cp>Gherkin, the language of Cucumber specifications, has a direct counterpart of a decision table. A \u003Ccode>Scenario Outline\u003C/code> (synonym \u003Ccode>Scenario Template\u003C/code>) is a template of steps with parameters in angle brackets. It contains one or more \u003Ccode>Examples\u003C/code> sections (synonym \u003Ccode>Scenarios\u003C/code>), and the outline is run once for each row of the examples table, excluding the header. The optional \u003Ccode>Rule\u003C/code> keyword, part of Gherkin since version 6, represents one business rule.\u003C/p>\n\u003Cp>The mapping is direct. The business rule becomes \u003Ccode>Rule\u003C/code>. The conditions become \u003Ccode>Given\u003C/code> steps, the actions become \u003Ccode>Then\u003C/code> steps, and each column of the decision table becomes a row of \u003Ccode>Examples\u003C/code>. A column with the rule name fills the title of each scenario: the Gherkin compiler substitutes parameters in the name of a scenario outline as well as in its steps.\u003C/p>\n\u003Cdiv class=\"wiki-code\" data-language=\"gherkin\">\u003Cdiv class=\"wiki-code__header\">\u003Cspan class=\"wiki-code__language\">gherkin\u003C/span>\u003Cbutton type=\"button\" class=\"wiki-code__copy\" data-wiki-copy data-copied-label=\"Copied\">\u003Csvg class=\"wiki-code__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M216,28H88A12,12,0,0,0,76,40V76H40A12,12,0,0,0,28,88V216a12,12,0,0,0,12,12H168a12,12,0,0,0,12-12V180h36a12,12,0,0,0,12-12V40A12,12,0,0,0,216,28ZM156,204H52V100H156Zm48-48H180V88a12,12,0,0,0-12-12H100V52H204Z\"/>\u003C/svg>\u003Csvg class=\"wiki-code__icon wiki-code__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003Cspan class=\"wiki-code__label\">Copy\u003C/span>\u003Cspan class=\"wiki-code__label wiki-code__label--done\">Copied\u003C/span>\u003C/button>\u003C/div>\u003Cpre>\u003Ccode>Feature: Order discount and delivery\n\n  Rule: Members get 5 percent and Gold members 10 percent; orders from 100.00 and Gold members get free delivery\n\n    Scenario Outline: <rule>\n      Given a customer of type "<customer>"\n      And an order with the total <total>\n      When the customer opens the checkout\n      Then the discount is <discount> percent\n      And the delivery is <delivery>\n\n      Examples:\n        | rule                                      | customer | total  | discount | delivery |\n        | Gold: 10 percent, free delivery           | gold     | 40.00  | 10       | free     |\n        | Member, 100.00 or more: 5 percent, free   | member   | 100.00 | 5        | free     |\n        | Member, below 100.00: 5 percent, paid     | member   | 99.99  | 5        | paid     |\n        | Guest, 100.00 or more: no discount, free  | guest    | 100.00 | 0        | free     |\n        | Guest, below 100.00: no discount, paid    | guest    | 99.99  | 0        | paid     |\u003C/code>\u003C/pre>\u003C/div>\n\u003Cp>The file produces five scenarios with the rule names as titles. Infeasible columns produce no rows. A collapsed column produces one row, and the risk described above applies to it in the same way: a second row with the other value of the irrelevant condition restores the full combination.\u003C/p>\n\u003Ch2 id=\"decision-tables-and-cause-effect-graphing\" class=\"wiki-heading\">Decision tables and cause-effect graphing\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"decision-tables-and-cause-effect-graphing\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h2>\n\u003Cp>\u003Cstrong>Cause-effect graphing\u003C/strong> is a black-box test technique in which test cases are derived from a cause-effect graph. ISO/IEC/IEEE 29119-4 defines the graph as a graphical representation of decision rules that link causes, expressed as Boolean conditions, to effects, expressed as Boolean expressions. Causes and effects are nodes; logical operators connect them, and constraints between causes record that some combinations are impossible.\u003C/p>\n\u003Cp>The technique was described by Myers in The Art of Software Testing; the index of the third edition (2011) lists the graph symbols and constraint symbols, including an exclusive constraint. According to a 2012 survey by Badhera, Purohit and Taruna, cause-effect graphs go back to a 1973 IBM report by W. R. Elmendorf, and Myers gave a procedure that derives a decision table from the graph.\u003C/p>\n\u003Cp>The graph and the table describe the same decision rules. The graph shows how causes combine through intermediate nodes and where the constraints are, which helps when the rule is large. The table lists the resulting combinations column by column, and test cases are taken from it. ISO/IEC/IEEE 29119-4 keeps both as separate techniques with separate coverage measures.\u003C/p>\n\u003Ch2 id=\"limits-of-the-technique\" class=\"wiki-heading\">Limits of the technique\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"limits-of-the-technique\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h2>\n\u003Cp>A decision table describes one decision at one moment. Several situations are outside its scope:\u003C/p>\n\u003Cul>\n\u003Cli>\u003Cstrong>Many conditions.\u003C/strong> The number of columns doubles with each Boolean condition. Beyond a few conditions, collapsing or a risk-based choice of columns is needed, and the coverage of combinations is reduced accordingly.\u003C/li>\n\u003Cli>\u003Cstrong>Many independent parameters.\u003C/strong> When parameters do not form one rule, \u003Ca href=\"/en/wiki/test-design/pairwise-testing\" class=\"wiki-link wiki-link--article\">pairwise testing\u003C/a> reduces the number of combinations instead.\u003C/li>\n\u003Cli>\u003Cstrong>Order and history.\u003C/strong> A table has no notion of a sequence of events. Behavior that depends on the previous state is described by \u003Ca href=\"/en/wiki/test-design/state-transition-testing\" class=\"wiki-link wiki-link--article\">state transition testing\u003C/a>.\u003C/li>\n\u003Cli>\u003Cstrong>Values inside a condition.\u003C/strong> A table checks combinations, not the values inside each condition; their edges come from \u003Cspan class=\"wiki-term\" tabindex=\"0\" data-wiki-term=\"boundary-value\">boundary value\u003C/span> analysis.\u003C/li>\n\u003C/ul>\n\u003Ch2 id=\"decision-tables-and-related-techniques\" class=\"wiki-heading\">Decision tables and related techniques\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"decision-tables-and-related-techniques\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h2>\n\u003Cp>The table compares decision table testing with the techniques it is most often combined or confused with.\u003C/p>\n\u003Cdiv class=\"wiki-table wiki-table--cols-3\">\u003Ctable>\n\u003Cthead>\n\u003Ctr>\n\u003Cth>Technique\u003C/th>\n\u003Cth>Test model\u003C/th>\n\u003Cth>Coverage items\u003C/th>\n\u003C/tr>\n\u003C/thead>\n\u003Ctbody>\n\u003Ctr>\n\u003Ctd>Equivalence partitioning\u003C/td>\n\u003Ctd>Partitions of one data element\u003C/td>\n\u003Ctd>Partitions\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>Decision table testing\u003C/td>\n\u003Ctd>Conditions, actions, rules\u003C/td>\n\u003Ctd>Feasible columns\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>Cause-effect graphing\u003C/td>\n\u003Ctd>Graph of causes, effects and constraints\u003C/td>\n\u003Ctd>Decision rules of the graph\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>Pairwise testing\u003C/td>\n\u003Ctd>Independent parameters and values\u003C/td>\n\u003Ctd>Pairs of values\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>State transition testing\u003C/td>\n\u003Ctd>States, events, transitions\u003C/td>\n\u003Ctd>States or transitions\u003C/td>\n\u003C/tr>\n\u003C/tbody>\n\u003C/table>\u003C/div>\n\u003Cp>\u003Cspan class=\"wiki-term\" tabindex=\"0\" data-wiki-term=\"equivalence-partitioning\">Equivalence partitioning\u003C/span> provides the values of the conditions, and the decision table combines them. Cause-effect graphing reaches the same decision rules from a graph instead of a list.\u003C/p>\n\u003Cp>\u003Cspan class=\"wiki-term\" tabindex=\"0\" data-wiki-term=\"pairwise-testing\">Pairwise testing\u003C/span> and decision tables answer different questions. A decision table assumes that the outcome depends on a known combination of conditions and covers all such combinations. Pairwise testing assumes that the parameters are largely independent and covers only every pair of values.\u003C/p>\n\u003Ch2 id=\"terms\" class=\"wiki-heading\">Terms\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"terms\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h2>\n\u003Cdiv class=\"wiki-table wiki-table--cols-2\">\u003Ctable>\n\u003Cthead>\n\u003Ctr>\n\u003Cth>Term\u003C/th>\n\u003Cth>Meaning\u003C/th>\n\u003C/tr>\n\u003C/thead>\n\u003Ctbody>\n\u003Ctr>\n\u003Ctd>Decision table testing\u003C/td>\n\u003Ctd>Black-box test technique in which test cases are derived from the feasible rules of a decision table\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>Decision table\u003C/td>\n\u003Ctd>Table of conditions, actions and rules that shows which actions follow from each combination of conditions\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>Decision rule\u003C/td>\n\u003Ctd>Column of a decision table: one combination of condition values and the actions that result from it\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>Limited-entry decision table\u003C/td>\n\u003Ctd>Decision table in which all conditions and actions take Boolean values\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>Extended-entry decision table\u003C/td>\n\u003Ctd>Decision table in which some conditions or actions take more than two values, such as partitions\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>Full decision table\u003C/td>\n\u003Ctd>Decision table that contains every combination of condition values\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>Infeasible combination\u003C/td>\n\u003Ctd>Combination of condition values that cannot occur in the system\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>Decision table coverage\u003C/td>\n\u003Ctd>Number of exercised feasible columns divided by the total number of feasible columns, as a percentage\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>Minimized decision table\u003C/td>\n\u003Ctd>Decision table in which columns whose outcome does not depend on some conditions are merged using irrelevant entries\u003C/td>\n\u003C/tr>\n\u003Ctr>\n\u003Ctd>Cause-effect graphing\u003C/td>\n\u003Ctd>Black-box test technique in which test cases are derived from a graph of causes, effects and their constraints\u003C/td>\n\u003C/tr>\n\u003C/tbody>\n\u003C/table>\u003C/div>\n\u003Ch2 id=\"sources\" class=\"wiki-heading\">Sources\u003Cbutton type=\"button\" class=\"wiki-heading__anchor\" data-wiki-anchor=\"sources\" aria-label=\"Copy link to section\" data-copied-label=\"Link to section copied\">\u003Csvg class=\"wiki-heading__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M117.18,188.74a12,12,0,0,1,0,17l-5.12,5.12A58.26,58.26,0,0,1,70.6,228h0A58.62,58.62,0,0,1,29.14,127.92L63.89,93.17a58.64,58.64,0,0,1,98.56,28.11,12,12,0,1,1-23.37,5.44,34.65,34.65,0,0,0-58.22-16.58L46.11,144.89A34.62,34.62,0,0,0,70.57,204h0a34.41,34.41,0,0,0,24.49-10.14l5.11-5.12A12,12,0,0,1,117.18,188.74ZM226.83,45.17a58.65,58.65,0,0,0-82.93,0l-5.11,5.11a12,12,0,0,0,17,17l5.12-5.12a34.63,34.63,0,1,1,49,49L175.1,145.86A34.39,34.39,0,0,1,150.61,156h0a34.63,34.63,0,0,1-33.69-26.72,12,12,0,0,0-23.38,5.44A58.64,58.64,0,0,0,150.56,180h.05a58.28,58.28,0,0,0,41.47-17.17l34.75-34.75a58.62,58.62,0,0,0,0-82.91Z\"/>\u003C/svg>\u003Csvg class=\"wiki-heading__icon wiki-heading__icon--done\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M232.49,80.49l-128,128a12,12,0,0,1-17,0l-56-56a12,12,0,1,1,17-17L96,183,215.51,63.51a12,12,0,0,1,17,17Z\"/>\u003C/svg>\u003C/button>\u003C/h2>\n\u003Cul>\n\u003Cli>\u003Ca href=\"https://www.istqb.org/wp-content/uploads/2024/11/ISTQB_CTFL_Syllabus_v4.0.1.pdf\" target=\"_blank\" rel=\"noopener\" class=\"wiki-link wiki-link--external\">ISTQB Certified Tester Foundation Level Syllabus v4.0.1, section 4.2.3, ISTQB, 2024\u003Csvg class=\"wiki-link__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M228,104a12,12,0,0,1-24,0V69l-59.51,59.51a12,12,0,0,1-17-17L187,52H152a12,12,0,0,1,0-24h64a12,12,0,0,1,12,12Zm-44,24a12,12,0,0,0-12,12v64H52V84h64a12,12,0,0,0,0-24H48A20,20,0,0,0,28,80V208a20,20,0,0,0,20,20H176a20,20,0,0,0,20-20V140A12,12,0,0,0,184,128Z\"/>\u003C/svg>\u003Cspan class=\"wiki-visually-hidden\">(opens in a new tab)\u003C/span>\u003C/a>\u003C/li>\n\u003Cli>\u003Ca href=\"https://glossary.istqb.org/\" target=\"_blank\" rel=\"noopener\" class=\"wiki-link wiki-link--external\">ISTQB Glossary\u003Csvg class=\"wiki-link__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M228,104a12,12,0,0,1-24,0V69l-59.51,59.51a12,12,0,0,1-17-17L187,52H152a12,12,0,0,1,0-24h64a12,12,0,0,1,12,12Zm-44,24a12,12,0,0,0-12,12v64H52V84h64a12,12,0,0,0,0-24H48A20,20,0,0,0,28,80V208a20,20,0,0,0,20,20H176a20,20,0,0,0,20-20V140A12,12,0,0,0,184,128Z\"/>\u003C/svg>\u003Cspan class=\"wiki-visually-hidden\">(opens in a new tab)\u003C/span>\u003C/a>\u003C/li>\n\u003Cli>\u003Ca href=\"https://www.imbus.de/en/glossar/term/decision-table-testing\" target=\"_blank\" rel=\"noopener\" class=\"wiki-link wiki-link--external\">ISTQB Glossary mirror: decision table testing, imbus\u003Csvg class=\"wiki-link__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M228,104a12,12,0,0,1-24,0V69l-59.51,59.51a12,12,0,0,1-17-17L187,52H152a12,12,0,0,1,0-24h64a12,12,0,0,1,12,12Zm-44,24a12,12,0,0,0-12,12v64H52V84h64a12,12,0,0,0,0-24H48A20,20,0,0,0,28,80V208a20,20,0,0,0,20,20H176a20,20,0,0,0,20-20V140A12,12,0,0,0,184,128Z\"/>\u003C/svg>\u003Cspan class=\"wiki-visually-hidden\">(opens in a new tab)\u003C/span>\u003C/a>\u003C/li>\n\u003Cli>\u003Ca href=\"https://www.imbus.de/en/glossar/term/cause-effect-graphing\" target=\"_blank\" rel=\"noopener\" class=\"wiki-link wiki-link--external\">ISTQB Glossary mirror: cause-effect graphing, imbus\u003Csvg class=\"wiki-link__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M228,104a12,12,0,0,1-24,0V69l-59.51,59.51a12,12,0,0,1-17-17L187,52H152a12,12,0,0,1,0-24h64a12,12,0,0,1,12,12Zm-44,24a12,12,0,0,0-12,12v64H52V84h64a12,12,0,0,0,0-24H48A20,20,0,0,0,28,80V208a20,20,0,0,0,20,20H176a20,20,0,0,0,20-20V140A12,12,0,0,0,184,128Z\"/>\u003C/svg>\u003Cspan class=\"wiki-visually-hidden\">(opens in a new tab)\u003C/span>\u003C/a>\u003C/li>\n\u003Cli>\u003Ca href=\"https://www.iso.org/standard/79430.html\" target=\"_blank\" rel=\"noopener\" class=\"wiki-link wiki-link--external\">ISO/IEC/IEEE 29119-4:2021, Software testing, Part 4: Test techniques, ISO\u003Csvg class=\"wiki-link__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M228,104a12,12,0,0,1-24,0V69l-59.51,59.51a12,12,0,0,1-17-17L187,52H152a12,12,0,0,1,0-24h64a12,12,0,0,1,12,12Zm-44,24a12,12,0,0,0-12,12v64H52V84h64a12,12,0,0,0,0-24H48A20,20,0,0,0,28,80V208a20,20,0,0,0,20,20H176a20,20,0,0,0,20-20V140A12,12,0,0,0,184,128Z\"/>\u003C/svg>\u003Cspan class=\"wiki-visually-hidden\">(opens in a new tab)\u003C/span>\u003C/a>\u003C/li>\n\u003Cli>\u003Ca href=\"https://www.oreilly.com/library/view/the-art-of/9781118133156/\" target=\"_blank\" rel=\"noopener\" class=\"wiki-link wiki-link--external\">The Art of Software Testing, 3rd Edition, Glenford J. Myers, Tom Badgett, Corey Sandler, Wiley, 2011\u003Csvg class=\"wiki-link__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M228,104a12,12,0,0,1-24,0V69l-59.51,59.51a12,12,0,0,1-17-17L187,52H152a12,12,0,0,1,0-24h64a12,12,0,0,1,12,12Zm-44,24a12,12,0,0,0-12,12v64H52V84h64a12,12,0,0,0,0-24H48A20,20,0,0,0,28,80V208a20,20,0,0,0,20,20H176a20,20,0,0,0,20-20V140A12,12,0,0,0,184,128Z\"/>\u003C/svg>\u003Cspan class=\"wiki-visually-hidden\">(opens in a new tab)\u003C/span>\u003C/a>\u003C/li>\n\u003Cli>\u003Ca href=\"https://arxiv.org/abs/1202.4836\" target=\"_blank\" rel=\"noopener\" class=\"wiki-link wiki-link--external\">Fault Based Techniques for Testing Boolean Expressions: A Survey, Badhera, Purohit, Taruna, arXiv, 2012\u003Csvg class=\"wiki-link__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M228,104a12,12,0,0,1-24,0V69l-59.51,59.51a12,12,0,0,1-17-17L187,52H152a12,12,0,0,1,0-24h64a12,12,0,0,1,12,12Zm-44,24a12,12,0,0,0-12,12v64H52V84h64a12,12,0,0,0,0-24H48A20,20,0,0,0,28,80V208a20,20,0,0,0,20,20H176a20,20,0,0,0,20-20V140A12,12,0,0,0,184,128Z\"/>\u003C/svg>\u003Cspan class=\"wiki-visually-hidden\">(opens in a new tab)\u003C/span>\u003C/a>\u003C/li>\n\u003Cli>\u003Ca href=\"https://cucumber.io/docs/gherkin/reference/\" target=\"_blank\" rel=\"noopener\" class=\"wiki-link wiki-link--external\">Gherkin reference, Cucumber\u003Csvg class=\"wiki-link__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M228,104a12,12,0,0,1-24,0V69l-59.51,59.51a12,12,0,0,1-17-17L187,52H152a12,12,0,0,1,0-24h64a12,12,0,0,1,12,12Zm-44,24a12,12,0,0,0-12,12v64H52V84h64a12,12,0,0,0,0-24H48A20,20,0,0,0,28,80V208a20,20,0,0,0,20,20H176a20,20,0,0,0,20-20V140A12,12,0,0,0,184,128Z\"/>\u003C/svg>\u003Cspan class=\"wiki-visually-hidden\">(opens in a new tab)\u003C/span>\u003C/a>\u003C/li>\n\u003Cli>\u003Ca href=\"https://github.com/cucumber/gherkin\" target=\"_blank\" rel=\"noopener\" class=\"wiki-link wiki-link--external\">Gherkin parser and pickle compiler, cucumber/gherkin, GitHub\u003Csvg class=\"wiki-link__icon\" viewBox=\"0 0 256 256\" width=\"16\" height=\"16\" fill=\"currentColor\" aria-hidden=\"true\" focusable=\"false\">\u003Cpath d=\"M228,104a12,12,0,0,1-24,0V69l-59.51,59.51a12,12,0,0,1-17-17L187,52H152a12,12,0,0,1,0-24h64a12,12,0,0,1,12,12Zm-44,24a12,12,0,0,0-12,12v64H52V84h64a12,12,0,0,0,0-24H48A20,20,0,0,0,28,80V208a20,20,0,0,0,20,20H176a20,20,0,0,0,20-20V140A12,12,0,0,0,184,128Z\"/>\u003C/svg>\u003Cspan class=\"wiki-visually-hidden\">(opens in a new tab)\u003C/span>\u003C/a>\u003C/li>\n\u003C/ul>\n",[10,14,17,21,24,27,30,33,36,39,42,45,48,51,54,57,60,63,66,69],{"id":11,"level":12,"text":13},"the-problem-decision-tables-solve",2,"The problem decision tables solve",{"id":15,"level":12,"text":16},"structure-of-a-decision-table","Structure of a decision table",{"id":18,"level":19,"text":20},"conditions-and-actions",3,"Conditions and actions",{"id":22,"level":19,"text":23},"rules","Rules",{"id":25,"level":19,"text":26},"notation","Notation",{"id":28,"level":19,"text":29},"limited-entry-and-extended-entry-tables","Limited-entry and extended-entry tables",{"id":31,"level":12,"text":32},"from-the-business-rule-to-the-full-table","From the business rule to the full table",{"id":34,"level":12,"text":35},"impossible-combinations","Impossible combinations",{"id":37,"level":12,"text":38},"decision-table-coverage","Decision table coverage",{"id":40,"level":12,"text":41},"collapsing-a-table","Collapsing a table",{"id":43,"level":19,"text":44},"irrelevant-entries","Irrelevant entries",{"id":46,"level":19,"text":47},"risks-of-collapsing","Risks of collapsing",{"id":49,"level":12,"text":50},"rules-named-by-their-outcome","Rules named by their outcome",{"id":52,"level":12,"text":53},"test-cases-from-the-table","Test cases from the table",{"id":55,"level":12,"text":56},"gherkin-scenarios-from-a-table","Gherkin scenarios from a table",{"id":58,"level":12,"text":59},"decision-tables-and-cause-effect-graphing","Decision tables and cause-effect graphing",{"id":61,"level":12,"text":62},"limits-of-the-technique","Limits of the technique",{"id":64,"level":12,"text":65},"decision-tables-and-related-techniques","Decision tables and related techniques",{"id":67,"level":12,"text":68},"terms","Terms",{"id":70,"level":12,"text":71},"sources","Sources",2639,1793718939610]