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 dllhell? why we use the dllhell?

4 Answers  

---

what are configuration files?

0 Answers  

---

How do you do exception management

1 Answers   Infosys,

---

What are the different ways of processing data in ASP page in the server side (like Forms, QueryStrings etc)?

1 Answers  

---

What is the use of session in web application?

0 Answers  

---

What is wrong with a line like this? DateTime.Parse(myString)

5 Answers   Metasys,

---

What is difference between URL and URI?

0 Answers   MCN Solutions,

---

What methods are fired during the page load?

3 Answers  

---

Why would anyone need to implement their own hashtable or linked list?

0 Answers  

---

Clearly Explain the ispostback

6 Answers   TCS,

---

Types of state management techniques ?

6 Answers   Digital GlobalSoft,

---

What is the biggest disadvantage of “Other Return Types” in Web API?

0 Answers  

---