Scraps from various sources and my own writings on Generative AI, AGI, Digital, Disruption, Agile, Scrum, Kanban, Scaled Agile, XP, TDD, FDD, DevOps, Design Thinking, etc.
Page Hits
Tuesday, April 16, 2019
Monday, April 15, 2019
POC vs. Prototype vs. MVP - Zignuts.com
- POC: Identifies the Operational feasibility of the concept. It can either confirm or infirm your thought about the user and your application.
- Prototype: Helps you to visualize the actual design and flow of your idea or system., that is the actual blueprint of the idea.
- MVP: Helps you recognize the core value of your system. It is that version which you can launch into the market to gain valuable product insights from users.
Thursday, April 11, 2019
Cyclomatic Complexity Calculation - with example
Source: Softwaretestingclass.com, Wikipedia, Guru99.com
Keywords: Cyclomatic complexity, Graph Theory
Keywords: Cyclomatic complexity, Graph Theory
Cyclomatic complexity of a source code is the number of linearly independent paths within it.
Cyclomatic complexity is a way to calculate the complexity of a code. It quantifies the complexity for future source code modifications.
If the source code does not have any control flow statements (For e.g. If, Else, While, Do, For loops in C) then its cyclomatic complexity is 1. A source code with a single IF condition will have two paths through the code so its cyclomatic complexity will be 2. Likewise a code with one IF with two conditions or two nested IF conditions will have a code complexity of 3.
Formula for cyclomatic complexity
M = E - N + 2 * P
Cyclomatic complexity is a way to calculate the complexity of a code. It quantifies the complexity for future source code modifications.
If the source code does not have any control flow statements (For e.g. If, Else, While, Do, For loops in C) then its cyclomatic complexity is 1. A source code with a single IF condition will have two paths through the code so its cyclomatic complexity will be 2. Likewise a code with one IF with two conditions or two nested IF conditions will have a code complexity of 3.
Formula for cyclomatic complexity
M = E - N + 2 * P
E = Number of edges in control flow graph
N = Number of nodes in control flow graph
P = Number of connected components
Complexity Score and Interpretation
=====================
Maintenance POV
==========
A higher complexity score means lower maintainability.
QC POV
=====
From a QC perspective, a higher complexity score means, it requires indepth testing.
Node & Edge
=======
Connected component
=============
A graph with 3 connected component.
Example
=====
N = Number of nodes in control flow graph
P = Number of connected components
Complexity Score and Interpretation
=====================
Maintenance POV
==========
A higher complexity score means lower maintainability.
QC POV
=====
From a QC perspective, a higher complexity score means, it requires indepth testing.
Node & Edge
=======
Connected component
=============
A graph with 3 connected component.
Example
=====
Nodes = 8
Edges = 9
CC = E - N + 2 * P
      = 9 - 8 + 2 * 1 (connected component) = 2
Tuesday, April 09, 2019
Lipstick Agile and other terms
- Lipstick Agile: Agile for namesake
- Instagram Agile: Agile for Style, for eyeball count, and to build an online profile for the next gig.
Subscribe to:
Comments (Atom)
If we already have automation, what's the need for Agents?
“Automation” and “agent” sound similar — but they solve very different classes of problems. Automation = Fixed Instruction → Fixed Outcome ...
- 
Requirements Analysis -- Business requirements document or business requirements specification System Design -- Systems requireme...

 
 





 
