Skip to main content

Tips to Reach Six Sigma


For the longest time, I was not aware of the intent of six sigma processes. Only recently have I stumbled across that the definition is plus or minus three sigma, like in the classic bell curve.
iso 9000 said…
I read your post . it was amazing.Your thought process is wonderful.The way you tell about things is awesome. They are inspiring and helpful.Thanks for sharing your information and stories.

iso 9000
Win8 said…
I can't wait to read far more from you. This is actually a tremendous web site.
Win8 said…
I can't wait to read far more from you. This is actually a tremendous web site.

Popular posts from this blog

Internet is harmful for you: Google thinks so

Click the image to see it in full size:

Today, for a few minutes Google suddenly started warning all of its indexed sites as Harmful to your computer! Perhaps it was a glitch in their algorithm, but we managed to make a snap of it for the record.

Istqb,cste inforamtions and training centers in India

About istqb:
The ISTQB was officially founded as an International Testing Qualifications Board in Edinburgh in November 2002 and it is responsible for the "ISTQB Certified Tester", which is an international qualification scheme.

ISTQB is the parent body responsible for approving various national boards in addition to other tasks such as defining the syllabi for various certifications.
website url: FAQ :

for examination and preparation and sample question papers available in below link

will be helpful for ISTQB

join yahoo groups:
in this group you can ask your queries about istqb examinations and certification related doubts and sample papers to certified level and advance level question keep on raised by members.

ISTQB-India@ yahoogroups. com

CSTE information:

QAI, India, the premier knowledge corporation in the software engineerin…

Cyclomatic complexity

Cyclomatic complexity is a software metric (measurement). It was developed by Thomas McCabe and is used to measure the complexity of a program. It directly measures the number of linearly independent paths through a program's source code. It is computed using a graph that describes the control flow of the program. The nodes of the graph correspond to the commands of a program. A directed edge connects two nodes if the second command might be executed immediately after the first command.


M = E − N + 2P


M = cyclomatic complexity
E = the number of edges of the graph
N = the number of nodes of the graph
P = the number of connected components.

"M" is alternatively defined to be one larger than the number of decision points (if/case-statements, while-statements, etc) in a module (function, procedure, chart node, etc.), or more generally a system.

Separate subroutines are treated as being independent, disconnected components of the program's control flow graph.