Answer / rasmi ranjan das

A back-propagation neural network is only practical in
certain situations. Following are some guidelines on when
you should use another approach:

Can you write down a flow chart or a formula that
accurately describes the problem? If so, then stick with a
traditional programming method.
Is there a simple piece of hardware or software that
already does what you want? If so, then the development
time for a NN might not be worth it.
Do you want the functionality to "evolve" in a direction
that is not pre-defined? If so, then consider using a
Genetic Algorithm (that's another topic!).
Do you have an easy way to generate a significant number of
input/output examples of the desired behavior? If not, then
you won't be able to train your NN to do anything.
Is the problem is very "discrete"? Can the correct answer
can be found in a look-up table of reasonable size? A look-
up table is much simpler and more accurate.
Are precise numeric output values required? NN's are not
good at giving precise numeric answers.
Conversely, here are some situations where a BP NN might be
a good idea:

A large amount of input/output data is available, but
you're not sure how to relate it to the output.
The problem appears to have overwhelming complexity, but
there is clearly a solution.
It is easy to create a number of examples of the correct
behavior.
The solution to the problem may change over time, within
the bounds of the given input and output parameters (i.e.,
today 2+2=4, but in the future we may find that 2+2=3.8).
Outputs can be "fuzzy", or non-numeric.

Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.

0 Answers   Aspiring Minds,

---

Draw a flowchart to find the average of four number?

0 Answers  

---

Can you pick an algorithm. Write the psuedo-code for a parallel implementation?

0 Answers  

---

What is the most efficient way to store 1 million phone numbers memory-wise?

0 Answers   Aspire, Infogain,

---

What is informed (heuristic) search strategies algorithm?

0 Answers  

---

How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?

0 Answers  

---

Why size of integer depends on the machine architecture then what the best sorting algorithm and why?

0 Answers   HPCL, Hughes Systique Corporation,

---

Consider the following algorithm: for ( i = 2 ; i <= n ; i++) { for ( j = 0 ; j <= n) { cout << i << j ; j = j + floor(n/4) ; } } (a) What is the output when n = 4 (b) What is the time complexity T(n). You may assume that n is divisible 4.

0 Answers  

---

What is the uniform cost search algorithm?

0 Answers  

---

List the different algorithm techniques in machine learning?

0 Answers  

---

what are the minimum requirements for statr testing?

0 Answers   QA,

---

What is the iterative deepening depth-first search algorithm?

0 Answers  

---