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 are different types of authentication techniques that are used in connection strings to connect .net applications with microsoft sql server?

0 Answers  

---

Explain about asp.net caching?

0 Answers  

---

What is a 307 redirect?

0 Answers  

---

How many Directives r in ASP.NET?

8 Answers  

---

what is cross page posting

3 Answers  

---

---

What is difference between masterpage and user control, what is the objective of master page when we had user control in .NET 1.1 version

3 Answers   DELL, Soham,

---

what is wwf in asp.net?

3 Answers  

---

How can u sort strings in array where strings are passed to method as arguments.

3 Answers   CTS, Syncfusion,

---

Will the asp.net validators run in server side or client side? How do you do client-side validation in .net? How to disable validator control by client side javascript?

0 Answers  

---

What are assemblies and namespaces and explain the difference between them ?

0 Answers  

---

What is session handling in a webfarm, how it can work with its limits?

0 Answers   Siebel,

---

Can I tap into other windows livetm services?

0 Answers  

---