Skip to main content

Uses of Sequential and Compound Statements: C programming

INTRODUCTION

In our previous article, we have studied about the single statements. The order in which statements are executed known as control flow and the statements that are used to control the flow of execution of the program are called as control statements. Based on the order in which the statements are executed, the various control statements are classified as follows:
         
Uses of Sequential and Compound Statements: C Language

Now, let us consider each of the control statements one by one.

Sequential Statements

The programmer writes a sequence of statements to specify some activity in a program. All these statements in a program are executed in the order in which they appear in the program. These programming statements that are executed sequentially, i.e. one after one is known as the sequential statements. Here, no separate statements are required to make these statements executed in sequence. The flow chart and the equivalent programming statements are shown below:

Uses of Sequential and Compound Statements: C Language

Here, statement 1 is executed first followed by statement 2 followed by statement 3 and so on. In short, we can say that execution of program is normally sequential (one after one). For example, let us write a program to find the sum of two integer numbers, which is given by the following relation:

Sum = Num1 + Num2

The sequence of steps to be followed as:
•    Input two integer numbers
•    Compute the sum using Sum = Num1 + Num2
•    Display the result
•    Stop the execution

The equivalent algorithm and the flow chart for the same are shown below:

Example 1:    Algorithm and flow chart to compute the sum of two integer numbers.
Algorithms:    ADD
    [Compute the sum of two integer numbers.]
    Step 1: [Input any two integer numbers]
        Read: Num1, Num2
    Step2: [Compute the sum]
        Sum = Num1 + Num2
    Step3: [Display the result]
        Write: Sum
    Step4: [Stop]
        Exit
Uses of Sequential and Compound Statements: C Language

Example2:
main()
{
 int Num1, Num2, Sum;
 clrscr();
 printf(“Enter any two integer numbers\n”);
 scanf(“%d%d”,&Num1.&Num2);
 /* compute the sum*/
 Sum = Num1 + Num2;
 Printf(“Sum = %d”,Sum);
 getch();
}

Output:
Uses of Sequential and Compound Statements: C Language

Advantage

No other separate control statement is required to execute the sequential statements one after one.

Disadvantage:

The sequence in which statements are executed cannot be altered or changed.

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 …