answersLogoWhite

0

What does J J F N N J Mean?

Updated: 12/16/2022
User Avatar

Wiki User

9y ago

Want this question answered?

Be notified when an answer is posted

Add your answer:

Earn +20 pts
Q: What does J J F N N J Mean?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Engineering

Write a c programme to perform Lagrange's interpolation formula?

#include<stdio.h> #include<conio.h> #include<math.h> void main() { float x[10],y[10],temp=1,f[10],sum,p; int i,n,j,k=0,c; clrscr(); printf("\nhow many record you will be enter: " ); scanf("%d" ,&n); for (i=0; i<n; i++) { printf("\n\nenter the value of x%d: " ,i); scanf("%f" ,&x[i]); printf("\n\nenter the value of f(x%d): " ,i); scanf("%f" ,&y[i]); } printf("\n\nEnter X for finding f(x): " ); scanf("%f" ,&p); for (i=0;i<n;i++) { temp = 1; k = i; for (j=0;j<n;j++) { if (k==j) { continue ; } else { temp = temp * ((p-x[j])/(x[k]-x[j])); } } f[i]=y[i]*temp; } for (i=0;i<n;i++) { sum = sum + f[i]; } printf("\n\n f(%.1f) = %f " ,p,sum); getch(); }


C program to check whether a given matrix is orthogonal or not?

#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


C program to read and print a scalar matrix?

Here is the C program to check whether the inputted matrix is scalar matrix or not. ( its not my creation, its get from other website,am not check) #include<stdio.h> #include<conio.h> int main() { int a[10][10],i,j,m,n,f=0; printf("Enter the order of the matrix\n"); scanf("%d%d",&m,&n); printf("Enter the matrix\n"); for(i=0;i<m;i++) { for(j=0;j<n;j++) { scanf("%d",&a[i][j]); } } if(m!=n) { printf("The matrix is not identity"); } else { for(i=0;i<m;i++) { for(j=0;j<n;j++) { if((i==j&&a[i][j]!=a[0][0])(i!=j&&a[i][j]!=0)) { printf("The matrix is not scalar\n"); f=1; break; } } if(f==1) { break; } } if(f==0) { printf("The matrix is scalar\n"); } } getch(); return 0; }


Write a c plus plus program for finding the inverse of a given matrix?

#include<stdio.h> #include<math.h> float detrm(float[][],float); void cofact(float[][],float); void trans(float[][],float[][],float); main() { float a[25][25],k,d; int i,j; printf("ENTER THE ORDER OF THE MATRIX:\n"); scanf("%f",&k); printf("ENTER THE ELEMENTS OF THE MATRIX:\n"); for(i=0;i<k;i++) { for(j=0;j<k;j++) { scanf("%f",&a[i][j]); } } d=detrm(a,k); printf("THE DETERMINANT IS=%f",d); if(d==0) printf("\nMATRIX IS NOT INVERSIBLE\n"); else cofact(a,k); } /******************FUNCTION TO FIND THE DETERMINANT OF THE MATRIX************************/ float detrm(float a[25][25],float k) { float s=1,det=0,b[25][25]; int i,j,m,n,c; if(k==1) { return(a[0][0]); } else { det=0; for(c=0;c<k;c++) { m=0; n=0; for(i=0;i<k;i++) { for(j=0;j<k;j++) { b[i][j]=0; if(i!=0&&j!=c) { b[m][n]=a[i][j]; if(n<(k-2)) n++; else { n=0; m++; } } } } det=det+s*(a[0][c]*detrm(b,k-1)); s=-1*s; } } return(det); } /*******************FUNCTION TO FIND COFACTOR*********************************/ void cofact(float num[25][25],float f) { float b[25][25],fac[25][25]; int p,q,m,n,i,j; for(q=0;q<f;q++) { for(p=0;p<f;p++) { m=0; n=0; for(i=0;i<f;i++) { for(j=0;j<f;j++) { b[i][j]=0; if(i!=q&&j!=p) { b[m][n]=num[i][j]; if(n<(f-2)) n++; else { n=0; m++; } } } } fac[q][p]=pow(-1,q+p)*detrm(b,f-1); } } trans(num,fac,f); } /*************FUNCTION TO FIND TRANSPOSE AND INVERSE OF A MATRIX**************************/ void trans(float num[25][25],float fac[25][25],float r) { int i,j; float b[25][25],inv[25][25],d; for(i=0;i<r;i++) { for(j=0;j<r;j++) { b[i][j]=fac[j][i]; } } d=detrm(num,r); inv[i][j]=0; for(i=0;i<r;i++) { for(j=0;j<r;j++) { inv[i][j]=b[i][j]/d; } } printf("\nTHE INVERSE OF THE MATRIX:\n"); for(i=0;i<r;i++) { for(j=0;j<r;j++) { printf("\t%f",inv[i][j]); } printf("\n"); } }


WAP to print a wonderous square in java?

//Wondrous Square import java.io.*; class Wsq { public static void main(String args[])throws IOException { int n; BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); System.out.print("enter input:"); n=Integer.parseInt(br.readLine()); int i,j; int p[][]=new int[n][n]; System.out.print("Input The Elements:"); for(i=0;i<n;i++) { for(j=0;j<n;j++) { p[i][j]=Integer.parseInt(br.readLine()); } } int sum,sum1; sum=sum1=0; int f=0; int com=(int)(1*n*(Math.pow(n,2)+1))/2; for(i=0;i<n;i++) { for(j=0;j<n;j++) { sum=sum+p[i][j]; sum1=sum1+p[j][i]; } if((sum!=com)(sum1!=com)) { f=1; } sum=0; sum1=0; } if(f==1) { System.out.println("Not A Wondrous Square:"); } else { System.out.println("wondrous Square:"); } if(f==0) { int g=0,k; System.out.println("Prime No.\t Row \t Index:"); for(i=0;i<n;i++) { for(j=0;j<n;j++) { for(k=1;k<p[i][j];k++) { if(p[i][j]%k==0) { g++; } } if(g==1) { System.out.println(p[i][j]+"\t"+i+"\t"+j); } g=0; } } } } }

Related questions

Prime number between 1 and 100 using c program?

int main() { int i,j,n,f=0; printf("Enter the length\n"); scanf("%d",&n); for(i=2;i<=n;i++) { for(j=2;j<i;j++) { if((i%j)==0) { f=1; break; } f=0; } if(f==0) printf("%d ",i); } }


What are the violin notes for jingle bell rock?

this is not correct F F F F F F F G A G F F F G F A N D A A J B E D J I N G


Write a c programme to perform newton's divided difference formula?

#include<stdio.h> #include<math.h> int main() { float x[10],y[10][10],sum,p,u,temp; int i,n,j,k=0,f,m; float fact(int); printf("\nhow many record you will be enter: "); scanf("%d",&n); for(i=0; i<n; i++) { printf("\n\nenter the value of x%d: ",i); scanf("%f",&x[i]); printf("\n\nenter the value of f(x%d): ",i); scanf("%f",&y[k][i]); } printf("\n\nEnter X for finding f(x): "); scanf("%f",&p); for(i=1;i<n;i++) { k=i; for(j=0;j<n-i;j++) { y[i][j]=(y[i-1][j+1]-y[i-1][j])/(x[k]-x[j]); k++; } } printf("\n_____________________________________________________\n"); printf("\n x(i)\t y(i)\t y1(i) y2(i) y3(i) y4(i)"); printf("\n_____________________________________________________\n"); for(i=0;i<n;i++) { printf("\n %.3f",x[i]); for(j=0;j<n-i;j++) { printf(" "); printf(" %.3f",y[j][i]); } printf("\n"); } i=0; do { if(x[i]<p && p<x[i+1]) k=1; else i++; }while(k != 1); f=i; sum=0; for(i=0;i<n-1;i++) { k=f; temp=1; for(j=0;j<i;j++) { temp = temp * (p - x[k]); k++; } sum = sum + temp*(y[i][f]); } printf("\n\n f(%.2f) = %f ",p,sum); return 0; }


Write a c programme to perform Lagrange's interpolation formula?

#include<stdio.h> #include<conio.h> #include<math.h> void main() { float x[10],y[10],temp=1,f[10],sum,p; int i,n,j,k=0,c; clrscr(); printf("\nhow many record you will be enter: " ); scanf("%d" ,&n); for (i=0; i<n; i++) { printf("\n\nenter the value of x%d: " ,i); scanf("%f" ,&x[i]); printf("\n\nenter the value of f(x%d): " ,i); scanf("%f" ,&y[i]); } printf("\n\nEnter X for finding f(x): " ); scanf("%f" ,&p); for (i=0;i<n;i++) { temp = 1; k = i; for (j=0;j<n;j++) { if (k==j) { continue ; } else { temp = temp * ((p-x[j])/(x[k]-x[j])); } } f[i]=y[i]*temp; } for (i=0;i<n;i++) { sum = sum + f[i]; } printf("\n\n f(%.1f) = %f " ,p,sum); getch(); }


C program to check whether a given matrix is orthogonal or not?

#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


C program to read and print a scalar matrix?

Here is the C program to check whether the inputted matrix is scalar matrix or not. ( its not my creation, its get from other website,am not check) #include<stdio.h> #include<conio.h> int main() { int a[10][10],i,j,m,n,f=0; printf("Enter the order of the matrix\n"); scanf("%d%d",&m,&n); printf("Enter the matrix\n"); for(i=0;i<m;i++) { for(j=0;j<n;j++) { scanf("%d",&a[i][j]); } } if(m!=n) { printf("The matrix is not identity"); } else { for(i=0;i<m;i++) { for(j=0;j<n;j++) { if((i==j&&a[i][j]!=a[0][0])(i!=j&&a[i][j]!=0)) { printf("The matrix is not scalar\n"); f=1; break; } } if(f==1) { break; } } if(f==0) { printf("The matrix is scalar\n"); } } getch(); return 0; }


What is the next three letters in the pattern j f m a m j j a?

s o n


What letter follows the sequence j a s o n?

d j f m a


Write a small program to print all the permutations of a given number in any language of your choice length of the number is not fixed?

#include < stdio.h > #define SIZE 3 int main(char *argv[],int argc) { char list[3]={'a','b','c'}; int i,j,k; for(i=0;i < SIZE;i++) for(j=0;j < SIZE;j++) for(k=0;k < SIZE;k++) if(i!=j && j!=k && i!=k) printf("c%c\n",list[i],list[j],list[k]); return(0); } The code is very inefficient.If the length of the string is 5 then o(n) = n power 5 !!!! a more efficient code is #include<stdio.h> void f(char *,int,int); int main() { char s[]="abc"; f(s,0,2); } void f(char * a,int i,int n) { int j; char ch; if(i == n) printf("%s\n",a); else { for(j=i;j<=n;j++) { ch = a[i]; a[i] = a[j]; a[j] = ch; f(a,i+1,n); ch = a[i]; a[i] = a[j]; a[j] = ch; } } }


What are the next 3 letters in the sequence J F M A M J J A?

S, O, and N. They are the first letters of the months of the year.


What does r and f n r mean on all of Slash's logos mean?

Rock and F*ck N Roll


What has the author J Michael Popkin written?

J Michael Popkin has written: 'The N and F proposals and the Polytechnic'