Answer / sheetal

What is cyclomatic complexity
Cyclomatic complexity is a computer science metric
(measurement) developed by Thomas McCabe used to generally
measure the complexity of a program. It directly measures
the number of linearly independent paths through a programs
source code.
The concept, although not the method, is somewhat similar to
that of general text complexity measured by the
Flesch-Kincaid Readability Test.
Cyclomatic complexity 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. By definition,
CC = E - N + P
where
CC = cyclomatic complexity
E = the number of edges of the graph
N = the number of nodes of the graph
P = the number of connected components

What is inproc mode in session?

0 Answers  

---

What is the use of Administration tool in Asp.net 2.0?

2 Answers  

---

repeater and gridview diff? Why is repeater fast than gridview?

3 Answers   TCS,

---

detail code for sql data connections?

2 Answers  

---

What are ASHX files?

0 Answers   HCL,

---

What is difference in .net 1.1 and .net 2.0?

0 Answers  

---

How do you insert multiple rows from a grid view to database table under a single transaction?

1 Answers  

---

what is webservices. howit is use in our project .

4 Answers   TCS,

---

when using windows API in .net then it is managed code or Unmanaged code?

2 Answers  

---

Why we use asp.net for website development?

0 Answers  

---

What is cross page posting in asp net?

0 Answers  

---

What is the difference between a Thread and Process?

1 Answers  

---