ISTQB Exam ATTA Topic 1 Question 102 Discussion

Actual exam question for ISTQB's ATTA exam

Question #: 102
Topic #: 1

[All ATTA Questions]

Which of the following is a valid way to calculate the cyclomatic complexity? 1 credit [K2]

ANumber of decisions + 2

BNumber of enclosed regions - 1

CNumber of statements - 2

DLinks - Nodes + 2

Show Suggested Answer

Suggested Answer: D

by Beckie at Nov 19, 2024, 05:47 PM

Limited Time Offer

25%

Off

Get Premium ATTA Questions as Interactive Web-Based Practice Test or PDF

Contribute your Thoughts:

Submit Cancel

Jennie

4 months ago

Isn't cyclomatic complexity all about the number of independent paths? I'm pretty sure option B is the correct answer here.

upvoted 0 times

Cheryl

4 months ago

I remember learning that it's option D, links - nodes + 2.

upvoted 0 times

...

Kami

4 months ago

I'm not sure, but I think it's option C, number of statements - 2.

upvoted 0 times

...

Tess

4 months ago

But I believe it's actually option A, number of decisions + 2.

upvoted 0 times

...

Chery

4 months ago

I think you're right, option B makes sense.

upvoted 0 times

...

Asha

5 months ago

Option B is the way to go. It's a classic formula that everyone knows. Unless you're trying to confuse the examiner, in which case, well played.

upvoted 0 times

...

Paola

5 months ago

Haha, I bet the person who wrote option C was just trying to be funny. Subtracting 2 statements? That's not how you calculate anything, that's just making things up!

upvoted 0 times

...

Joanna

5 months ago

Option D? Really? That's just nonsense. Links and nodes? What does that even have to do with cyclomatic complexity?

upvoted 0 times

Lamonica

3 months ago

B) Number of enclosed regions - 1 is another valid way to calculate cyclomatic complexity.

upvoted 0 times

...

Lina

3 months ago

Exactly, option D is definitely not the right choice here.

upvoted 0 times

...

Sherman

3 months ago

A) Number of decisions + 2 is the correct way to calculate cyclomatic complexity.

upvoted 0 times

...

Gayla

3 months ago

I agree, option D doesn't make sense for calculating cyclomatic complexity.

upvoted 0 times

...

Chu

3 months ago

D) Links - Nodes + 2

upvoted 0 times

...

Sharika

3 months ago

C) Number of statements - 2

upvoted 0 times

...

Taryn

3 months ago

B) Number of enclosed regions - 1

upvoted 0 times

...

Renato

4 months ago

A) Number of decisions + 2

upvoted 0 times

...

Jeannetta

5 months ago

Hmm, I'm not so sure. I thought it was the number of decisions plus 2. Doesn't that make more sense for calculating the complexity?

upvoted 0 times

Luis

4 months ago

Yeah, that's correct. It's a common way to calculate cyclomatic complexity.

upvoted 0 times

...

Glory

4 months ago

I agree, I think it's A) Number of decisions + 2 as well.

upvoted 0 times

...

Jose

4 months ago

D) Links - Nodes + 2

upvoted 0 times

...

Kati

4 months ago

C) Number of statements - 2

upvoted 0 times

...

Felicidad

4 months ago

B) Number of enclosed regions - 1

upvoted 0 times

...

Daren

4 months ago

A) Number of decisions + 2

upvoted 0 times

...

Johnetta

5 months ago

I'm not sure, but I think A) Number of decisions + 2 makes sense because decisions contribute to the complexity of the code.

upvoted 0 times

...

Carin

5 months ago

I disagree, I believe it's B) Number of enclosed regions - 1 because it accounts for the complexity of the code structure.

upvoted 0 times

...

Louvenia

5 months ago

Option B seems the most logical to me. Cyclomatic complexity is all about the number of independent paths through the code, and that's directly related to the number of enclosed regions.

upvoted 0 times