Using standard template library (STL) list container implement following member functions of list class: empty, insert, merge, reverse, sort, Unique, using iterator.

-
#include<iostream>
#include<algorithm>
#include<list>
using namespace std;
int main()
{
    char ans;
    list<int>l1,l2;
    int ch;
    int temp;
    list<int>::iterator v;
    cout<<"\n1: Accept";
    cout<<"\n2: Display";
    cout<<"\n3:Merging list";
    cout<<"\n4:Sorting lists";
    cout<<"\n 5:Unique lists";
    cout<<"\n6:Reverse list";
    cout<<"\n7: Clear lists";

do
{
    cout<<"\nEnter the choice";
    cin>>ch;
    switch(ch)
    {
        case 1:            //Accept list
        {
            cout<<"\nAccept lists list1 and list2";
            cout<<"\nEnter elements";
            for(int i=0;i<6;i++)
            {
                cin>>temp;
                l1.push_back(temp);
            }
   
            cout<<"\nEnter list 2 elements";
            for(int i=0;i<6;i++)
            {
                cin>>temp;
                l2.push_back(temp);
            }   
        }
            break;

        case 2:            //Display list
        {
            cout<<"\nDisplay lists";
            cout<<"\nList1 elements are";
            for(v=l1.begin();v!=l1.end();v++)
            {
                cout<<"\t"<<*v;
            }
            cout<<"\nSize of list1\n"<<l1.size();

            cout<<"\nDisplay list2 elements\n";
            for(v=l2.begin();v!=l2.end();v++)
            {
                cout<<"\t"<<*v;
            }
            cout<<"\nSize of list2\n"<<l2.size();
            for(v=l1.begin();v!=l1.end();v++)
            {
                cout<<"\t"<<*v;
            }
        }
   
            break;

        case 3:            //Merging list
            cout<<"\nMerging lists\n";
            l1.merge(l2);
            break;
   
        case 4:            //sorting list
            cout<<"\nsorting list\n";
            l1.sort();
            break;

        case 5:            //Unique list
            cout<<"\nunique list\n";
            l1.unique();
            break;

        case 6:            //Reverse list
            cout<<"\nReverse list\n";
            l1.reverse();
            break;

        case 7:            //Clear list
            cout<<"\nClear list\n";
            l1.clear();
            break;
    }
    cout<<"\nDo you want to continue?";
    cin>>ans;
}while(ans=='y'||ans=='Y');

return 0;
}

------------------------------------------------------------------------

Output

[student@localhost Moddle]$ g++ list.cpp
[student@localhost Moddle]$ ./a.out

1: Accept
2: Display
3:Merging list
4:Sorting lists
 5:Unique lists
6:Reverse list
7: Clear lists
Enter the choice1

Accept lists list1 and list2
Enter elements1
2
3
2
1
4

Enter list 2 elements2
6
9
7
4
0

Do you want to continue?y

Enter the choice5

unique list

Do you want to continue?y

Enter the choice2

Display lists
List1 elements are    1    2    3    2    1    4
Size of list1
6
Display list2
    2    6    9    7    4    0
Size of list2
6   
1    2    3    2    1    4
Do you want to continue?n
[student@localhost Moddle]$

Comments

Post a Comment

Popular posts from this blog

Priority Scheduling Algorithm Java Program.

-
import java.util.Scanner; public class priority{ public static void main(String args[]) { Scanner s = new Scanner(System.in); int x,n,p[],pp[],bt[],w[],t[],awt,atat,i; p = new int[10]; pp = new int[10]; bt = new int[10]; w = new int[10]; t = new int[10]; //n is number of process //p is process //pp is process priority //bt is process burst time //w is wait time // t is turnaround time //awt is average waiting time //atat is average turnaround time System.out.print("Enter the number of process : "); n = s.nextInt(); System.out.print("\n\t Enter burst time : time priorities \n"); for(i=0;i<n;i++) { System.out.print("\nProcess["+(i+1)+"]:"); bt[i] = s.nextInt(); pp[i] = s.nextInt(); p[i]=i+1; } //sorting on the basis of priority for(i=0;i<n-1;i++) { for...
Read more

Implement UNIX system calls like ps, fork, join, exec family, and wait for process management (use shell script/ Java/ C programming).

-
//A small example to show how to use execvp() function in C. We will have two .C files , EXEC.c and execDemo.c and we will replace the execDemo.c with EXEC.c by calling execvp() function in execDemo.c . //EXEC.c  #include<stdio.h>  #include<unistd.h>  int main()   {        int i;       printf("This  is EXEC.c, called by execvp() ");        printf("\n");       return 0;   }  Now,create an executable file of EXEC.c using command  gcc EXEC.c -o EXEC //execDemo.c #include<stdio.h> #include<stdlib.h>  #include<unistd.h>  int main()  {     //A null terminated array of character      //pointers       char *args[]={"./EXEC",NULL};       execvp(args[0],args);     /*All statements are ignored after execvp() call as this whole process(execDemo.c) is replaced by ...
Read more

Implement a class CppArray which is identical to a one-dimensional C++ array (i.e., the index set is a set of consecutive integers starting at 0) except for the following : 1. It performs range checking. 2.It allows one to be assigned to another array through the use of assignment operator. 3.It supports a function that returns the size of the array.

-
#include<iostream> #include<math.h> using namespace std; class array {      int a[10],b[10],i,j,temp,n;           public:             void accept();             void display();             void range();             void sort();             void exchange();             int size(); }; void array::accept() {     cout<<"How many Elements you want to insert into the array=\n";     cin>>n;     cout<<"Enter the array Elements=\n";     for(i=0;i<n;i++)        {             cout<<...
Read more