ISRO2014-4

Question

Consider the following pseudo- code

while (m<n)
    if (x>y ) and (a<b) then
        a=a+1
        y=y-1
    end if
m=m+1 end while

What is cyclomatic complexity of the above pseudo -code?

• A. 2
• B. 3
• C. 4
• D. 5

Comments

8 - 6 + 2 = 4

---

Thank u i got it

---

@Satbir

Any idea about the equivalent C code?

Answer 1

Cyclomatic complexity will be 8 - 6 +2 = 4

Comments

Before seeing this question- answer, I still believe there is only one way to escape the loop (without break condition or OS preemption) i.e the falsity of loop condition check , Can anyone please explain me how this edge (?) is opened here, Since official ans is also 4 , but I am getting 3 with my approach.

Thanks in advance !!!

 

---

@dr_Jackal Even I'm getting 3 as answer. This solution is clearly wrong. There won't be any edge between last to nodes. Also last node won't be "end while". "end while" must be in last second node. Here they gave just "if'-then" statement not "if-then-else" statement. So in the diagram there is an extra node. 

---

This seems to be a favorite question of ISRO.

Answer 2

Answer is (B) part.

Comments

which answer is right ... 3 or 4 ?

Answer 3

Cyclomatic complexity = no of predicate nodes +1

=3+1

One for while,  two for if bcoz of two conditions as if first condition then if second condition then do given. 

Comments

Can you draw the control flow graph.

---

\

check that