5 votes 5 votes Consider the following statements about the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE? The cyclomatic complexity of a module is equal to the maximum number of linearly independent circuits in the graph. The cyclomatic complexity of a module is the number of decisions in the module plus one, where a decision is effectively any conditional statement in the module. The cyclomatic complexity can also be used as a number of linearly independent paths that should be tested during path coverage testing. I and II II and III I and III I, II and III IS&Software Engineering gatecse-2009 is&software-engineering cyclomatic-complexity easy + – Kathleen asked Sep 22, 2014 • retagged Nov 13, 2017 by Arjun Kathleen 5.0k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Ishan Jawa commented Apr 4, 2020 reply Follow Share https://books.google.co.in/books?id=M-mhFtxaaskC&pg=PA385&dq=The+cyclomatic+complexity+of+a+module+is+equal+to+the+maximum+number+of+linearly+independent+circuits+in+the+graph.&hl=en&sa=X&ved=0ahUKEwjn8vufws_oAhVkwTgGHfTMCagQuwUILTAA#v=onepage&q=The%20cyclomatic%20complexity%20of%20a%20module%20is%20equal%20to%20the%20maximum%20number%20of%20linearly%20independent%20circuits%20in%20the%20graph.&f=false Please check this link of book software engineering by pankaj jalote it says 1st statement is also true. Kindly check and update the answer. 0 votes 0 votes rsansiya111 commented Dec 16, 2022 reply Follow Share II and III are true statements about the cyclomatic complexity of a control flow graph. 0 votes 0 votes Please log in or register to add a comment.
7 votes 7 votes ans: b) 2 and 3 In 1, it should be "path" and not "circuit". Preeti Verma answered Sep 28, 2014 • edited Dec 24, 2014 by Arjun Preeti Verma comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments Arjun commented Dec 24, 2014 reply Follow Share Sorry. Corrected now :) 1 votes 1 votes sushmita commented Oct 4, 2017 reply Follow Share NOTE: the decision node should have only 2 paths one for yes and one for no to use this formula. 0 votes 0 votes Ishan Jawa commented Apr 5, 2020 reply Follow Share the first statement is also true please check this link of book software engineering by pankaj https://books.google.co.in/books?id=M-mhFtxaaskC&pg=PA385&dq=The+cyclomatic+complexity+of+a+module+is+equal+to+the+maximum+number+of+linearly+independent+circuits+in+the+graph.&hl=en&sa=X&ved=0ahUKEwjU4pKk2NDoAhW8zjgGHS1bBjUQ6AEIJTAA#v=onepage&q=The%20cyclomatic%20complexity%20of%20a%20module%20is%20equal%20to%20the%20maximum%20number%20of%20linearly%20independent%20circuits%20in%20the%20graph.&f=false 0 votes 0 votes Please log in or register to add a comment.
