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.
An advertising project manager developed the network diagram shown below for a new advertising campagign. In addition, the manager gathered the time information for each activity,
Run time complexity of an algorithm is depend on
HOW LINKED LIST HEADER WORKS? HOW TO INSERT AND DELETE ELEMENTS IN LINKED LIST?
what algorithms can i use for the above title in my project desing and implmentation of road transport booking system
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
why the space increase in less time programs
How divide and conquer technique can be applied to binary trees? As the binary tree definition itself separates a binary tree into two smaller structures of the similar type,
explain the prims''s algorithm with suitable example?
List various problem solving techniques. There are two techniques:- 1. Top down 2. Bottom- up
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