In order to build decision tables, what does the analyst not need to do?
A) Eliminate any impossible situations.
B) Simplify the table as much as possible.
C) Determine the minimum size of the table.
D) Eliminate inconsistencies.
C) Determine the minimum size of the table.
You might also like to view...
Describe the order of function execution for base and derived constructor functions and for destructor functions.
What will be an ideal response?
Clients have static IP addresses because their DNS entries must stay consistent.
Answer the following statement true (T) or false (F)
Consider the following database schema. The attributes are ABCDEGHKLM (10 in total). The FDs are:
1. ABE -> CK 2. AB -> D 3. C -> BE 4. EG -> DHK 5. D -> L 6. DL -> EK 7. KL -> DM (a) Compute the attribute closure of EGL with respect to the above set of FDs. Show all steps. (b) Compute the minimal cover of the above set of FDs. Show all steps. (c) Use the 3NF synthesis algorithm to construct a lossless, dependency preserving decomposition of the above schema. Show all steps. (d) Are all the schemas in the resulting decomposition in BCNF? If yes, then you are done. If there are schemas that are not in BCNF, decompose them further to achieve BCNF. Is the resulting decomposition dependency-preserving? Yes/no answers do not count. Explain everything.
HTML files are text files with an .html or .txt extension.
Answer the following statement true (T) or false (F)