Deal of The Day! Hurry Up, Grab the Special Discount - Save 25% - Ends In 00:00:00 Coupon code: SAVE25
Welcome to Pass4Success

- Free Preparation Discussions
Mail Us support@pass4success.com
Location US
Mob_nav_barsMENU

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]

Show Suggested Answer Hide 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
1 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
8 days ago
I remember learning that it's option D, links - nodes + 2.
upvoted 0 times
...
Kami
9 days ago
I'm not sure, but I think it's option C, number of statements - 2.
upvoted 0 times
...
Tess
11 days ago
But I believe it's actually option A, number of decisions + 2.
upvoted 0 times
...
Chery
15 days ago
I think you're right, option B makes sense.
upvoted 0 times
...
...
Asha
1 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
1 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
1 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
Renato
1 months ago
A) Number of decisions + 2
upvoted 0 times
...
...
Jeannetta
2 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
11 days ago
Yeah, that's correct. It's a common way to calculate cyclomatic complexity.
upvoted 0 times
...
Glory
11 days ago
I agree, I think it's A) Number of decisions + 2 as well.
upvoted 0 times
...
Jose
12 days ago
D) Links - Nodes + 2
upvoted 0 times
...
Kati
14 days ago
C) Number of statements - 2
upvoted 0 times
...
Felicidad
20 days ago
B) Number of enclosed regions - 1
upvoted 0 times
...
Daren
22 days ago
A) Number of decisions + 2
upvoted 0 times
...
...
Johnetta
2 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
2 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
2 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
Detra
28 days ago
I agree with both of you. Option B seems to be the most logical way to calculate cyclomatic complexity.
upvoted 0 times
...
Cecilia
29 days ago
I see where you're coming from, but I believe it's actually based on the number of enclosed regions. So option B is the right choice.
upvoted 0 times
...
Justine
1 months ago
I'm not sure, I thought it was based on the number of decisions in the code. So maybe option A?
upvoted 0 times
...
Rickie
1 months ago
I think option B is correct too. It makes sense when you think about the number of paths through the code.
upvoted 0 times
...
...
Yuki
2 months ago
I think the correct answer is A) Number of decisions + 2.
upvoted 0 times
...

Save Cancel