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 data types do the RangeValidator control support?

2 Answers   Siebel Systems,

---

What property must you set, and what method must you call in your code, in order to bind the data from a data source to the Repeater control?

1 Answers   Siebel,

---

Describe the difference between inline and code behind - which is best in a loosely coupled solution Tightly coupled - INLINE

2 Answers  

---

How do we access view state value of this page in the next page?

0 Answers   MindCracker,

---

How to remove themes from certain controls?

2 Answers  

---

Where sessions are stored in asp.net?

0 Answers  

---

When during the page processing cycle is ViewState available?

1 Answers   Siebel Systems,

---

Can you change a master page dynamically at runtime? How?

0 Answers  

---

To load your generated dataset with data which method do you invoke?

0 Answers   Siebel,

---

Can you explain autopostback?

0 Answers  

---

Is a dll file an executable?

0 Answers  

---

Which is the best institute in Hyderabad/Secunderabad/Andhra Pradesh to learn DotNet?

0 Answers  

---