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

What do you mean by query string?

940

---

Explain the difference between asp and asp.net?

1012

---

Is a dll file an executable?

1033

---

Define static function?

1014

---

What is the difference between sealed vs static class?

1101

---

How to deploy/publish webservices?How many ways?Plz explain me

2289

---

What are the different ways you would consider sending data across pages in ASP (i.e between asp to asp)?

982

---

What is semantic gap?

1029

---

Which method has beenintroduced in asp.net 4.0 to redirect a page permanently?

965

---

How can we secure the data which is send from client side to server? Like the login id and paasword needs to be authenticated on the server but we cannot send it in plain text into the server.One more thing we are not using the SSL here.

1910

---

What is the difference between union and join?

1158

---

when a request is made in Life cycle of ASP.NET page .

962

---

What is Web API Routing?

1174

---

Where would you use an ihttpmodule, and what are the limitations if any?

1019

---

What are the asp.net server side objects?

970

---