Sponsored Links
Sponsored Links

Thursday, July 17, 2014

Download and Install Turbo C++ Full Screen Windows 7 Vista

4 comments
Today we will discuss How to Download and Install Turbo C++ With Full Screen IDE for Windows 7 and Vista.

What is Turbo C++?

Turbo C++ 3.0 is the most popular OLD is GOLD Compiler for C language and C++ Language. Students, normally, use Turbo C++ 3.0 for learning C / C++ programming. You can download and install Turbo C++ 3.0 in easy steps as follows:

Link for Download and Install Turbo C++ With Full Screen IDE for Windows 7 and Vista


Download and Install Turbo C++ With Full Screen IDE for Windows 7 and Vista

How To Install Turbo C++ With Full Screen IDE for Windows 7 and Vista.

       
    After you have downloaded the Turbo C++ installation zip file from mediafire, extract this file.

    Double click on the Turbo C++ installation file to start setup. Click on Next button.

     
    Download and Install Turbo C++ With Full Screen IDE for Windows 7 and Vista
    Accept the terms and click on install button.

    Download and Install Turbo C++ With Full Screen IDE for Windows 7 and Vista step 2
    Click on Finish button to end the setup. Congratulations! Now you can learn C++ computer programming in Turbo C++ IDE.

    Download and Install Turbo C++ With Full Screen IDE for Windows 7 and Vista step 3

    Click on start button and click on Turbo C++ icon.

    How To Run Turbo C++ With Full Screen IDE for Windows 7 and Vista
    Click on File menu and select New.

    How To Write First Program in Turbo C++ With Full Screen IDE for Windows 7 and Vista

    Type the first program as shown in the above picture. Click on RUN menu and select Run command. The output of the program will be shown as the following picture:

    How To Run First Program in Turbo C++ With Full Screen IDE for Windows 7 and Vista
    End of the C++ Tutorial How To Download, Install Turbo C++ With Full Screen IDE for Windows 7 and Vista and Write and Run First Program
    Read More

    Tuesday, June 10, 2014

    C Plus Plus Program Conversion of Hours into Weeks Days Hours

    1 comment
    Today, we are going to discuss a simple program logic that uses only input, output and assignment statements along with variable declarations.

    Points of Discussion are:
    • C++ Program: Input Hours Convert into Weeks, Days and Hours.
    • Algorithm of the Hours Conversion Program
    • C++ Code of the Hours Conversion Program.
    • Understanding Logic of The Hours into Week, Day and Hours Program


    ALGORITHM : Hours Conversion


    1. Start
    2. Input Hours
    3. Calculate Weeks = Hours / 168
    4. Calculate Hours = Hours Mod 168
    5. Calculate Days = Hours / 24
    6. Calculate Hours = Hours Mod 24
    7. Display "Weeks=", Weeks
    8. Display "Days=", Days
    9. Display "Hours =", Hours
    10. End

    C++ Code: Program Hours Conversion into Weeks, Days and Hours.


    #include<iostream.h>
    #include<conio.h>

    void main()
    {
          clrscr();
          int h, w, d, hrs;
          cout<<"Enter Hours=";
          cin>>hrs;
          h = hrs;
          w = hrs / 168;
          hrs = hrs % 168;
          d = hrs / 24;
          hrs = hrs % 24;
          cout<<"Total Hours input = "<<h<<endl;
          cout<<"Weeks ="<<w<<endl;
          cout<<"Days ="<<d<<endl;
          cout<<"Hours ="<<hrs;
          getch();
    }

    OUTPUT of Sample Run of The Program Hours Conversion


    Enter Hours= 200
    Total Hours input =200
    Weeks = 1
    Days =1
    Hours =8


    Logic of The Program Hours Conversion


    We know that:
    1 day = 24 hours
    so 1 week = 24 x 7 = 168 hours

    Therefore we will divide total hours by 168 to get weeks.
    weeks = 200 / 168 will give 1 week.
    Now to calculate remaining hours we will get remainder of the division 200 % 168
    This will give remaining hours = 32

    To get days, we will divide remaining hours by 24
    so 32 / 24 will give 1 day.

    Now we will calculate remaining hours by remainder 32 % 24 that will give the result 8 hours.

    So the output 1 week, 1 day and 8 hours.

    If you enjoyed the C++ Learning Through Example program Logic Understanding, Please share this blog on Social media. Thanks!
    Read More

    Sunday, February 16, 2014

    Convert a Number into Reverse Number Program in C Plus Plus

    1 comment

    C++ Reverse Number Conversion Program Logic



    Q: Write a C++ Program to input an integer number and display its Reverse Number. For example if the input is the number 123, the Reverse Number will be 321.

    convert-reverse-number-program-c-plus-plus
    • First of all we suppose that the number entered is 123.
    •  Let the given number num = 123
    • Copy the number in temporary variable temp so that temp = 123

    First Iteration of While Loop

    • We start a while loop with condition temp>0. Since temp=123 so loop will start for first time.
    • Now we will divide number 123 by 10 so that the remainder R = 3 and Quotient Q = 12
    • Put the values in statement rev = rev * 10 + R
    • rev = 0 * 10 + 3
    • rev = 3
    • Assign the value of Quotient Q to temp so that temp = 12 now.
    • Since temp 12 is >0, so the while loop will execute again.
    •  

    Second Iteration of While Loop

    • Now we will divide number temp 12 by 10 so that the remainder R = 2 and Quotient Q = 1
    • Put the values in statement rev = rev * 10 + R
    • rev = 3 * 10 + 2
    • rev = 30+2
    • rev = 32
    • Assign the value of Quotient Q to temp so that temp = 1 now.
    • Since temp 1 is >0, so the while loop will execute again.

     Third Iteration of While Loop

    •  Now we will divide number temp 1 by 10 so that the remainder R = 1 and Quotient Q = 0
    • Put the values in statement rev = rev * 10 + R
    • rev = 32 * 10 + 1
    • rev = 320+1
    • rev = 321
    • Assign the value of Quotient Q to temp so that temp = 0 now.
    • Since temp 0 is not >0, so the condition temp>0 will evaluate to false so that the while loop will terminate.
    reverse-number-program-code-in-c-plus-plus

    Conclusion

           So the Required Reverse Number is 321.

    The Actual C++ Code of Reverse Number Program


    /*
    Program to input a number, then display its Reverse number.
    (c) Www.EasyCppProgramming.Blogspot.Com
    */


    #include<iostream.h>
    #include<conio.h>
    #include<math.h>
    void main()
    {
         int num, temp, rev=0, R, Q;

         clrscr();

         cout<<"Enter a number to reverse=";

         cin>>num;

         temp = num;

         while ( temp>0 )

         {

           Q = temp/10;
           R = temp % 10;
           rev = rev*10 + R;

           temp = Q;

         }

         cout<<"\n The Reverse Number = "<<rev;
         getch();

         }
    Read More

    Thursday, January 16, 2014

    Insertion Sort Algorithm Trace Steps and Program

    1 comment
    Today, we will discuss Insertion Sort Algorithm Trace Steps and Program. First of all, we will:
    1. Define Insertion Sort
    2. Explain the working of Insertion Sort 
    3. Design an algorithm of Insertion Sort
    4. Show trace steps of Insertion sort algorithm for sample data on paper.
    5. Finally, write down the actual code of Insertion sort program in C++.

      What is Insertion Sort?

    In Insertion sort, we have to insert elements in to correct position. First of all we find the correct position to insert for the key value under consideration. Secondly we will move other elements to make space for this new element (key value). Now we insert the new element at this space. Suppose there are the following elements in an array A to sort by insertion sort:

    Working of Insertion Sort

    1. Let first item be trivially sorted.
    2. Now we consider first two items of list. Place second item on its correct location.
    3. In Third pass we will consider first three items from list. Insert the 3rd item at its correct location among location1, location2 and location3.
    4. In 4th pass, insert the 4th item at its correct location among location1, location2, location3 and location4.
    5. And so on.

    Algorithm of Insertion Sort

     Algorithm: INSERTION-SORT(array)
     This algorithm takes Array 'array' of size n numbers (array has index from 0 to n-1)as input. It sorts the given array in ascending order by INSERTION SORT method. i and j are integer variables used as index of array. temp is a temporary integer variable.
     1.   Repeat through step 6 for i ← 1 to n-1
     2.     temp  ← array[i]
     3.    Repeat through  step 5 while ( j > 0 && array[j-1] > temp)
     4.    array[j] ← array[j -1]
     5.    j ←   j - 1
     6.    array[j]← temp
     7.    End  

    Insertion Algorithm Paper Tracing with data:a[0] ,a[1], a[2], a[3], a[4], a[5]
     5,       2,     4,      6,     1,     3
    1. First of all we suppose that the first element 5 is its correct place or trivially sorted.

    2. Now we consider second element 2. We have to insert 2 at its correct location from first two locations [0] and [1]. We will find its correct position from first two items 5 and 2.
    3. Since 2 is less than 5, so the correct location of 2 is at array index[0].
    4. We will move 5 from position [0] to [1].
    5. Now we will place 2 at [0], so we have sorted first two items.

    6. Now array = 2,5,4,6,1,3 Consider 3rd item which is 4. Now we find its correct location from first three locations. So 4 will be inserted at location [1] between 2 and 5.
    7. We move 5 to position [2] and place 4 on position [1]
    8. So first three items are sorted with array = 2,4,5,6,1,3

    9. Now array = 2,4,5,6,1,3   consider 4th item 6 and place on its correct location among first four locations.
        We know that 6 is at its correct location which is 4th location and by index it is [3].

    10. Now array is 2,4,5,6,1,3  consider 5th item which is 1. We know that its correct location between first
          five items is number one that is position [0] by index.
    11. So we move 6 on [4]
               we move 5 on [3]
               we move 4 on [2]
               we move 2 on [1]
    12. Now place 1 on position [0], so the array items a[0] to a[4] are sorted

    13. Now array is 1,2,4,5,6,3   consider 6th item which is 3.
    14. We know that 3 will be inserted at location [2] between item 2 and item 4.
    15. We move 6 to location [5]
                move 5 to [4]
                move 4 to [3]
    16. Now place 3 at location [2]
    17. Hence the whole array has been sorted now     1,2,3,4,5,6
           
     You can check this all process in the following picture of insertion sort paper tracing.
       

    Insertion Sort Algorithm Trace Steps and Program

    Image: Trace steps : Insertion Sort Algorithm Trace Steps and Program

    Insertion Sort Algorithm Trace Steps and Program

    Program Insertion Sort in C++



    /*
    (c)EasyCppProgramming.Blogspot.Com
    C++ is Simplified Here!
    Target 1001 C++ Example Programs!
    EasyCppProgramming.Blogspot.Com
    */

    // Program To Input an array and sort
    // the array by Insertion Sort Algorithm

    #include<iostream>
    #include<conio.h>

    int main()
     {

       int n, array[100], i, j, t;

    cout<<"\n/* Insertion sort Ascending order */\n";

      cout<<"Enter number of elements\n";
      cin>>n;

      cout<<"Enter "<<n<<" numbers\n";

      for (i = 0; i < n; i++)
        cin>>array[i];


    for( i = 1;i < n; i++)
         {
         temp = array[i];
         for ( j = i; j > 0 && array[j-1] > temp; j--)
         array[j] = array[j-1];
         array[j] = temp;
         }

      cout<<"Sorted list in ascending order:\n";

      for (i = 0; i <= n - 1; i++)
        cout<<array[i]<<endl;

      getch();
      return 0;
    }

    Image: Sample Run of Program in Turbo C++ 3.0 - Insertion Sort Algorithm Trace Steps and Program

    Sample Run - Insertion Sort Algorithm Trace Steps and Program

     Another Insertion Sorting Example for sorting data: 5,2,3,8,1

    Figure: ample data trace steps: Insertion Sort Algorithm Trace Steps and Program
    Another Insertion Sorting Example for sorting data - Insertion Sort Algorithm Trace Steps and Program
    So, we have completely discussed Insertion Sort Algorithm Trace Steps and Program, if you have any question please do not hesitate to ask question in comments section, thanks.

    Further suggested Reading: Sorting Algorithms and Programs in C / C++

    1.  Bubble Sort Algorithm and Program Logic in C Plus Plus

    Read More

    Tuesday, January 14, 2014

    Bubble Sort Algorithm and Program Logic in CPP

    Leave a Comment
    Today, we will discuss Bubble Sort Algorithm and Program Logic in CPP ( C++ ) programming language. We will study:
    1. Definition of Bubble Sort Algorithm
    2. Trace steps for sample data or working of Bubble sorting algorithm
    3. Algorithm of Bubble Sorting Method
    4. Actual code of Bubble sort program in C++ programming language

     What is Bubble Sort?

    Bubble sort is a sorting algorithm, in which we repeatedly pass through the whole array and swap the adjacent elements if they are not sorted.

    Note that: In Bubble sort there will be maximum (n-1) passes to sort the given array. For example, if array size n = 5 then there will be (n-1) that is 4 passes.
    Note that: In first pass there will be 4 comparisons like 5>4. In second pass there will be 3 comparisons. In third pass there will be two comparisons. And in last that is 4th pass there will be only one comparison.

    Method of Bubble Sorting

    • 1. Compare first two adjacent elements, if first is greater than second then swap them( if  sorting on ascending order)   
    • 2. Repeat this comparison for second and third adjacent elements, then third and fourth elements and so on to second last and last elements. And swap the values where needed. This makes ONE PASS of Bubble Sort Algorithm.
    • 3. Now again start with first and second element to compare and swap if first is greater than other. This time ignore last element. So you will compare adjacent elements from number 1 to second last element.
    • 4. Similarly in third pass, you will reduce another comparison from end, and so on.
    • 5. Keep repeating for one fewer element each time until there will be no pairs to compare. In Last Pass, there will be only one comparison of first and second element.

    Bubble Sort Algorithm and Program Logic in CPP - on Sample Data

    For example:

    Let given un sorted array is:

    5, 4, 3, 2, 1


    In first pass:
    5, 4, 3, 2, 1
    Pass 1:

    We will check if 5>4 then swap(5,4) so that array will become as follows
         4, 5, 3, 2, 1
        Next we will check if 5>3 then swap(5,3) so that array will become:
         4, 3, 5, 2, 1
        Next we will check if 5>2 then swap(5,2) so that array will become:
         4, 3, 2, 5, 1
        Next we will check that if 5>1 then swap(5,1) so that array will become:
        4, 3, 2, 1, 5
    Note: You should note that in pass 1, the last element (5) is bubbled and placed to its correct location(sorted) in the given array.
    Pass 2:

    4, 3, 2, 1, 5
    We will check if 4>3 then swap(4,3) which is true , so that array will become as follows:
         3, 4, 2, 1, 5
        Next we will check if 4>2 then swap(4,2) so that array will become:
         3, 2, 4, 1, 5
        Next we will check if 4>1 then swap(4,1) so that array will become:
         3, 2, 1, 4, 5
    Note: You should note that in pass 2, the second last element (4) is bubbled and placed to its correct location(sorted) in the given array.

    Pass 3:

    3, 2, 1, 4, 5
    We will check if 3>2 then swap(3,2) which is true , so that array will become as follows:
         2, 3, 1, 4, 5
        Next we will check if 3>1 then swap(3,1) so that array will become:
         2, 1, 3, 4, 5
    Note: You should note that in pass 3, the third last element (3) is bubbled and placed to its correct location(sorted) in the given array.

    Pass 4:
    2, 1, 3, 4, 5
    We will check if 2>1 then swap(2,1) which is true so the array becomes:
    1, 2, 3, 4, 5

    Which is the required sorted array.

      Bubble Sort Algorithm and Program Logic in CPP

    Bubble Sort Algorithm


    This algorithm will input values in array A of n size. Then sort the array by Bubble sort method and display the display the array. Suppose A be a linear array of n numbers. Temp is a temporary variable for swapping (interchanging) the position of the numbers in array as required according to the sorting order.
    1. Input n numbers of an array A
        Initialise i=0 and repeat through 1b if (i<n)
        1a) Display Message " Enter a number="
        1b) Input A[i]
    2. Initialise i= 0 and repeat through step 4 if (i< n)
    3. Initialize j= 0 and repeat through step 4 if (j< n – i– 1)
    4. If (A[j] > A[j + 1])
    (a) Temp = A[j]
    (b) A[j] = A[j + 1]
    (c) A[j+ 1] = Temp
    5. Display the sorted numbers of array A
        Initialise i=0 and repeat through 5a if (i<n)
        5a) Display A[i]
    6. Exit.

    Picture: Bubble Sort Algorithm and Program Logic in CPP
    Bubble Sort Algorithm and Program Logic in CPP trace steps

    Bubble Sort Program Code for Array of size s = 5 integer elements

    Sample Run in Turbo C++ 3.0 IDE Bubble Sort Algorithm and Program Logic in CPP

    Bubble Sort Algorithm and Program Logic in CPP
    /*
    (c)EasyCppProgramming.Blogspot.Com
    C++ is Simplified Here!
    Target 1001 C++ Example Programs!
    EasyCppProgramming.Blogspot.Com
    */

    // Program To Input an array and sort
    // the array by Bubble Sort Algorithm

    #include<iostream>
    #include<conio.h>

    int main()
     {

        int a[5], s=5, i, j, k, temp;
       clrscr();
       // input array
       cout<<"Enter 5 array elements to sort:\n";
       for(i=0;i<s;i++)
       cin>>a[i];
       // show un-sorted array
       cout<<"\n Un-Sorted array is =";
       for(i=0;i<s;i++)
       cout<<a[i]<<"    ";
       cout<<"\n------------------------------------";
       // sort array by bubble sort
        for(i=0;i<s-1;i++)
        {
        for(j=0;j<(s-1-i);j++)
                if(a[j]>a[j+1])
                {
                    temp=a[j];
                    a[j]=a[j+1];
                    a[j+1]=temp;
                 }
    cout<<"\nAfter Pass "<<(i+1)<<" elements are : ";
    for (k = 0; k < s; k++)
    cout<<a[k]<<"   ";
    cout<<endl;
    }/*End of outer for loop*/
        // show sorted array
       cout<<"\n ----------------------------------";
       cout<<"\nSorted Array is = ";

       for(i=0;i<s;i++)
       cout<<a[i]<<"    ";
       // wait for user to press any key
       getch();
       // end
       return 0;
     }

    Now after studying Bubble Sort Algorithm and Program Logic in CPP, Read more on

    Insertion Sort Algorithm Trace Steps and Program

    Read More

    Explain Different Types of Iterative Looping Structures

    Leave a Comment

    What is a Looping Structure in C++?


    A looping structure is a statement used to repeatedly execute a block of  one or more statements for a specified number of times or as long as a given condition remains true.

    In C++, looping statements are also called Repetitive statements or Iterative Statements.

    Different Types of  Looping Structures in C++


    There are three types of looping structures in C and C++ programming languages, as follows:

    1. for loop
    2. while loop
    3. do while loop
    Explain Different Types of Iterative Looping Structures
     Let us study these iterative statements deeply with syntax and purpose with the help of sample codes and outputs.

    1. for Loop statement


    A for loop statement is used to execute a block of one or more statements repeatedly for a specified number of times.

    Syntax of for loop


    for(initialization;condition;increment/decrement-expression)
    {
        statement1;
        statement 2;
        .
        .
        .
       statement N;
    }

    Example of for loop


    int d;
    for(d=5; d>=1; d--)
       cout<<d<<endl;

    Output:

    5
    4
    3
    2
    1

    2. while Loop Statement in C / C++


    while loop is used to execute a block of one or more statements repeatedly as long as the given condition remains true.

    Syntax of while loop


    while(condition)
    {
        statement1;
        statement 2;
        .
        .
        .
       statement N;
    }

    Example of while loop


    int f=5;
    while(f>=1)
    {
        cout<<f<<endl;
        f--;
    }

    Output:

    5
    4
    3
    2
    1

    3. do while Loop statement in C / C++


    A do while loop is used to execute a block of one or more statements as long as the given condition remains true but condition is placed after loop body.

    Syntax of do while loop


    do
    {
        statement1;
        statement 2;
        .
        .
        .
       statement N;
    }
    while(condition);

    Example of do while loop


    int h=5;
    do
    {
        cout<<h<<endl;
        h--;
    }
    while(h>=1);

    Output:


    5
    4
    3
    2
    1http://easycppprogramming.blogspot.com/2014/01/working-of-for-loop-statement-with.html

    After studying a brief description of Different Types of Iterative Looping Structures in C++
    For further reading:


    Purpose and Example of do while Loop in CPP Language

    Working of for loop statement with examples

    Working of While Loop With Examples
    Read More

    Monday, January 13, 2014

    Purpose and Example of do while Loop in CPP Language

    Leave a Comment

    What is a do while Loop?

    The do while loop is another iterative statement in C++ language. It is used to repeat a set of one or more statements while the given condition remains true. It is similar to while loop in C++ except that the condition is written after the body of loop.
    Purpose and Example of do while Loop in CPP Language
    Purpose and Example of do while Loop in C++ Language

    Syntax of do while loop


    do
    {
       statement 1;
       statement 2;
       .
       .
       .
       statement N;

    while (condition);

    Where:
    do is a reserved word or keyword.
    {
       statement 1;
       statement 2;
       .
       .
       .
       statement N;

    is body of loop (a set of one or more statements enclosed in curly brackets)
    while is a reserved word or keyword
    condition is normally given as a relational expression like (n>=1) etc

    Example of do while loop

    int n = 1;
    do
    {
        cout<<n<<endl;
        n++;
     } 
     while (n<=5); 

    Output of the above written C++ code segment is list of 1 to 5 numbers as follows:

    1
    2
    3
    4
    5

    How this output comes?

    1. First of all an integer variable n is intialized to 1.
    2. Body of loop is executed for first time. 1 is printed and control goes to next line due to endl.
    3. The valuse of n is incremented by one so that n is equal to 2 now.
    4. Condition is checked for first time n<=5, that is, 2<=5 which is true.
    5. Body of loop is executed for second time.
    6. 2 is printed and control goes to next line due to endl.
    7. The value of n is incremented by one so that n is equal to 3 now.
    8. Condition is checked  n<=5, that is, 3<=5 which is true.
    9. Body of loop is executed for third time.
    6. 3 is printed and control goes to next line due to endl.
    7. The value of n is incremented by one so that n is equal to 4 now.
    8. Condition is checked  n<=5, that is, 4<=5 which is true.
    9. Body of loop is executed for fourth time.
    10. 4 is printed and control goes to next line due to endl.
    11. The value of n is incremented by one so that n is equal to 5 now.
    12. Condition is checked  n<=5, that is, 5<=5 which is true.
    13. Body of loop is executed for fourth time.
    14. 5 is printed and control goes to next line due to endl.
    15. The value of n is incremented by one so that n is equal to 6 now.
    16. Condition is checked  n<=5, that is, 6<=5 which is false. So the do while loop ends here.

    Example 2 of do while loop


    int n=100;
    do
    {
       cout<<n<<endl;
       n++;
    }
    while (n>=1000);

    Output is as follows:


    100

    Explanation of working of above sample do while code:

    1. First of all the value of n is set to 100.
    2. Body of loop is executed for the first time.
    3. 100 is printed on screen and control goes to next line due to endl. The value of variable n is incremented by one so that now n = 101
    4. The given condition (n>=1000) is checked. Since the condition (101>=1000) is false so the loop will will end.
    Read More