search
Log In
5 votes
2.6k views

A rule in a limited entry decision table is a

  1. row of the table consisting of condition entries
  2. row of the table consisting of action entries
  3. column of the table consisting of condition entries and the corresponding action entries
  4. columns of the table consisting of conditions of the stub
in Algorithms
edited by
2.6k views

2 Answers

8 votes

Answer is C : Column of the table consisting of condition entries and corresponding action entries

A decision table is an excellent tool to use in both testing and requirements management. Essentially it is a structured exercise to formulate requirements when dealing with complex business rules. Decision tables are used to model complicated logic.

Can look at it for more depth : https://en.wikipedia.org/wiki/Decision_table

2 votes

Here is an example from wiki.

Answer:

Related questions

11 votes
3 answers
1
3.5k views
Djikstra’s algorithm is used to Create LSAs Flood an internet with information Calculate the routing tables Create a link state database
asked Jun 10, 2016 in Algorithms jothee 3.5k views
8 votes
3 answers
2
6.1k views
The time taken by binary search algorithm to search a key in a sorted array of $n$ elements is $O\: (\log_2 \: n)$ $O \: (n)$ $O \: (n \: \log_2 \: n)$ $O \: (n^2)$
asked Jun 10, 2016 in Algorithms jothee 6.1k views
7 votes
2 answers
3
1.5k views
The average case and worst case complexities for Merge sort algorithm are $O \: (n^2), O\: (n^2)$ $O \: (n^2), O\: (n \log_2 n)$ $ O\: (n \log_2 n), O \: (n^2)$ $ O\: (n \log_2 n), O\: (n \log_2 n)$
asked Jun 10, 2016 in Algorithms jothee 1.5k views
6 votes
3 answers
4
3.5k views
Selection sort algorithm design technique is an example of Greedy method Divide-and-conquer Dynamic Programming Backtracking
asked Jun 10, 2016 in Algorithms jothee 3.5k views
...