Explore topic-wise MCQs in Software Testing (MCQ) questions and answers.

This section includes 11 Mcqs, each offering curated multiple-choice questions to sharpen your Software Testing (MCQ) questions and answers knowledge and support exam preparation. Choose a topic below to get started.

1.

What types of errors are not done by Black-Box Testing and can be uncovered by White-Box Testing?

A. Logic errors
B. Performance errors
C. Behavioral errors
D. None of the above
Answer» B. Performance errors
Discussion
2.

______ is a white-box testing technique first proposed by Tom McCabe.

A. Equivalence Partitioning
B. Basis Path Testing
C. Boundary Value Analysis
D. None of the above.
Answer» C. Boundary Value Analysis
Discussion
3.

Equivalence Partitioning comes under which type of Testing?

A. White Box Testing
B. Black Box Testing
C. Grey Box Testing
D. None of the above
Answer» C. Grey Box Testing
Discussion
4.

Which of the following Review Technique is / are not time bound?

A. Inspection
B. walkthrough
C. Both of These
D. None of These
Answer» C. Both of These
Discussion
5.

Which of the following comes under the Control Structure Testing?

A. Condition testing
B. Loop testing
C. Data Flow Testing
D. All of the above
Answer» E.
Discussion
6.

Which of the following is / are characteristics of testable software?

A. Observability
B. Simplicity
C. Stability
D. All of the above
Answer» E.
Discussion
7.

Which of the following categories, Black-box testing attempts to find errors?

A. Incorrect or missing functions
B. Interface errors
C. Behavior or performance errors
D. All of the above
Answer» E.
Discussion
8.

Black Box Testing is also known as ________ .

A. Behavioral Testing
B. Flow Testing
C. Data Testing
D. None of the above
Answer» B. Flow Testing
Discussion
9.

In a flow graph, node contains a condition and it is characterized by two or more edges emanating from it, is called as ________ .

A. Parent node
B. Two Edge node
C. Predicate node
D. None of the above
Answer» D. None of the above
Discussion
10.

Cyclomatic Complexity is computed as ___________ .

A. The number of regions of the flow graph corresponds to the Cyclomatic Complexity.
B. Cyclomatic Complexity, V(G), for a flow graph, G, is defined as V(G) = E - N + 2 where E is the number of flow graph edges, N is the number of flow graph nodes.
C. Cyclomatic Complexity, V(G), for a flow graph, G, is also defined as V(G) = P + 1 where P is the number of predicate nodes contained in the flow graph G.
D. All of the above.
Answer» E.
Discussion
11.

Which of the following is a software metric that provides a quantitative measure of the logical complexity of a program?

A. Cyclomatic Complexity
B. LOC
C. Function Point
D. None of the above.
Answer» B. LOC
Discussion