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 difference between response.redirect and server.transfer?

0 Answers  

---

What is Pre-Render event in ASP.NET?

0 Answers   MindCracker,

---

Explain the use of duration attribute of @outputcache page directive.

0 Answers  

---

Explain the difference between the web config and machine config.

0 Answers  

---

What are session state modes in asp.net?

0 Answers  

---

How many languages are supported by .NET at present time?

0 Answers  

---

What is cas?

0 Answers  

---

What are the uses of list view control in Asp.net?

0 Answers   HCL,

---

i wand basic interview based questions in asp.net and vb.net

0 Answers   Legio Infotech,

---

What are asp.net web forms?

0 Answers  

---

1. What is the difference between Cache and Session? 2. I cache limited to page like viewstate or it's accessible through out the application like session? 3. Which one is better when I've some data that is to be used across the application? Why is to better than the other?

2 Answers   247Customer,

---

what is narmalization

4 Answers   Wipro,

---