STM mid important questions:
Explain about the decision tables and notation?
Explain about the Boolean algebra and Boolean equations
Write about the KV charts
Define state graph and explain about the state graph elements?
Write a short note on testability tips?
What are the decision tables and structures?
Differentiate between good graph &bad graph?
Define state graph and explain about the state graph elements?
Bits important:
The decision table has adisadvantage of [ ]
a)Insufficient program logic b)Noclarity
c)Implicitrelationtospecification d)Lowlevelmaintainability
No of nodes in state graph is equal to [ ]
a)size of matrix b) No. of rows No of columns
c)Both a and b d) None
In graph matrices, if the link does not exist between nodes, it is represented by[ ]
a) 0 b) 1 c) ᴓ d) null
The building tools of graph matrices does not include[ ]
a)Matrix operations b)Matrix representation
c)Node reduction optimization d) None
Partial ordering relations need not satisfy [ ]
a) Reflexive b) Symmetric
c) Anti Symmetric d) Transitive
In node reduction optimization, when nodes of degree 3 are removed then total links are
[ ]
a)Reduced 1 b)Not changed
c) Increased d) Reduced by 2
The order of grouping in KV charts should be? [ ]
a) Octets,islands,pairs,quads b) Octets, quads, pairs, islands
c) quads, pairs, islands, Octets d) islands, pairs, quads, Octets
The list of names of conditions is known as[ ]
a)Condition Stub b) Condition Entry
c)Action Entryd)Action stub
Which among the following is true for predicate values [ ]
a)They are not restricted to binary truth values
b) They are restricted to binary truth values in logic based testing
c) Both a and b
d) None
Two successive path segments is expressed by concatenation is known as[ ]
a)Path product b)Path sum
c)Path d)Path Expression
The weight expression of series path of A and B in lower path count [ ] arithmetic is
a)WA + WB b) WA
c)Max(WA , WB ) d) Min(WA , WB )
Which among the following is not a complementary operation[ ]
a)PUSH/POP b) START/STOP
c) OPEN/CLOSE d) None
The main goal of reduction process is[ ]
a)To reduce nodes b) To retain only entry and exit nodes
c) Remain with single node d) Remove loops
The main step in achieving the node reduction is [ ]
a)parallel term b) Serial term
c) Loop term d) Cross Term
Two successive path segments is expressed by concatenation is known as
[ ]
a)Path product b)Path sum
c)Path d)Path Expression
The first steps in node reduction is [ ]
a)Combine all parallel links b) Combine all Serial links
c)Remove self loops d)Remove the node
ABC+BCD+CDE+EFG is in the form of [ ]
a)Sum of products b) Product of additions
c) Reduction of sums d) Product of sums
The first step in reducing Boolean expression is [ ]
a)Replace identical terms b) Remove parenthesis
c) The term containing a variable and its compliment is removed d) None
The order of grouping in KV charts should be [ ]
a) Octets,islands,pairs,quads b) Octets, quads, pairs, islands
c) quads, pairs, islands, Octets d) islands, pairs, quads, Octets
Partial ordering relations need not satisfy [ ]
a) Reflexive b) Symmetric
c) Anti Symmetric d) Transitive
The logic in the simplest form is ___________
_____gathers knowledge from knowledge repository or domain such as
Engineering law into Database
________is the table which consists of set of conditions and corresponding
action
The decision tables are used for test case design when decision table act as
_________
The entries which do not play any role in decision table are known as________
The translator will convert decision table into _______
The representation of state graph in the form of table is known as_______
Every input condition of state graph is specified in_______ in state tables
The bugs that occur due to dead states are known as_________
The automated tools used for regression testing are _______________
ABCD+ABC+AB+A can be reduces to_______________
____________is the one which covers min terms or max terms
The decision tables are used for test case design when decision table act as_____________
The entries which do not play any role in decision table are known as ________________
The translator will convert decision table into_____________
The consistency and completeness of the decision table can be done by expanding tables
of___________________
AB+AC=_________________
The logic in the simplest form is___________
_________gathers knowledge from knowledge repository or domain such as Engineering law
into Database.
____________is the table which consists of set of conditions and corresponding action
