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 does session_start () do?

0 Answers  

---

Disable browser cache for entire ASP.NET website?

0 Answers   HCL,

---

What is State Management in .Net and how many ways are there to maintain a state in .Net?

6 Answers  

---

How To Generate ConnectionString By Using Notepad??

2 Answers  

---

How to send a DataReader as a parameter to a remote client ?

0 Answers   Digital GlobalSoft,

---

Explain a program using razor view engine to create a simple application? : asp.net mvc

0 Answers  

---

How To Authenticate Your Web service??

1 Answers  

---

Suppose you want a certain ASP.NET function executed on MouseOver overa certain button. Where do you add an event handler?

3 Answers   Visual Soft,

---

Difference between mvc2 and mvc3 in asp.net?

4 Answers   Wipro,

---

Explain one critical mapping?

0 Answers  

---

Can you please anyone explain in detailed Webservices concepts in Asp.net?

1 Answers  

---

How can we identify that the Page is Post Back?

0 Answers  

---