Testing The QA Knowledge
Settings
There are a whole lot of questions that go on in somebody's head. Take a shot at this quiz, which will help you determine your IQ, your QA knowledge. Best luck.
- 1.Executing the same test case by giving the number of inputs on same build called as
- A.
Test Matrix
- B.
Checklist
- C.
Test bed
- D.
Traceablity Matrix
- 2.To check whether we are developing the right product according to the customer requirements are not. It is a static process
- A.
Validation
- B.
Verification
- C.
Quality Assurance
- D.
Quality Control
- 3.The cyclomatic complexity metric provides the designer with information regarding the number of
- A.
Cycles in the program
- B.
Errors in the program
- C.
Independent logic paths in the program
- D.
Statements in the program
- 4.To test a function: the programmer has to write a _________, which calls the function to be tested and passes it test data
- A.
Stub
- B.
Driver
- C.
Proxy
- D.
None of the above
- 5.Which of these can be successfully tested using Loop Testing methodology?
- A.
Simple Loops
- B.
Nested loops
- C.
Concatenated Loops
- D.
All Of The Above
- 6.Cyclomatic Complexity method comes under which testing method.
- A.
White Box Testing
- B.
Black Box Testing
- C.
Green Box Testing
- D.
Yellow Box Testing
- 7.Equivalence partitioning is:
- A.
A black box testing technique used only by developers
- B.
A black box testing technique than can only be used during system testing
- C.
A black box testing technique appropriate to all levels of testing
- D.
A white box testing technique appropriate for component testing
- 8.An input field takes the year of birth between 1900 and 2004.The boundary values for testing this field are:
- A.
0,1900,2004,2005
- B.
1900,2004
- C.
1899,1900,2004,2005
- D.
1899, 1900, 1901,2003,2004,2005
- 9.Fault Masking is
- A.
Error condition hiding another error condition
- B.
Creating a test case which does not reveal a fault
- C.
Masking a fault by developer
- D.
Masking a fault by a tester
- 10.How many test cases are necessary to cover all the possible sequences of statements (paths) for the following program fragment? Assume that the two conditions are independent of each other : - ………… if (Condition 1) then statement 1 else statement 2 fi if (Condition 2) then statement 3 fi …………
- A.
2 Test Cases
- B.
3 Test cases
- C.
4 Test Cases
- D.
Not Achievable
Back to top