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 cache in asp net?

0 Answers  

---

How many web.config a application can have ?

6 Answers   Keane India Ltd, Manhattan, Vertex,

---

List the major built-in objects in asp.net?

0 Answers  

---

Explain difference betn dataset and recordset?

0 Answers  

---

What is the purpose of App_Code folder in ASP.NET? Why we this?

0 Answers   Sans Pareil IT Services,

---

---

Whats MSIL, and why should my developers need an appreciation of it if at all?

3 Answers   Siebel,

---

What is the main difference between a static page and a dynamic page?

2 Answers  

---

How do you implement Paging in .Net ?

1 Answers  

---

Why is this service branded with windows livetm?

0 Answers  

---

How does the iis work?

0 Answers  

---

What is a Metadata?

3 Answers  

---

What is inheritance and an how it be used, example with an example?

0 Answers   Siebel,

---