How is Cyclomatic Complexity V(G) computed for a control flow graph with E edges, N nodes, and P connected components?
McCabe's Cyclomatic Complexity formula is V(G) = E - N + 2P (or Predicate Nodes + 1).
Which data structure is naturally used to implement Breadth-First Search (BFS) in a graph?
BFS uses a FIFO Queue to visit all neighbor nodes at the current depth level before moving deeper.
Which testing methodology focuses on verifying internal program logic, control structures, and code paths?
White Box testing (Glass box) inspects internal code structures, branch paths, and condition statements.
What unit of measure does the COCOMO model output to express estimated software development labor effort?
COCOMO estimates effort = a * $(KLOC)^b$ in units of Person-Months (PM).
Which software development model combines iterative development with systematic risk analysis and management?
Barry Boehm's Spiral Model structures development in repeating quadrants with explicit risk evaluation phases.