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!
/* The program accepts matrix like input & prints the 3-tuple representation of it*/
#include
void main()
{
int a[5][5],rows,columns,i,j;
printf("enter the order of the matrix. The order must be less than 5 × 5:\n");
scanf("%d %d",&rows,&columns);
printf("Enter elements of the matrix:\n");
for(i=0;i for(j=0;j { scanf("%d",&a[i][j]); } printf("The 3-tuple representation of any matrix is:\n"); for(i=0;i for(j=0;j { if (a[i][j]!=0) { } Output: printf("%d %d %d\n", (i+1),(j+1),a[i][j]); } } Enter the order of the matrix. The order must be less than 5 × 5: 3 3 Enter the elements of the matrix: 1 2 3 0 1 0 0 0 4 The 3-tuple representation of the matrix is: 1 1 1 1 2 2 1 3 3 2 2 1 3 3 4 Initially the program prompted for the order of the input matrix along a warning that the order must not be greater than 5 × 5. After accepting order, this prompts for the elements of the matrix. After accepting the matrix, this checks each element of the matrix for a non zero. If the element is non zero, then this prints the row number & column number of that element along its value.
for(j=0;j { scanf("%d",&a[i][j]); } printf("The 3-tuple representation of any matrix is:\n"); for(i=0;i for(j=0;j { if (a[i][j]!=0) { } Output: printf("%d %d %d\n", (i+1),(j+1),a[i][j]); } } Enter the order of the matrix. The order must be less than 5 × 5: 3 3 Enter the elements of the matrix: 1 2 3 0 1 0 0 0 4 The 3-tuple representation of the matrix is: 1 1 1 1 2 2 1 3 3 2 2 1 3 3 4 Initially the program prompted for the order of the input matrix along a warning that the order must not be greater than 5 × 5. After accepting order, this prompts for the elements of the matrix. After accepting the matrix, this checks each element of the matrix for a non zero. If the element is non zero, then this prints the row number & column number of that element along its value.
scanf("%d",&a[i][j]);
}
printf("The 3-tuple representation of any matrix is:\n");
for(i=0;i for(j=0;j { if (a[i][j]!=0) { } Output: printf("%d %d %d\n", (i+1),(j+1),a[i][j]); } } Enter the order of the matrix. The order must be less than 5 × 5: 3 3 Enter the elements of the matrix: 1 2 3 0 1 0 0 0 4 The 3-tuple representation of the matrix is: 1 1 1 1 2 2 1 3 3 2 2 1 3 3 4 Initially the program prompted for the order of the input matrix along a warning that the order must not be greater than 5 × 5. After accepting order, this prompts for the elements of the matrix. After accepting the matrix, this checks each element of the matrix for a non zero. If the element is non zero, then this prints the row number & column number of that element along its value.
for(j=0;j { if (a[i][j]!=0) { } Output: printf("%d %d %d\n", (i+1),(j+1),a[i][j]); } } Enter the order of the matrix. The order must be less than 5 × 5: 3 3 Enter the elements of the matrix: 1 2 3 0 1 0 0 0 4 The 3-tuple representation of the matrix is: 1 1 1 1 2 2 1 3 3 2 2 1 3 3 4 Initially the program prompted for the order of the input matrix along a warning that the order must not be greater than 5 × 5. After accepting order, this prompts for the elements of the matrix. After accepting the matrix, this checks each element of the matrix for a non zero. If the element is non zero, then this prints the row number & column number of that element along its value.
if (a[i][j]!=0)
Output:
printf("%d %d %d\n", (i+1),(j+1),a[i][j]);
Enter the order of the matrix. The order must be less than 5 × 5:
3 3
Enter the elements of the matrix:
1 2 3
0 1 0
0 0 4
The 3-tuple representation of the matrix is:
1
2
3
4
Initially the program prompted for the order of the input matrix along a warning that the order must not be greater than 5 × 5. After accepting order, this prompts for the elements of the matrix. After accepting the matrix, this checks each element of the matrix for a non zero. If the element is non zero, then this prints the row number & column number of that element along its value.
Area Subdivision Method In this method, the viewport is examined for clear decisions on the polygons situated in it, in regard to their overlap and visibility to the viewer. Fo
The operations of the Symbol ADT The operations of the Symbol ADT are the following. a==b-returns true if and only if symbols a and bare identical. a symbol bin Unico
write the algorithm for adjust
Q. Explain the insertion sort with a proper algorithm. What is the complication of insertion sort in the worst case?
circular queue using c
This is the most extensively used internal sorting algorithm. In its fundamental form, it was invented by C.A.R. Hoare in the year of 1960. Its popularity lies in the easiness of i
Q. Compare and contrast various sorting techniques or methods with respect to the memory space and the computing time.
What are the Objectives of visual realism applications After studying this unit, you should be able to know specific needs of realism, add realism to pictures by el
Approximating smooth surfaces with Polygon nets Networks of polygons are used to represent smooth surfaces. They are, of course, only an approximation to the true surface, but
What is a Spanning tree of a graph? A Spanning Tree is any tree having of vertices of graph tree and some edges of graph is known as a spanning tree.
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