Skip to main content

Do-While Loop with Example in C language

In Computer programming, do-while loop is similar to while loop and used when a set of statements may have to be repeatedly executed until a certain condition is reached. When we do not know exactly how many times a set of statements have to be repeated, do-while can be used. The syntax of the do-while loop is shown below in C:

do
{
 statement1;
 statement2;
 statement3;
   .
   .
statementn;
} while (exp);

Where
  • do and while – are reserve words or keywords
  • exp – is the expression which is evaluated to TRUE or FALSE. The semicolon indicates the termination of the loop.
Working of do-while loop:
The following sequences of the operations are carried out during the execution of the do-while loop statement:
  • The body of the do-while loop consisting of statements statement-1, statement-2,….statement-n are executed.
  • Then, the exp is evaluated. If the expression exp is evaluated to TRUE, the body of the loop is executed again and the process is repeated.
  • If the exp is evaluated to FALSE, control comes out of the do-while loop and the statements after (outside) the do-while loop are executed.

Since the expression exp is evaluated to TRUE or FALSE at the bottom of the do-while loop, so, the do-while loop is called bottom testing loop or exit controlled loop. Here, the body of the loop is executed at least once.

Difference between while & do-while loop

Do-While Loop with Example in C: Computer Programming

Here's an example to get sum of 1 to given no.s
Algorithm:

Step1:    [Input the number of terms]
    Read: n
Step2:    [Initialization]
    sum=0
    i=0
Step3:    do
    sum = sum+i
    i = i+1
    while (i<=n)
Step4:    Write: sum
Step5:    Exit

Do-While Loop with Example in C: Computer Programming

C program
main()
{
int n,i,sum;
clrscr();
printf("Enter the value of n here: \n");
scanf("%d",&n);
sum=i=0;
do
{
sum=sum+i;
i++;
}while(i<=n);

printf("Sum of the series is %d",sum);
getch();
}

Do-While Loop with Example in C: Computer Programming, output

Read Also: Jump statements in C

Comments

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …