Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Aim: To implement a program to allocate memory dynamically for 2 dimensional array (accept and print matrix) using pointers.
Code:
#include
class matrix
{
int **p,r,c,i,j;
public:
matrix(int,int);
~matrix();
void getdata();
void display();
};
matrix::matrix(int x,int y)
r=x;
c=y;
p=new int *[r];
for(i=0;i p[i]=new int [c]; } matrix::~matrix() { for(i=0;i delete p[i]; delete p; cout<<"\nMemory deallocated successfully\n"; } void matrix::getdata() { cout<<"\nEnter matrix values:\n"; for(i=0;i { cout<<"Enter values for row:"< for(j=0;j cin>>p[i][j]; } } void matrix::display() { cout<<"\nThe matrix is:\n"; for(i=0;i {; for(j=0;j cout< cout< } } void main() { int rows,cols; clrscr(); cout<<"Enter number of rows and columns for a matrix\n"; cout<<"Enter number of rows\n"; cin>>rows; cout<<"Enter number of columns\n"; cin>>cols; matrix A(rows,cols); A.getdata(); A.display(); getch(); } Output: Enter number of rows and columns for a matrix Enter number of rows 3 Enter number of columns 3 Enter the values of the matrix Enter values for row 1 1 2 3 Enter values for row 2 4 5 6 Enter values for row 3 7 8 9 The matrix is 1 2 3 4 5 6 7 8 9 Memory deallocated successfully
p[i]=new int [c];
}
matrix::~matrix()
for(i=0;i delete p[i]; delete p; cout<<"\nMemory deallocated successfully\n"; } void matrix::getdata() { cout<<"\nEnter matrix values:\n"; for(i=0;i { cout<<"Enter values for row:"< for(j=0;j cin>>p[i][j]; } } void matrix::display() { cout<<"\nThe matrix is:\n"; for(i=0;i {; for(j=0;j cout< cout< } } void main() { int rows,cols; clrscr(); cout<<"Enter number of rows and columns for a matrix\n"; cout<<"Enter number of rows\n"; cin>>rows; cout<<"Enter number of columns\n"; cin>>cols; matrix A(rows,cols); A.getdata(); A.display(); getch(); } Output: Enter number of rows and columns for a matrix Enter number of rows 3 Enter number of columns 3 Enter the values of the matrix Enter values for row 1 1 2 3 Enter values for row 2 4 5 6 Enter values for row 3 7 8 9 The matrix is 1 2 3 4 5 6 7 8 9 Memory deallocated successfully
delete p[i];
delete p;
cout<<"\nMemory deallocated successfully\n";
void matrix::getdata()
cout<<"\nEnter matrix values:\n";
for(i=0;i { cout<<"Enter values for row:"< for(j=0;j cin>>p[i][j]; } } void matrix::display() { cout<<"\nThe matrix is:\n"; for(i=0;i {; for(j=0;j cout< cout< } } void main() { int rows,cols; clrscr(); cout<<"Enter number of rows and columns for a matrix\n"; cout<<"Enter number of rows\n"; cin>>rows; cout<<"Enter number of columns\n"; cin>>cols; matrix A(rows,cols); A.getdata(); A.display(); getch(); } Output: Enter number of rows and columns for a matrix Enter number of rows 3 Enter number of columns 3 Enter the values of the matrix Enter values for row 1 1 2 3 Enter values for row 2 4 5 6 Enter values for row 3 7 8 9 The matrix is 1 2 3 4 5 6 7 8 9 Memory deallocated successfully
cout<<"Enter values for row:"<
for(j=0;j cin>>p[i][j]; } } void matrix::display() { cout<<"\nThe matrix is:\n"; for(i=0;i {; for(j=0;j cout< cout< } } void main() { int rows,cols; clrscr(); cout<<"Enter number of rows and columns for a matrix\n"; cout<<"Enter number of rows\n"; cin>>rows; cout<<"Enter number of columns\n"; cin>>cols; matrix A(rows,cols); A.getdata(); A.display(); getch(); } Output: Enter number of rows and columns for a matrix Enter number of rows 3 Enter number of columns 3 Enter the values of the matrix Enter values for row 1 1 2 3 Enter values for row 2 4 5 6 Enter values for row 3 7 8 9 The matrix is 1 2 3 4 5 6 7 8 9 Memory deallocated successfully
cin>>p[i][j];
void matrix::display()
cout<<"\nThe matrix is:\n";
for(i=0;i {; for(j=0;j cout< cout< } } void main() { int rows,cols; clrscr(); cout<<"Enter number of rows and columns for a matrix\n"; cout<<"Enter number of rows\n"; cin>>rows; cout<<"Enter number of columns\n"; cin>>cols; matrix A(rows,cols); A.getdata(); A.display(); getch(); } Output: Enter number of rows and columns for a matrix Enter number of rows 3 Enter number of columns 3 Enter the values of the matrix Enter values for row 1 1 2 3 Enter values for row 2 4 5 6 Enter values for row 3 7 8 9 The matrix is 1 2 3 4 5 6 7 8 9 Memory deallocated successfully
{;
for(j=0;j cout< cout< } } void main() { int rows,cols; clrscr(); cout<<"Enter number of rows and columns for a matrix\n"; cout<<"Enter number of rows\n"; cin>>rows; cout<<"Enter number of columns\n"; cin>>cols; matrix A(rows,cols); A.getdata(); A.display(); getch(); } Output: Enter number of rows and columns for a matrix Enter number of rows 3 Enter number of columns 3 Enter the values of the matrix Enter values for row 1 1 2 3 Enter values for row 2 4 5 6 Enter values for row 3 7 8 9 The matrix is 1 2 3 4 5 6 7 8 9 Memory deallocated successfully
cout<
cout< } } void main() { int rows,cols; clrscr(); cout<<"Enter number of rows and columns for a matrix\n"; cout<<"Enter number of rows\n"; cin>>rows; cout<<"Enter number of columns\n"; cin>>cols; matrix A(rows,cols); A.getdata(); A.display(); getch(); } Output: Enter number of rows and columns for a matrix Enter number of rows 3 Enter number of columns 3 Enter the values of the matrix Enter values for row 1 1 2 3 Enter values for row 2 4 5 6 Enter values for row 3 7 8 9 The matrix is 1 2 3 4 5 6 7 8 9 Memory deallocated successfully
void main()
int rows,cols;
clrscr();
cout<<"Enter number of rows and columns for a matrix\n";
cout<<"Enter number of rows\n";
cin>>rows;
cout<<"Enter number of columns\n";
cin>>cols;
matrix A(rows,cols);
A.getdata();
A.display();
getch();
Output:
Enter number of rows and columns for a matrix
Enter number of rows
3
Enter number of columns
Enter the values of the matrix
Enter values for row 1
1 2 3
Enter values for row 2
4 5 6
Enter values for row 3
7 8 9
The matrix is
Memory deallocated successfully
The Best fit algorithm: The best fit method occurs the smallest free block whose size is greater than or equivalent to n. An algorithm to get such a block by traversing the whole
Simpson's Rule is a more accurate method of numerical integration than the method described in class. Using Simpson's Rule, the integral of a function f between a and b is approxim
C Program for SORTING # include stdio.h> void main() { char a; int *p; int i,j,temp; clrscr(); p=&i;
#At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with the
Please send me demo assignment,I want work
Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec
Primarily the term alignment refers the tendency of an address pointer value to be a multiple of some power of two. Thus a pointer with two byte alignment contains a zero in the le
A cl a s s c a n b e d e f i n e d i n s i d e a b l o c k o r f u n c t i o n. T h i s t yp e cla s s i s known
Introduction to C++ C++ was developed by Bjarne Stroustrup at Bell Laboratories in 1983. Originally, it was known as " C with class". C+ as an enhancement to the C language was
Is it possible to create your own header files? - Yes, it's possible to create a customized header file. - To do this, you just need to include function prototypes that you
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd