answersLogoWhite

0

AllQ&AStudy Guides
Best answer

Ján Cikker died in 1989.

This answer is:
Related answers

Ján Cikker died in 1989.

View page

Ján Cikker was born in 1911.

View page

/* Bubble sort:

code snippet only

nos to be sorted are in the array named 'n' of size 'N'

for(int i=0;i<N-1;i++)

for(int j=i+1;j<N-1-i;j++)

if(n[j]>n[j+1])

swap(n[j],n[j+1]);

*/

/*

insertion sort

int v,j;

for(int i=1;i<N;i++)

{

v=n[j];

for(int j=i-1;j>0&&n[j]>v;j--)

n[j+1]=n[j];

n[j+1]=v;

}

*/

View page

#include<stdio.h>

int main()

{

int n,i,j,k,a[10][10];

printf("\nEnter the number of nodes: ");

scanf("%d",&n);

for(i=0; i<n; i++)

{

for(j=0; j<n; j++)

{

printf("\nEnter the distance between the host %d%d:", i+1,j+1);

scanf("%d",&a[i][j]);

}

}

for(i=0; i<n; i++)

{

for(j=0; j<n; j++)

printf("%d\t",a[i][j]);

printf("\n");

}

for(k=0; k<n; k++)

{

for(i=0; i<n; i++)

{

for(j=0; j<n; j++)

{

if(a[i][j]>a[i][k]+a[k][j])

a[i][j]=a[i][k]+a[k][j];

}

}

}

for(i=0; i<n; i++)

{

for(j=0; j<n; j++)

{

b[i][j]=a[i][j];

if(i==j)

b[i][j]=0;

}

}

printf("\nThe output matrix is:\n");

for(i=0;i<n;i++)

{

for(j=0;j<n;j++)

printf("%d\t",b[i][j]);

printf("\n");

}

return 0;

}

View page

#include<iostream>

#include<stdio.h>

#include<conio.h>

using namespace std;

int main()

{

int a[20][20],b[20][20],c[20][20],i,j,k,m,n,f;

cout << "Input row and column of A matrix \n\n";

cin >> n >> m;

cout << "\n\nInput A - matrix \n\n";

for(i=0;i<n;++i)

for(j=0;j<m;++j)

cin >> a[i][j];

cout << "\n\nMatrix A : \n\n";

for(i=0;i<n;++i)

{

for(j=0;j<m;++j)

cout << a[i][j] << " ";

cout << "\n\n";

}

for(i=0;i<m;++i)

for(j=0;j<n;++j)

b[i][j]=a[j][i];

cout << "\n\nTranspose of matrix A is : \n\n";

for(i=0;i<m;++i)

{

for(j=0;j<n;++j)

cout << b[i][j] << " ";

cout << "\n\n";

}

for(i=0;i<m;i++)

{

for(j=0;j<m;j++){

c[i][j]=0;

for(k=0;k<=m;k++)

c[i][j]+=a[i][k]*b[k][j];

}

}

for(i=0;i<m;i++)

{

for(j=0;j<m;j++)

{

if((int)c[i][i]==1&&(int)c[i][j]==0)

f=1;

}

}

cout<<"\n\n Matrix A * transpose of A \n\n";

for(i=0;i<m;i++)

{

for(j=0;j<m;j++)

cout << c[i][j];

cout << "\n\n";

}

if(f==1)

cout << "\n\nMatrix A is Orthogonal !!!";

else

cout << "\n\nMatrix A is NOT Orthogonal !!!";

getch();

return 0;

}

-ALOK

View page
Featured study guide

2=4

3 cards

P

Bbbbvhubdfoisdubfpisdufbpsiufbpaedihvbedoaifhbefpihbefapivhbfeapifhabefpvihsfbvoiahfsbvoaefihbvoaefuhvbeafouhvbfeouhaebvouhraev ouafehboverajhbvuefohbfaeovihbvaeofihibfevoahibofveahboivefabohivefa

Oierjv o

โžก๏ธ
See all cards
โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…
No Reviews
More study guides
โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…
No Reviews

3.67
โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…
3 Reviews
Search results