CTAL-TTA Exam Dumps : Certified Tester Advanced Level Technical Test Analyst

Analysis:

To determine the correct keyword-driven input table for testing the enhancement to the social media application, we need to ensure the table adequately covers the following scenarios:

Adding existing members to a group.

Attempting to add non-existing members to a group and handling the error.

Removing members from a group.

Deleting groups only if no members are attached.

A. (Image A) - Assuming Image A correctly represents these scenarios.

Adding Members: The table should include steps to add both valid (existing) and invalid (non-existing) members to a group, ensuring the application correctly handles both scenarios.

Removing Members: The table should include steps to remove members from a group.

Deleting Groups: The table should include a scenario where a group with no members is deleted successfully.

References:

The ISTQB CTAL-TTA syllabus and standard keyword-driven testing practices emphasize the importance of comprehensive test coverage for new enhancements.

Sources:

ISTQB-CTAL-TTA Syllabus

General knowledge on keyword-driven testing.

When users complain about issues with links on a website, the most appropriate test tool to identify the causes of these failures is a hyperlink tool (answer B). Hyperlink tools are specifically designed to check the validity of links on web pages. They can automatically identify broken or dead links, which is essential for maintaining the quality and user experience of a website. Review tools, static analysis tools, and dynamic analysis tools do not primarily focus on hyperlink verification.

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.