Answer Posted / 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

Why is an object pool required?

974

---

I have an external link in my application say www.xyztest.com. Today this site works on http protocal. Tommorow it may run on https. So i cant hardcore the protocal in the site. When a user clicks on the link how can i know if the external site works on http or https and takes him to that place?

1851

---

What is application session?

892

---

What is considered a service provider?

899

---

What is the benefit of WebAPI over WCF?

952

---

How do I open an ashx file in windows 7?

1004

---

What are main return types supported in Web API?

1321

---

What are session state modes in asp.net?

947

---

Give me one example of Web API Routing?

1018

---

What is the use of session state and application state and difference between them?

862

---

What is the use of response redirect in asp.net?

1002

---

Why asp.net is used?

975

---

What is the life-span of the items in the viewstate?

897

---

Explain how viewstate is being formed?

921

---

What is the main difference between Asp.net and Vb.net?

1000

---