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
A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concate
O v e r l o a d i n g U n a r y Op e r a t o r s Us i n g F r i e n d F u n c t i o n cl a ss s i g n { i n t a ,
Is it legal for a member function to say delete this? A: As long as you're cautious, it's OK for an object to delete this. Here's how I define "cautious": You have to be a
The STL details are described in many places online (see the CS377 webpage for some links), and there's a very quick introduction in Section A.14. Here are just a few additional no
What is the difference between early binding and late binding? What are advantages of early binding? a.) Late binding refers to function calls which aren't resolved until run t
I have a Matlab assignment and I have the assignment description+ algorithm + and the output sample. the files are on a dropbox folder and you can download them from the link below
#questio#A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a string
Just need the answers to the following 3 questions. "NO NEED to write a program compile or run it, do not need it. Just need the answers for the following questions. Example quest
Develop Pidgin for Windows Project Description: I want to build Pidgin (open source instant messenger) for Windows with D-Bus support enabled. I've effectively built both
C Program for REVERSE THE STRING #include stdio.h> #include conio.h> #include string.h> void main() { char name[30]; char *s;
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