Skip to main content

Switch Statement in Computer Programming, C Language

There is another important branching statement known as the switch statement in computer programming. We know that (discussed earlier), in situations involving series of decisions one after the other, the if-else-if ladder can be used. Each and every condition may involve expressions which results in various data types such as float, double, char, integer etc.

Here, if-else-if ladder or nested if can be used. But, in situations involving series of decisions one after the other, each decision condition may involve expressions which result in integer value. This integer value may be used for comparison using equality operator "==". In these situations, where the result is of integer data type and series of integer values are used in equality decisions, the usage of switch statement is recommended, because it improves readability of the program.

The switch statement provides a way to select a choice out of several choices based on the selection of choice. The choice can either be an integer value or a character value. The choice can also be an expression which results in an integer value. Based on this integer value, the control is transferred to a particular case value.

The syntax of the switch statement is as follows:
switch (expression/choice)
{
  case value1:
      statement(s);
    break;
case value2:
    statement(s);
    break;
case value3:
    statement(s);
    break;
    .
    .
    .
default:
    statement(s);
}
The expression or choice in switch statement is evaluated to an integer value. The integer value thus obtained if matches with any of the values value1, value2, value3……, value n, then the control is transferred to the appropriate case statement(s). During execution of a particular case, if break is not encountered, then control goes to the subsequent case and the statement(s) under that case will be executed till the break statement is encountered.
If the value of the expression does not match with any of the cases values value1, value2,… value n then, control comes out of the switch statement in the absence of default. If default case is part of the switch then the statement(s) in default block will be executed.

Here, we are writing a program to simulate the calculator using switch statement. The input is an expression of the form P op Q Where P and Q are the operands and the op is an operator. For example, a + b, 10 * 20 etc. Based on the operator, the operations is performed and the result is displayed.

Algorithm:
Step1:    Read p, op, q;
Step2:    switch(op)
    case ‘+’:    result = p + q;
    case ‘-’:    result = p - q;
    case ‘*’:    result = p * q;
    case ‘/’:    result = p / q;
    default:    Write: ‘Invalid operator’
    [End of switch]
Step3:    Write: result
Step4:    Exit
   
C program of the above problem in C language:
main()
{
int p,q,result;
char op;
clrscr();
printf(“Enter an expression here:\n”);
scanf(“%d %c %d”,&p,&op,&q);
switch(op)
{
 case ‘+’:
 result = p + q;
break;
case ‘-’:
 result = p - q;
break;
case ‘*’:
 result = p * q;
break;
case ‘/’:
 result = p / q;
break;
default:
printf(“Invalid expression.\n”);
}
printf(“The result of the expression %d %c %d = %d”,p,op,q,result);
getch();
}
Switch Statement in Computer Programming, C Language

Advantages:

  • Improves readability of the program
  • More structure way of writing  the program

Disadvantage:

It can be used only if the expression used for checking the conditions result in integer value or character value. If the result of expression is not integer value, switch statement cannot be used.


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 …