C++ Programming Tutorial

 
 
 

Basic Programming

Input - Output - Variables - Constants

Print text Count number of words, lines and chracters Read 2 numbers from user - computes sum Size, addr of variable of type int , float, char Declaration , initialization, print constant vari Reference variables

Bitwise Operators

Bitwise operator OR ( | ) Bitwise Operator AND (&) Bitwise Operator XOR ( ^ ) Bitwise Operator Left Shift ( << ) Bitwise Operator Right Shift ( >> )

Conditional Statements

Reads marks - test of 100 marks - print pass Reads number and prints even or odd number Read, compute, display grade using switch case Read marks, compute grade using if else Compute, display result - ternary operator ( ? : ) Read integers, operator, evaluate - switch case

Loops - Continue/Break Statement

Prints 10 integers using for loop Display sum of ten integers using for loop Print odd numbers from 0 to 50 using for Loop Compute, displays num factorial using for loop Histogram using nested for loop Print a diamond using nested for loop Square of ten integers using for loop Print 20 integers using while loop Print 20 int in reverse order using while loop Odd num, even num, divisible by 5 b/w 0 to 50 Display num digits in reverse order - while loop Display num in reverse order - do while loop Display factorial using do-while loop Even num - 0 to 50 - while, do-while, for loop Use of the break statement Use of the continue statement

Functions

Use of parameterless function Largest int among 3 - function with no return type Largest int among 3 - function with return type Use of call-by-value method in functions Use of call-by-refrence method in functions Use of inline functions Use of default argument function Use of function overloading Find distance b/w 2 points - function overloading Example of function overloading Example if built-in function Compute nCr Built int functions strcomp, strcmpi, stricmp Storage class Auto, Static with global variable

Arrays

Find largest element of an array Initialize array by even numbers display sum Reverse the content of an integer array Histogram using array Print an array using function definition Read marks of students display total marks, status Whole array, single array elmt as parameter to fn Bubble sorting of arrays Search element in an array - Linear search Search element in an array - Binary search Read 2D array, display it row by row and sum

Pointers - Strings

Use of operator * and & Supplying of values to pointer variables Adding values to the contents of variables Use of pointer to pointers Functions returning pointers Operations performed on pointers 2D array of int using pointers 2D array of char (string) using pointers Srray before and after adding 5 to its contents Use of call-by-reference method using pointers Sum, smallest, largest element an array pointers Features of array of char known as string Example of constant pointers to non-constant data

Recursion

Computes and displays the factorial of number Computes n_th term of the fibonacci series Towers of Hanoi Problem

General Programs

Find Book in the list of Books Year is a leap year or not Swap two variables using header file swap.h Find day of a week of a given date using arrays Convert decimal into binary, octal, pental code Covert given decimal into Roman Code Covert given Decimal into English Code Add two integers without using + operator Factorial of first five elements of the fibonacci Add two integers of any length Non-Linear function in one variable and evaluate
 
 

Image

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

 long fibonacci(int);

 main()
    {
       clrscr();

       int number;
       long result;

       cout<<\"\\n Enter the number = \";
       cin>>number;

       cout<<\"\\n The fibonacci series upto the \"<<number<<\"_th term is : \"
                                     <<endl;

       for(int count=0;count<=number;count++)
      {
         result=fibonacci(count);
         cout<<\" \"<<result;
      }

       cout<<\"\\n\\n The \"<<number<<\"_th term of fibonacci series = \"<<result
                                <<endl;

       getch();
       return 0;
    }



 //---------------------------  fibonacci(int)  --------------------------//


 long fibonacci(int n)
    {
       if(n==0 || n==1)
      return n;

       else
      return fibonacci(n-1)+fibonacci(n-2);
    }

    Related Post:
  1. Program to add pairs of MxN matrices

  2. Program to illustrate the use of inline functions

  3. Program to help Umar in this task. Represent each city by one lowercase character. Thus, you can have at most 26 different cities to visit....

  4. Program to sort numbers using quick sort and bubble sort

  5. Program to calculate distance summation, subtraction, multiplication and comparison using overloading operators also make it friend functions

  6. Program to create a queue using dynamic memory allocation

  7. Program to illustrate the implementation of Stack as an Arithmetic Expression Evaluater

  8. Program to read a Non-Linear equation in one variable, then evaluate it using Simple Itrative Method and display its kD accurate root

  9. Program to draw a circle using Trigonometric Method

  10. PROGRAM OF BASIC TO CLASS CONVERSION

  11. Program to illustrate object initialization and assignment by default member wise copy

  12. PROGRAM TO IMPLEMENT RECURSIVE DESCENT PARSER

  13. Program to convert an Infix Expression into a Postfix Expression

  14. Program to implement the Prims Algorithm to solve Minimum Spanning Tree Problem (MST) using Graphics and with Mouse support

  15. Program of LL1 parser

  16. Program that reads a number and prints even if the number is even and prints odd if the number is odd.

  17. PROGRAM FOR ACCEPTING MEASUREMENTS IN METERS AND FEETS AND SUMMING THEM UP IN THE FORMAT THAT THE USER WISHES

  18. Represent a polynomial in terms of a singly linked list and then add two three variables polynomials

  19. Program of class to basic conversion

  20. Program to draw an ellipse using Trigonometric Method

 
 
Didn't find what you were looking for? Find more on Program that computes the n_th term of the fibonacci series using recursion