April 9, 2009
Here are the questions that I asked at the last class:
- Give an example of a prime path.
- Exhibit a case where a clause always determines a predicate.
- Exhibit a case where a clause never determines a predicate.
- Why is ECC analogous to CC?
- Give an example of best-effort touring.
- Why might GACC be infeasible?
- What causes node coverage to be infeasible?
- Why does strong mutation always imply weak mutation?
- How do you generate tests from mutants?
- What is the most important part of a bug report? Why?
- How can you show that two criteria are equivalent?
- Name 3 criteria from different coverage types.
- Give an example where CoC does not subsume GACC.
- Give an example of a du-path.
- What's hard about generating test cases for logic coverage?
- When is PC != EC?
- Why does RACC subsume CACC?
- What are the minimal graph, logic and input-based coverage criteria?
- Show me a test requirement for SRTC and explain why it's not a test path.
- Which Java statements are defs?
- Which Java statements are uses?
- What is the difference between a du-path and a du-pair?
- Where do regression tests come from?
- Which coverage criteria is ideal for capturing use case scenarios?
- What is the relationship between def-pairs and def-paths?
- Give an interface-based IDM for a
Tree method parameter.
- Find a broken OO mutation operator.
- Demonstrate a concurrency problem.
- Carry out a determination analysis for
a in a && (b -> c).
- Why does higher coverage not imply more defects found?
- What's an example of a case where a prime path is infeasible
but subpaths of it are feasible?
- Give an example of a fault that prime path coverage would not detect.
- What's the implication of short-circuit evaluation on active-clause coverage?
- Give a test set where we achieve Complete Path Coverage in the presence
of an OO hierarchy.
