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
Normal 0 false false false EN-US X-NONE X-NONE
What is a hash function? Hash function: This is the method from the set 'K' of keys into the set 'L' of memory addresses. H: K → L These are used to verify the address
Talking to IO boards inside a computer or microcontroller depends upon the principles used by the microprocessor to address physical devices. On Motorola systems all devices connec
A palindrome is a string that reads the same from both the ends. Given a string S convert it to a palindrome by doing character replacement. Your task is to convert S to palindrome
Assume that a Binary Search Tree is constructed by repeatedly inserting exact values in to the tree. Argue that the number of nodes examined in searching for a value in the tree is
C program to demonstrate call by reference: void disp(int *,int*,int*,int*); void main() { int a=2,b=3, sum,mul; printf("Enter 1st n
explain Storage management: free storage pool, garbage collection, compaction, boundary tag method; Hash tables and hashing functions
Describe what is actual arguments? - When certain functions are created and used to perform an action on some provided values, some values are required to be passed to them. Th
E v o l u t i o n of Software: In the past stage of programming the software's were developed in Machine language Using binary numbers 1's and 0's. Later it convert
Write a algorithm to explain the processof wakingbup in morning
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