ISTQB CTAL-TTA Exam With Confidence Using Practice Dumps

Statements about Maintainability Testing:

A. It should start as soon as the draft design documents are available for review.

True. Maintainability testing can begin early in the development lifecycle, starting with reviews of design documents to ensure that maintainability concerns are addressed from the outset.

B. An application can be considered maintainable when static analysis and code review defects have been fixed.

False. While fixing defects identified by static analysis and code reviews improves maintainability, other factors such as documentation, ease of making changes, and regression testing must also be considered.

C. It tests the regression impact of software or environmental changes to an operational system.

False. This describes regression testing more than maintainability testing, which focuses on the ease of modifying the system and maintaining its performance.

D. It can be performed during Operational Acceptance Testing by multiple departments.

True. Maintainability testing can be part of operational acceptance testing (OAT), where different departments ensure that the system can be maintained and operated effectively.

E. It can be performed during User Acceptance Testing to ensure business processes can be maintained.

False. User acceptance testing (UAT) focuses on verifying that the system meets business requirements and user needs, not specifically on maintainability.

Correct Answer:

B. a and d

References:

The ISTQB CTAL-TTA syllabus and standard testing practices emphasize the importance of maintainability testing early in the lifecycle and its role in operational acceptance testing.

Sources:

ISTQB-CTAL-TTA Syllabus

General knowledge on maintainability testing practices.

In the data flow analysis of the pseudocode, the variable output presents a potential anomaly. Initially, output is set to input1, but it may be overwritten if input2 is greater. The anomaly, specifically a 'definition-use' (du-path) issue, arises because there might be scenarios where output does not adequately reflect changes depending on the dynamic data flow influenced by the conditional. Proper testing and validation of such conditional structures are crucial to ensure that output consistently represents the largest of the two inputs as intended.

Cyclomatic complexity is a measure of the number of linearly-independent paths through a program's source code, which is often used as a measure of the complexity of a program. The control flow graph provided represents the logic of a software component and has more than 5 nodes with decision points, indicating that the complexity would exceed the maximum allowed value of 5. The calculation for cyclomatic complexity is V(G) = E - N + 2P, where E is the number of edges, N is the number of nodes, and P is the number of connected components. In this case, the calculated cyclomatic complexity exceeds the allowed threshold, thus a defect should be reported.