0
What else can I help you with?
Who was the writer of The Inspector Calls 1944-45?
'An Inspector Calls' was written by J B Priestley.
Wap to merge two arrays using c?
#include<stdio.h> void main() { int a[5],b[5]; int c[10]; int i,j,temp,k; printf("\n enter the elements of array A:=\n"); for(i=0;i<5;i++) scanf("%d",&a[i]); printf("\n enter the elements of array B:=\n"); for(i=0;i<5;i++) scanf("%d",&b[i]); for(i=1;i<5;i++) { for(j=0;j<5-i;j++) { if(a[j]>a[j+1]) { temp=a[j]; a[j]=a[j+1]; a[j+1]=temp; } } for(j=0;j<5-i;j++) { if(b[j]>b[j+1]) { temp=b[j]; b[j]=b[j+1]; b[j+1]=temp; } } } printf("\n the elements of the array A:=\n"); for(i=0;i<5;i++) printf("%d\t",a[i]); printf("\n the elements of the array B:=\n"); for(i=0;i<5;i++) printf("%d\t",b[i]); i=0,j=0,k=0; while(i<5&&j<5) { if(a[i]>b[j]) c[k++]=b[j++]; if(a[i]<b[j]) c[k++]=a[i++]; } if(i<5&&j==5) while(i<5) c[k++]=a[i++]; if(i==5&&j<5) while(j<5) c[k++]=b[j++]; printf("\n the elements of the sorted merged array C:=\n"); for(i=0;i<10;i++) printf("%d\t",c[i]); }
Write a c program to merge two array?
#include <stdio.h> #include <conio.h> void main(){ int a[10],b[10],c[10],i,j,m,n,tmp,k; printf("\nEnter the size of the 1st array:"); scanf("%d",&m); printf("\nEnter the size of the 2nd array:"); scanf("%d",&n); printf("\nEnter the 1st array values:"); for(i=0;i<m;i++){ scanf("%d",&a[i]); } printf("\nEnter the 2nd array values:"); for(i=0;i<n;i++){ scanf("%d",&b[i]); } for(i=0;i<m;i++) { for(j=0;j<m-i;j++) { if(a[j]>a[j+1]) { tmp=a[j]; a[j]=a[j+1]; a[j+1]=tmp; } } } printf("\n\n Array in the ascending order is - \n"); for(i=0;i<m;i++) { printf("\t %d",a[i]); } for(i=0;i<n;i++) { for(j=0;j<n-i;j++) { if(b[j]>b[j+1]) { tmp=b[j]; b[j]=b[j+1]; b[j+1]=tmp; } } } printf("\n\n Array in the ascending order is - \n"); for(i=0;i<n;i++) { printf("\t %d",b[i]); } i=j=k=0; while(i<n&&j<m) { if(a[i]<b[j]) c[k++]=a[i++]; else if(a[i]>b[j]) c[k++]=b[j++]; else { c[k++]=b[j++]; i++; j++; } } if(i<n) { int t; for(t=0;t<n;t++) c[k++]=a[i++]; } if(j<m) { int t; for(t=0;t<m;t++) { c[k++]=b[j++]; } } printf("\nFinally sorted join array is:"); for(k=0;k<(m+n);k++) printf("\t\n %d ",c[k]); getch(); }
Program to find the Transpose of matrix using function?
#include<stdio.h> void transpose(int a[50][50]); void main() { int a[50][50],b[50][50],m,n,i,j; scanf("%d",&m,&n); for(i=0;i<m;i++) { for(j=0;j<n;j++) { scanf("%d",&a[i][j]); } } for(i=0;i<n;i++) { for(j=0;j<m;j++) { scanf("%d",&b[i][j]); } } transpose(a,b,m,n) void transpose(int a[50][50],int b[50][50],int m,int n) { int i; for(i=0;i<m;i++) { for(j=0;j<n;j++) { b[i][j]=a[i][j]; } } }
What four elements are factors determining when one can expect a rise in nativism?
loljbjhb j b b k , , ,bn bn j hj j
What are the songs on Good Charlotte Cardiology?
No. Title Lyrics Music Length 1. "Introduction to Cardiology" Benji Madden B. Madden 0:47 2. "Let the Music Play" B. Madden, Joel Madden, Don Gilmore B. Madden 4:12 3. "Counting the Days" B. Madden, J. Madden B. Madden, John Feldmann 2:51 4. "Silver Screen Romance" B. Madden, J. Madden, Gilmore B. Madden 3:10 5. "Like It's Her Birthday" B. Madden, J. Madden, Gilmore B. Madden 3:30 6. "Last Night" B. Madden, J. Madden, Gilmore B. Madden, Gilmore 3:40 7. "Sex on the Radio" B. Madden, J. Madden, Sam Hollander, Dave Katz B. Madden 3:16 8. "Alive" B. Madden, J. Madden, Gilmore B. Madden 3:14 9. "Standing Ovation" B. Madden, J. Madden, Feldmann B. Madden, Feldmann 3:39 10. "Harlow's Song (Can't Dream Without You)" J. Madden, B. Madden, Luke Walker J. Madden 3:34 11. "Interlude: The Fifth Chamber" B. Madden, J. Madden, Gilmore 1:29 12. "1979" B. Madden, J. Madden B. Madden, Matt Squire 2:59 13. "There She Goes" B. Madden, J. Madden, Noel Fisher B. Madden, Fisher 3:22 14. "Right Where I Belong" B. Madden, J. Madden B. Madden, Squire 3:52 15. "Cardiology" B. Madden, J. Madden, Walker B. Madden 2:56
What is the answer to the vision test on the last question?
THE ANSWER IS B NOT j BUT B
How do you Write a C program for matrix addition?
for (i=0; i<IMAX; i++) for (j=0; j<JMAX; j++) c[i,j] = a[i,j] + b[i,j];
Write a java program add two square matrices?
import java.io.*; import java.math.*; public class addmatrices { public static void main(String args[]) { int a[][]={{2,3},{4,5}}; int b[][]={{3,4},{5,2}}; int c[][]={{0,0},{0,0}}; int i,j; System.out.println("matrix A:") for(i=0;i<2;i++) { for(j=0;j<2;j++) { System.out.println(""+a[i][j]); } System.out.println(); } System.out.println("matrix B:"); for(i=0;i<2;i++) { for(j=0;j<2;j++) { System.out.println(""+b[i][j]); } System.out.println(); } System.out.println("Add Two Matrices"); for(i=0;i<2;i++) { for(j=0;j<2;j++) { c[i][j]=a[i][j]+b[i][j]; System.out.println(""+c[i][j]); } System.out.println(); } } }
When did J. B. S. Haldane die?
J. B. S. Haldane died on December 1, 1964 at the age of 72.
How do you write a program in Java to multiply two matrix?
class Array58 { public static void main(String[] args) { int i,j,k; int [][] a={{1,2,3},{4,5,6},{7,8,9}}; int [][] b={{9,8,7},{6,5,4},{3,2,1}}; int [][]c=new int[3][3]; for (i=0;i<a.length;i++) { for (j=0;j<a[i].length;j++) { System.out.print(a[i][j]+" "); } System.out.println(" "); } System.out.println(" "); for (i=0;i<b.length;i++ ) { for (j=0;j<b[i].length;j++) { System.out.print(b[i][j]+" "); } System.out.println(" "); } System.out.println(" "); for(i=0;i<a.length;i++) { for(j=0;j<b.length;j++) { c[i][j]=0; for(k=0;k<a.length;k++) { c[i][j]+=a[i][k]*b[k][j]; } System.out.print(c[i][j]+" "); } System.out.println(" "); } } }
Source code in c project on HR management?
void main() { int array[10]; int i, j, N, temp; int findmax(int b[10], int k); /* function declaration */ void exchang(int b[10], int k); clrscr(); printf("Enter the value of N\n"); scanf("%d",&N); printf("Enter the elements one by one\n"); for(i=0; i { scanf("%d",&array[i]); } printf("Input array elements\n"); for(i=0; i { printf("%d\n",array[i]); } /* Selection sorting begins */ exchang(array,N); printf("Sorted array is...\n"); for(i=0; i< N ; i++) { printf("%d\n",array[i]); } } /* End of main*/ /* function to find the maximum value */ int findmax(int b[10], int k) { int max=0,j; for(j = 1; j <= k; j++) { if ( b[j] > b[max]) { max = j; } } return(max); } void exchang(int b[10],int k) { int temp, big, j; for ( j=k-1; j>=1; j--) { big = findmax(b,j); temp = b[big]; b[big] = b[j]; b[j] = temp; } return; }
