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 the advantage of mvc over asp.net? : Asp.Net MVC

0 Answers  

---

Is asp.net a programming language or framework?

0 Answers  

---

What is difference between datalist and gridview?

0 Answers  

---

Are there resources online with tips on asp to asp.net conversions?

0 Answers  

---

What is advantage of asp.net?

0 Answers  

---

Explain the features that make asp.net more used framework? : asp.net mvc

0 Answers  

---

What is viewstate in asp net with example?

0 Answers  

---

witch is the best insistute in sharpoint course.what abt future of share point course.

2 Answers  

---

What’s the use of “GLOBAL.ASAX” file?

0 Answers  

---

Is asp.net 64-bit enabled? How?

0 Answers  

---

Where can we set the specific variables for a application and Session objects ?

2 Answers   Siebel,

---

what is loosely coupled solution? How it can be used?

0 Answers   Siebel,

---