what is the difference between a looping statement and a
decision statement
Answers were Sorted based on User's Feedback
Answer / guest
looping statement will be executed repeatedaly until the
condition becomes false.
Decision statment have only one entry point but must have
two exit points since the answer to the question can be
either a "YES" or a "NO".
| Is This Answer Correct ? | 90 Yes | 8 No |
Answer / ankit guha
the main difference between looping statement and decision making statement is that in loop the statement execute several times until the condition would not get false whereas in decision the statement execute either one or not execute on the basis of the condition provided.
| Is This Answer Correct ? | 25 Yes | 6 No |
Answer / vignesh1988i
looping statement :
this can rotate to a specific number of times upto
the termination condition given ......
here we can conclude many decisions by further adding
statements using some decisions control statement....
for eg :
for(int i=0;i<5;i++)
{
if(i%2==0)
{
printf("winner ");
if(i)
printf("looser ");
}
else
{
printf("intelligent ");
if(i)
printf("big idiot");
}
}
here using both looping and conditions structures we there
by get different by varying the values of 'i'.
decision statement:
in these statements we must take only one decision at a
time....... multiple desions not possible... the decisions
can be nested ..... but no 2 or more decisions possible at a
time.....
eg: if-else,switch
thank you
| Is This Answer Correct ? | 24 Yes | 20 No |
Answer / paravati
Distinguish between decision making and looping statements ?
| Is This Answer Correct ? | 0 Yes | 0 No |
WHat is execution in manual testing and when will we start execution and what language we use in execution
Define Form modules, Class modules and Standard modules
How to call static method in Java?
In Bioinformatics, a DNA sequence is made up of a combination of 4 characters, namely “A,C,G,T”. A subsequence of a given sequence of characters a0, a1, …an- 1, is any subset of the characters taken in order, of the form ai0 , ai1 ,…..aik-1 where 0 ≤ i0 <i1….< ik-1 ≤ n-1. For example in the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, we can have subsequences “A,G,T”, “A,C,A,A” and many more. A subsequence is palindromic if it is the same whether read left to right or right to left. For instance, the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, has many palindromic subsequences, including “A,C,G,C,A” and “A,A,A,A” (on the other hand, the subsequence “A,C,T” is not palindromic). Devise an algorithm (using dynamic programming) that takes a sequence of characters X[0 … n-1] from the alphabet set (A,C,G,T) and returns the (length of the) longest palindromic subsequence. Implement the algorithm in an appropriate language.
write a sql qwery which include joining of two tables 4 marks mainframe
How to call a C++ function which is compiled with C++ compiler in C code?
how many types of bytes are there???
how to avoid java script validation in client side validation?
what are the activities you enjoy most and How do you see these Developing in the Future with Reference to in your work life and in your personal life
Diff between IF and where ?
Can anyone send me NIC question papers alongwith answers on nidhi1485@yahoo.co.in? Urgently needed.. Thanks in advance
Hi can you please send me recent(present) interview questions and technical qyestions with answers for "BUSSIESS OBJECTS" and "DATA WAREHOUSE".pls its urgent for me my mail id is sekhar.cs82@gmail.com,manjuforgis@gmail.com. thanks in advance