FAST

Program /*  * C++ Program to Implement Singly Linked List  */ #include<iostream> #include<cstdio> #include<cstdlib> using namespace std; /*  * Node Declaration  */ struct node {     int info;     struct node *next; }*start; /*  * Class Declaration  */ class single_llist {     public:         node* create_node(int);         void insert_begin();         void insert_pos();         void insert_last();         void delete_pos();         void sort();         void search();         void update();         void reverse();         void display();         single_llist()         {             start = NULL;         } }; /*  * Main :contains menu  */ main() {     int choice, nodes, element, position, i;     single_llist sl;     start = NULL;     while (1)     {         cout<<endl<<"---------------------------------"<<endl;         cout<<endl<<"Operations on singly linked list"

Program #include<iostream> #include<windows.h> #include<stdio.h> #include<conio.h> using namespace std; int a,b,c,d,sum1,sum2; int entering(); class Dynamic{ public: int **m1,**m2,**sum,**sub,**mul; int Matrix1(int row,int colum); int Matrix2(int row,int colum); int Addition(int row,int colum); int substraction(int row,int colum); int multiplication(int row,int colum,int row1,int colum1); int transpose(int row,int colum,int row1,int colum1); int Displaym1(int row,int colum); int Displaym2(int row,int colum); }; Dynamic ss; int menu(){ system("cls"); int choice; cout<<"\n\n\t\t\t\t**************Lab Task**************"<<endl;    cout<<"\t\t*********************************************************************"<<endl;    cout<<"\t\t\t\t\t\tOperation Menu"<<endl;    cout<<"\t\t****************************************************