1 pointWhich graph coverage criterion considers writing test cases where all the simple paths of maximal length are visited? Complete path coverage. Simple path coverage. Specified path coverage. Prime path coverage.

Why is complete path coverage considered to be an infeasible structural graph coverage criterion? Complete path coverage could be infeasible if the graph has several disconnected components. Complete path coverage could be infeasible if the graph has strongly connected components or loops. Complete path coverage could be infeasible if the graph has isolated vertices or edges. Complete path coverage could be infeasible as covering all paths in a graph through test cases is not needed.

Formula used to calculate Path coverage isa)Path Coverage = (Number of paths executed / Total number of paths) - 100%b)Path Coverage = (Number of paths executed / Total number of paths) x 100%c)Path Coverage = (Number of paths executed / Total number of paths) / 100%d)Path Coverage = (Number of paths executed / Total number of paths) + 100%

When do we say that a test path 𝑝𝑝 tours a sub-path 𝑞𝑞 with a side-trip?A test path 𝑝𝑝 tours a sub-path 𝑞𝑞 with a side-trip when 𝑝𝑝 is an infeasible test path on its own.A test path 𝑝𝑝 tours a sub-path 𝑞𝑞 with a side-trip when every vertex and every edge in q also occurs in 𝑝𝑝 in the same order.A test path 𝑝𝑝 tours a sub-path 𝑞𝑞 with a side-trip when every vertex in 𝑞𝑞 also occurs in 𝑝𝑝 in the same order.A test path 𝑝𝑝 tours a sub-path 𝑞𝑞 with a side-trip when every edge in 𝑞𝑞 also occurs in 𝑝𝑝 in the same order.

The critical pathIs a path that operates from the starting node to the end nodeIs a mixture of all paths.Is the longest pathIs the shortest path

Boundary testing and Control-flow testing are criteria for ?Question 1Select one:a.Unit Testingb.Test Coveragec.Code Coveraged.None of the above