NESTED STRUCTUR CPP

QUESTION- IMPLEMENT A LOGIC FOR NESTED STRUCTURE IN CPP

ANSWER-

 

#include<conio.h>
#include<iostream.h>
using namespace std;
struct bookout
{
       char name[25];
       int price;
       int pages;
       struct bookin
       {
              char isbn[10];
              char author[25];
              int pub_yr;
       }b;
};
int main()
{
    struct bookout a;
    cout<<“\nBOOK DESCRIPTION :)\n”;
    cout<<“\nNAME OF BOOK : “;
    cin>>a.name;
    cout<<“\nPRICE : “;
    cin>>a.price;
    cout<<“\nPAGES : “;
    cin>>a.pages;
    cout<<“\nISBN NO. : “;
    cin>>a.b.isbn;
    cout<<“\nAUTHOR : “;
    cin>>a.b.author;
    cout<<“\nPUBLICATION YEAR : “;
    cin>>a.b.pub_yr;
    cout<<“\n\nBOOK DESCRIPTION output 🙂 —- \n\n”
        <<“\nNAME:\t”<<a.name
        <<“\nPRICE:\t”<<a.price
        <<“\nPAGES:\t”<<a.pages
        <<“\nISBN NO.:\t”<<a.b.isbn
        <<“\nAUTHOR:\t”<<a.b.author
        <<“\nPUBLICATION YEAR:\t”<<a.b.pub_yr;
    cout<<“\n\nPROGRAMMING @ C#ODE STUDIO”;
    getch();
}
   

Sorting of array

Question- WAP TO GET INPUT FROM USER AND SORT THE ARRAY IN USER DEFINED FUNCTION

ANSWER-

#include<iostream.h>
#include<conio.h>
void disp(int*,int);
void sort(int*,int);

//MAIN FUNCTION GOES HERE
int main()
{
    int a[10],i,menu;
    for(i=0;i<10;i++)
    {
        cout<<“\nENTER ELEMENT AT “<<i+1<<“:”;
        cin>>a[i];
    }
    cout<<“\n\nELEMENTS ARE:”<<endl;
    disp(a,10);
    sort(a,10);
    cout<<“\n\nPROGRAMMING AT C#ODE STUDIO”;
    getch();
}

//DISPLAY FUNCTION GOES HERE

void disp(int *a,int n)
{
    int i;
    for(i=0;i<n;i++)
    {
        cout<<“\nVALUE AT POSITION “<<i+1<<” IS “<<a[i];
    }
}

//SORTING FUNCTION GOES HERE
void sort(int *a,int n)
{
    int i,j,temp;
    for(i=0;i<n;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(a[i]>a[j])
            {
                temp=a[i];
                a[i]=a[j];
                a[j]=temp;
            }
        }
    }
    cout<<“\n\nELEMENT AFTER SORTING ARE:”<<endl;
    disp(a,10);
}

ARRAY PRINTING;

QUESTION- WAP WHICH ALLOW USER TO ENTER VALUES IN ARRAY AND SHOW VALUES AT ODD POSITION AND AT EVEN POSITIONS-

ANSWER-

#include<iostream.h>
#include<conio.h>
using namespace std;
int main()
{
    int a[10],i,j;
    for(i=0;i<10;i++)
    {
                     cout<<“\nENTER VALUE AT POS “<<i+1<<“:”;
                     cin>>a[i];
    }
    cout<<“\nELEMENT AT ODD POSITIONS:”<<endl;
    for(i=0;i<10;i++)
    {
                     if(i%2==0)
                     {
                               cout<<“\n\nElement at pos “<<i+1<<” is “<<a[i];
                     }
    }
    cout<<“\n\nELEMENT AT EVEN POSITIONS:”<<endl;
     for(i=0;i<10;i++)
    {
                     if(i%2==0)
                     {
                               cout<<“\n”;
                     }
                     else
                     {
                         cout<<“\nElement at pos “<<i+1<<” is “<<a[i];
                     }
    }
    cout<<“\n\nPROGRAMMING @ C#ODE STUDIO”;
    getch();
   
}

INSERTION OF ELEMENT IN ARRAY;

QUESTION- WAP TO FIND A PROGRAM THAT ALLOW USER TO INSERT AN ELEMENT AT DESIRED POSITION IN ARRAY

ANSWER-

#include<iostream.h>
#include<conio.h>
using namespace std;
int main()
{
int n,i,pos,a[100],e;
cout<<“\nINTER NO. OF INDEXES:”;
cin>>n;
for(i=0;i<n;i++)
{
cout<<“\nENTER VALUE AT POS “<<i+1<<“:”;
cin>>a[i];
}
cout<<“\nENTER NEW ELEMENT:”;
cin>>e;
cout<<“\nENTER POSITION:”;
cin>>pos;
for(i=n-1;i>=pos-1;i–)
a[i+1]=a[i];
a[pos-1]=e;
n=n+1;
cout<<“\nTHE NEW ARRAY:”;
for(i=0;i<n;i++)
{
cout<<“\nVALUE AT POS “<<i+1<<“:”<<a[i];
}
cout<<“\n\nPROGRAMMING @ C#ODE STUDIO”;
getch();
}

DELETON OF ELEMENT FROM AN ARRAY

QUESTION- GET VALUES IN ARRAY AND ASK FOR POSITION WHERE USER WANT TO DELET ELEMENT

ANSWER-

#include<iostream.h>
#include<conio.h>
using namespace std;
int main()
{
    int n,i,pos,a[100],e;
    cout<<“\nINTER NO. OF INDEXES:”;
    cin>>n;
    for(i=0;i<n;i++)
    {
                     cout<<“\nENTER VALUE AT POS “<<i+1<<“:”;
                     cin>>a[i];
    }
    cout<<“\nENTER POSITION:”;
    cin>>pos;
    for(i=pos-1;i<n-1;i++)
                         a[i]=a[i+1];
    n=n-1;
    cout<<“\nTHE NEW ARRAY:”;
    for(i=0;i<n;i++)
    {
                     cout<<“\nVALUE AT POS “<<i+1<<“:”<<a[i];
    }
    cout<<“\n\nPROGRAMMING @ C#ODE STUDIO”;
    getch();
}

 

WORKING WITH ARRAY ARRAY;

QUESTION- ENTER VALUES IN ARRAY AND PRINT THEM REVERSELY IN NEXT ARRAY;

ANSWER-

#include<iostream.h>
#include<conio.h>
using namespace std;
int main()
{
    int a[10],b[10],i,j;
    for(i=0;i<5;i++)
    {
                     cout<<“\nENTER VALUE AT POS “<<i+1<<“:”;
                     cin>>a[i];
    }
    for(i=4,j=0;i>=0;i–,j++)
    {              
                                      b[j]=a[i];
    }
    cout<<“\nVALUE AFTER REVERSING:”;
    for(i=0;i<5;i++)
                     cout<<“\nVALUE AT POS “<<i+1<<” IS “<<b[i];
    cout<<“\n\nPROGRAMMING @ C#ODE STUDIO”;
    getch();
}
                    
   

STRUCTURE SEARCH;

Quest:- Input data for five employee and search for the names starts with ‘a’ and print them accordingly;

#include<iostream.h>
#include<conio.h>
using namespace std;

int main()
{
    struct employee
    {
           char name[10];
           int id;
           char add[25];
    }e[5];
    int i;
    for(i=0;i<5;i++)
    {
    cout<<“\n ENTER DATA FOR “<<i+1<<” EMPLOYEE:\n\n”;
    cout<<“\nName: “;
    cin>>e[i].name;
    cout<<“\nIdentity no.: “;
    cin>>e[i].id;
    cout<<“\nADDRESS: “;
    cin>>e[i].add;
    }
       for(i=0;i<5;i++)
     {
                     if(e[i].name[0]==’a’)
                           
                     {
                              cout<<“\n\n\nName=”<<e[i].name<<“\nIDENTITY NO.=”<<e[i].id<<“\nADDRESS.=”<<e[i].add;           
                     }
                     else
                     {
                         if(e[i].name[0]==’A’)
                                             cout<<“\n\n\nName=”<<e[i].name<<“\nIDENTITY NO.=”<<e[i].id<<“\nADDRESS.=”<<e[i].add;
                     }
     }
     cout<<“\n\nPROGRAMMING @C#ODE STUDIO”;
     getch();
}