Physics · Computer Science & Software Engineering
e किनारों (edges), n नोड्स (nodes) और p जुड़े हुए घटकों (connected components) वाले प्रोग्राम कंट्रोल ग्राफ 'G' का मैकेबे का साइक्लोमैटिक कॉम्प्लेक्सिटी नंबर किस प्रकार परिभाषित किया जाता है?
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
सही उत्तर देखें
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
Preparing for Physics?
Practice full-length Physics 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