C++ Programming Tutorial

 
 
 

Data File Structure Programs

Array

Insert, edit, delete, append, display, Srch. Insert, delete, merge, delete multiple occurrences Arrays as a Stack in graphics

Stack

Stack operations using array Stack using static memory allocation Stack using dynamic memory allocation Double ended link list as a stack Lnked list as a Stack Infix expr. to Postfix expr. Postfix expr. into an Infix expr. Arrays as a Stack in graphics Stack as an Arithmetic expr. Evaluater Graphical Rep. of Stack Stack to traverse - inodr, postodr, preodr

Queue

Queue using static memory allocation Queue using dynamic memory allocation Circular queue Linked list as a Queue Double Ended linked list as a Queue Graphical Rep. of Queue Arrays as a Linear Queue Array as a Circular Queue Arrays as a Linear Queue ( in graphics ) Arrays as a Circular Queue ( in graphics )

Linked List

Singly link list Circular linked list Doubly link list Linked list as a Queue Linked list as a Stack Double Ended linked list as a Queue Double Ended linked list as a Stack Infix to Postfix - Linked List as Stack Circular doubly link list Single Ended Linked List - Sorting in both odr Hashing - double ended Linked List Sort of link list

Tree

Linked List as a Binary Srch. Tree Set Class using Binary Srch. Tree Maximum depth of Binary Srch. Tree Minimum Spaning Tree Prims algo - minimum spanning tree Traverse binary tree - inodr, preodr, post Find number in binary Srch. tree display levell

Sorting

Bubble Sort Selection Sort Insertion Sort Radix Sort Merge Sort Quick Sort Heap Sort Linear Sort Shell Sort Topological Sort

Searching

Linear Srch. or Sequential Srch. Binary Search Breadth First Search Traversal Depth First Search Traversal Shortest Path-Given Source-Destination-Dijkstras

Hashing

Simple implementation of Hashing Hashing using double-ended Linked List Hashing using Mid-Square Method Example of Hashing n term of the fibonacci series using recursion

Recursion

Factorial of the given number using recursion Mystery of Towers of Hanoi using recursion
 
 

Image

 # include <iostream.h>
 # include  <fstream.h>
 # include   <string.h>
 # include    <stdio.h>
 # include    <conio.h>


 /**************************************************************************/
 //---------------------------------  Node  -------------------------------//
 /**************************************************************************/

 class Node
 {
    public:
       char sData[25];

       Node* Next;
 };


 # define MAX_ENTRIES  25

 Node* HashTable[MAX_ENTRIES]={NULL};
 Node* Top[MAX_ENTRIES]={NULL};

 /**************************************************************************/
 //------------------------  generate_hash_key( )  ------------------------//
 /**************************************************************************/

 const int generate_hash_key(const char* sData)
 {
    int iHashKey = 0;
    int iLength = strlen(sData);

    int iCode = 0;

    for (int i = 0; i < iLength; i ++)
    iCode += (int)sData[i];

    iHashKey = (iCode%MAX_ENTRIES);

    return iHashKey;
 }

 /**************************************************************************/
 //---------------------------  insert_sData( )  ---------------------------//
 /**************************************************************************/

 void insert_sData( )
 {
    char sData[25];

    cout<<\"\\n\\n\\n\\t *********   New Element   ********* \"<<endl<<endl;
    cout<<\"\\t Enter a value : \";
    gets(sData);

    int index=generate_hash_key(sData);

    Node* Entry=new Node;

    if(!Entry)
    {
       cout<<\"\\n\\n\\n\\t Fatal Error : Unable to allcate memory to stroe new element.\"<<endl;
       cout<<\"\\n\\n\\t\\t Pres any key to return to Menu. \";

       getch( );
       return;
    }

    if(HashTable[index]==NULL)
    {
       strcpy(Entry->sData,sData);
       Entry->Next=NULL;
       HashTable[index]=Entry;
       Top[index]=Entry;
    }

    else
    {
       strcpy(Entry->sData,sData);
       Entry->Next=NULL;
       Top[index]->Next=Entry;
       Top[index]=Entry;
    }

    cout<<\"\\n\\n\\t\\t Pres any key to return to Menu. \";

    getch( );
 }

 /**************************************************************************/
 //----------------------------  print_sData( )  ---------------------------//
 /**************************************************************************/

 void print_sData( )
 {
    clrscr( );

    cout<<\"\\n\\n\\t *****  HashTable & Data  *****\\n\"<<endl;

    Node* Print;

    for(int index=0;index<MAX_ENTRIES;index++)
    {
       if(index<10)
      cout<<\"\\t HashTable[0\"<<index<<\"] : \";

       else
      cout<<\"\\t HashTable[\"<<index<<\"] : \";

       Print=HashTable[index];

       if(Print!=NULL)
       {
      while(Print!=NULL)
      {
         cout<<Print->sData;

         Print=Print->Next;

         if(Print!=NULL)
        cout<<\" , \";
      }

      cout<<endl;
       }

       else
      cout<<\"-\"<<endl;
    }

    cout<<\"\\n\\n\\t\\t Pres any key to return to Menu. \";

    getch( );
 }

 /**************************************************************************/
 //----------------------------  search_sData( )  --------------------------//
 /**************************************************************************/

 void search_sData( )
 {
    char sData[25];

    cout<<\"\\n\\n\\n\\t *****  Search an Element  *****\\n\"<<endl;
    cout<<\"\\t Enter a value : \";
    cin>>sData;

    int flag=0;
    int index=generate_hash_key(sData);

    Node* Print=HashTable[index];

    if(Print!=NULL)
    {
       while(Print!=NULL)
       {
      if(strcmp(Print->sData,sData) == 0)
         flag++;

      Print=Print->Next;
       }

       if(flag)
      cout<<\"\\n\\n\\t ***  The Search Element is found \"<<flag<<\" times.\";
    }

    if(!flag)
       cout<<\"\\n\\n\\t ***  The Search Element is not found.\"<<endl;

    cout<<\"\\n\\n\\n\\t\\t Pres any key to return to Menu. \";

    getch( );
 }

 /**************************************************************************/
 //---------------------------  show_working( )  --------------------------//
 /**************************************************************************/

 void show_working( )
 {
    char Key=NULL;

    do
    {
       clrscr( );

       gotoxy(10,5);
       cout<<\"**********   Implementation of Hashing   **********\"<<endl;

       gotoxy(10,8);
       cout<<\"Select one of the listed operation :\"<<endl;

       gotoxy(15,10);
       cout<<\"- Press \\\'I\\\' to Insert an Element\"<<endl;

       gotoxy(15,12);
       cout<<\"- Press \\\'P\\\' to Print the HashTable & Data\"<<endl;

       gotoxy(15,14);
       cout<<\"- Press \\\'S\\\' to Search an Element\"<<endl;

       gotoxy(15,16);
       cout<<\"- Press \\\'E\\\' to Exit\"<<endl;

       Input:

       gotoxy(10,20);
       cout<<\"                      \";

       gotoxy(10,20);
       cout<<\"Enter your Choice : \";

       Key=getche( );

       if(int(Key)==27 || Key==\'e\' || Key==\'E\')
      break;

       else if(Key==\'i\' || Key==\'I\')
      insert_sData( );

       else if(Key==\'p\' || Key==\'P\')
      print_sData( );

       else if(Key==\'s\' || Key==\'S\')
      search_sData( );

       else
      goto Input;
    }
    while(1);
 }


 int main( )
 {
    textmode(C4350);

    show_working( );

    return 0;
 }

    Related Post:
  1. Program to perform selection sort

  2. Program to add two numbers

  3. Menu driven telephone directory program

  4. Program to illusrate comparision operator overloading

  5. Program to illustrate the use of operator * and &

  6. Program to illustrate the implementation of 3D Rotation Transformation along z-axis

  7. Program to estimate value of First Derivative of the function at the given points from the given data using Backward Difference Formula , Forward diff

  8. Program to print the factorial of first five elements of the fibonacci series

  9. Program to illustrate the implementation of arrays as a Circular Queue ( in graphics )

  10. Problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs

  11. Write a program to Add Two Matrix

  12. Program to illustrate the binary operator(-) overloading without creating an object of that class

  13. Program that list of letters should be an alphabetical list of upper case letters followed by an alphabetical list of lower case letters

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

  15. Program to illustrate the role of constructor in classes

  16. Identifer recognisition Integer Unsigned real number with optional integer part

  17. Program that prints first 20 integers in reverse order (using while loop )

  18. Program to illustrate operator overloading from class to basic type

  19. Double Linked List-C++

  20. Program to show the implementation of Sutherland-Hodgeman Polygon Clipping Algorithm

 
 
Didn't find what you were looking for? Find more on Program to show an example of Hashing