MENU
Which of the following is a valid way to calculate the cyclomatic complexity? 1 credit [K2]
Suggested Answer: D
Get Premium ATTA Questions
as Interactive Web-Based Practice Test or PDF
Real Exam Format
Detailed Explanations
Instant Access
Get Your Practice Test
30 comments · newest first
SI
Silva
10 months ago
I had no idea there were so many ways to calculate this!
VI
Vi
10 months ago
Totally agree with D, it's the most accurate method!
GO
Goldie
10 months ago
A is the classic formula for cyclomatic complexity.
EL
Elli
10 months ago
Wait, is B even a thing? Sounds off.
AB
Abel
11 months ago
I think it's definitely D, right?
HE
Herschel
11 months ago
I don't think it's about the number of statements. That doesn't seem right to me, but I can't remember the exact formula.
PE
Pearlene
11 months ago
I feel like I saw something about enclosed regions in my notes, but I can't recall if it was minus 1 or plus something.
PH
Phil
11 months ago
I remember practicing a question where we had to use the formula with links and nodes. I think option D sounds familiar.
ER
Erasmo
12 months ago
I think cyclomatic complexity is calculated using the number of decisions, but I'm not sure if it's plus 2 or something else.
SI
Simona
12 months ago
I'm a bit confused by this question. I know cyclomatic complexity is important, but I can't remember the exact formula off the top of my head. I'll have to review my notes and try to reason through the options to figure out the right answer.
KE
Kenneth
12 months ago
Okay, let me think this through step-by-step. Cyclomatic complexity is a measure of the number of independent paths through the code, right? So the formula should be something related to the control flow structures. I'm going to go with option B, since that seems to match the concept of enclosed regions.
LA
Laquita
1 year ago
Hmm, I'm a bit unsure about this one. I know cyclomatic complexity has to do with the control flow of the code, but I can't quite recall the exact formula. I'll have to think this through carefully.
CE
Celestina
1 year ago
This seems like a straightforward question on cyclomatic complexity. I think I remember the formula being something like number of decisions plus 2, so I'll go with option A.
TO
Tomoko
1 year ago
Wait, there's no option for 'all of the above'? I'm feeling a bit cheated here.
GI
Gilma
1 year ago
D, all the way! Linking and nodding my way to success.
MA
Marjory
1 year ago
B) Number of enclosed regions - 1
LU
Luann
1 year ago
A) Number of decisions + 2
LU
Luz
1 year ago
That makes sense, decisions in the code determine the complexity of different paths that can be taken.
AS
Ashley
1 year ago
I've heard that the correct way to calculate cyclomatic complexity is by counting the number of decisions in the code.
JE
Jennifer
1 year ago
I'm feeling option A on this one. Who doesn't love a good decision-making process?
KR
Krystal
1 year ago
I'm not sure, I think it might be option B instead.
CO
Cory
1 year ago
I agree, calculating based on the number of decisions makes sense.
MA
Malcolm
1 year ago
I think option A is the way to go.
CI
Ciara
1 year ago
I'm not sure, but I think it might be D) Links - Nodes + 2.
MI
Mila
1 year ago
Option B seems like the way to go. Gotta keep those enclosed regions in check, am I right?
PA
Patria
1 year ago
C) Number of statements - 2
DE
Deonna
1 year ago
B) Number of enclosed regions - 1
LU
Ludivina
1 year ago
A) Number of decisions + 2
LU
Luz
1 year ago
I disagree, I believe it's B) Number of enclosed regions - 1.
AS
Ashley
1 year ago
I think the answer is A) Number of decisions + 2.