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!
#include stdio.h>
#include conio.h>
#include string.h>
void main()
{
int i=0,j=0,k=0,l=0;
int a[3][3],temp[3][3];
clrscr();
for(i=0;i<3;i++)
for(j=0;j<3;j++)
a[i][j]=0;
temp[i][j]=0;
}
} i=0;j=0;
printf("ENTER THE VALUE %d %d: ",i+1,j+1);
scanf("%d",&a[i][j]);
for(k=0;k<3;k++)
for(l=0;l<3;l++)
if(a[i][j] { temp[i][j]=a[i][j]; a[i][j]=a[k][l]; a[k][l]=temp[i][j]; } } } } } printf("\nNO ARE IN ACCENDING ORDER"); printf("\n"); for(i=0;i<3;i++) { for(j=0;j<3;j++) printf("%d\t",a[i][j]); printf("\n"); } getch(); } OUTPUT : ENTER THE LIMIT OF ELEMENTS: 3 ENTER THE NO 1 : 2 ENTER THE NO 2 : 3 ENTER THE NO 3 : 4 THE EVEN NO.S ARE 2 THE ODD NO.S ARE 1 THE TOTAL OF EVEN NO IS 6 THE TOTAL OF ODD NO IS 3 THE AVG. OF ALL EVEN NO IS 3.0000 THE AVG. OF ALL ODD NO IS 3.0000
temp[i][j]=a[i][j];
a[i][j]=a[k][l];
a[k][l]=temp[i][j];
printf("\nNO ARE IN ACCENDING ORDER");
printf("\n");
printf("%d\t",a[i][j]);
getch();
OUTPUT :
ENTER THE LIMIT OF ELEMENTS: 3
ENTER THE NO 1 : 2 ENTER THE NO 2 : 3
ENTER THE NO 3 : 4
THE EVEN NO.S ARE 2 THE ODD NO.S ARE 1
THE TOTAL OF EVEN NO IS 6
THE TOTAL OF ODD NO IS 3
THE AVG. OF ALL EVEN NO IS 3.0000
THE AVG. OF ALL ODD NO IS 3.0000
Project Description: Currently seeking someone who can create me a software application (google chrome crx file_ that will auto add all shoe sizes to cart directly and if not av
Aim: To implement program to calculate area of cube using inline function. Code: inline void area_cube(float side) { float area; are
A:BinaryHeap.h ------------ #ifndef BINARY_HEAP_H_ #define BINARY_HEAP_H_ #include "dsexceptions.h" #include "vector.h" // BinaryHeap class // CONSTRUCTION: wi
A: Memory that has no pointer pointing to it and there is no method to delete or reuse this memory(object), it causes Memory leak. { Base *b = new base(); } Out of this
how is a beti a beti
A: Name mangling is the rule according to which C++ modify function's name into function signature before passing that function to a linker. It is how the linker differentiates amo
Hiding overloaded functions We cannot overload a base class function by redefining it in a derived class with a dissimilar argument list. Consider examples to see if similar fu
full program
Create a program WordCount1Main.java doing the following: For each word in the le word.txt { Create an object of the class Word { Add the object to a set of the type java.uti
A: #include // Test to see if pointer hopping is worthwhile. // strlen implemented with usual indexing mechanism. int strlen1( const char str[ ] ) { int i; for( i =
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