Assignment

Software Testing
------o0o------
Assignment No 05: Testing Techniques

1. Form: Group discussion, group work.

2. Duration: 75 mins.
3. Results: DOC/DOCX file.
4. Requirements:
Compose a Word document about Whitebox Testing and Blackbox Testing,
with the following reccommended ideas (Soạn 1 tập tin word trình bày về
kiểm thử hộp trắng. Các nội dung gợi ý như sau):
 Definition.
 Objective / usage
 When to apply?
 At which stage the technique can be applied?
 Who are the performers?
 What are test coverage levels?
Coverage: is the ratio of components actually tested to the population
after testing the selected test cases. The larger the coverage, the
higher the reliability.
Coverage level 0: test what is testable, the rest for users to detect and
report back later.
Coverage level 1: test that each instruction is executed at least once.
Coverage level 2: testing such that each logical decision point is
executed at least once for both TRUE and FALSE. We call this level of
testing branch coverage.
Coverage level 3: test such that each subcondition of each decision
point is implemented at least 1 time for both TRUE and FALSE. We call
this level of testing is subcondition coverage. Covering subcondition are
not guaranteed to cover branches & vice versa.
Coverage level 4: test such that each subcondition of each decision
point is implemented at least 1 time for both TRUE and FALSE &
 decision score as well Tested for both TRUE and FALSE branches. We
call the control level This test is to overlay branch & subcondition
coverage.
 Explain about control flow graphs and how to draw them from code.
- A control flow graph (CFG) in computer science is a representation,
using graph notation, of all paths that might be traversed through a
program during its execution.
- How to draw
1. Any statement will be a node in graph
2. All nodes have a directed edge either coming to them or going
out of them or both. Entry node (first statement) has only
outgoing edges and Exit node has only incoming edges.
3. only conditional statements like if/else if, switch, loops would
have more than one outgoing edges.
4. All paths coming out of a node will converge at some point, in
worst case they converge on Exit.
- Consists of two types of components: nodes and arcs connecting
them.
- Types of nodes in the control flow graph:

- Control flow structures:

  Special notes one should pay attention while applying the technique.
 Show the colleration (similarity / difference) with static and dynamic
testing.
 Popular tools or software used with the technique.

5. References and materials:

[1] Lecture: Blackbox Testing
[2] Lecture: Whitebox Testing
[3] Materials and links on FHQLMS.
[4] Other Internet and wiki resources.