Physics · Computer Science & Software Engineering
McCabe's cyclomatic complexity number of a program control graph 'G' with e edges, n nodes, and p connected components is defined as:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1V(G) = n - e + p
- 2V(G) = e - n + 2p✓
- 3V(G) = e - n + 2 + p
- 4V(G) = n - e + 2p
Correct answer
V(G) = e - n + 2p
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Physics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Computer Science & Software Engineering MCQs →Want more practice questions on Computer Science & Software Engineering?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Physics · Computer Science & Software Engineering