| |
|
What is cyclomatic complexity?
Cyclomatic complexity is a metric in computer science that is used to measure the complexity of a computer program. It directly measures the count of the linearly independent paths in the source code. It is calculated by using a graph that depicts the control flow of a program. The nodes in the graph map to the command lines in the program. The stardard equation for cyclomatic complexity is:
CC = E – N + P
Where
CC = Cyclomatic Complexity
E = Number of edges of the graph
N = Number of nodes of the graph
P = Number of connected components
ASP.NET Expression Symbols
Web Service in ASP.NET
Pass data to Web Control
Zipping a folder in ASP.NET
Check user online or offline
Display Dynamic Tooltips
Dynamic Server Side Tables
Capture Gridview Row Index
Improve ASP.NET Performance
Refresh page in another page
Step into DLL Source Code
Insert Non-Ascii Characters in a Database
Contract in WCF
Dependency Injection
Asp.net triggering a Postback
Cyclomatic Complexity
~ Character in ASP.NET
Web Application Project VS. Website Project
Optimistic Locking VS. Pessimistic Locking
System.Net.Mail VS. System.Web.Mail
Breakpoints in debugging
More Interview Questions...
| |