ΑΤΣΑΛΑΚΗ ΞΑΝΘΟΥΛΑ ΕΡΓΑΣΤΗΡΙΟ 2

Transcript

1 EXERSICE 1 #include <stdio.h> #define ROWS 20 #define COLUMNS 5 int better(int array[][columns],int rows); int main(void) int rows,grades[rows][columns],i,j,k=0,l=0; printf("\nhow many students are there in your class?\n"); scanf("%d",&rows); for(i=0;i<rows;i++) for(j=0;j<columns;j++) printf("give me the %d grade of the %d student:",i++,j++); scanf("%d",&grades[i][j]); printf("\nthe max grade is %d\n",better(grades,rows)); return 0; int better(int array[][columns],int rows) int i,j,max; max=array[0][0]; for(i=0;i<rows;i++) for(j=0;j<columns;j++) if(array[i][j]>max) max=array[i][j]; return max; [1]

2 EXERSICE 2(Bubble Sort για ταξινόμηση) #include <stdio.h> #include <string.h> #define R 5 #define C 20 int main(void) int i,j,test; char names[r][c],temp[20]; for(i=0;i<r;i++) for(i=0;i<r;i++) for(i=1;i<r;i++) printf("give the %d name :\n",i+1); gets(names[i]); puts(names[i]); for(j=r-1;j>=i;j--) if(test==-1) test=strcmp(names[j],names[j-1]); strcpy(temp,names[j]); strcpy(names[j],names[j-1]); strcpy(names[j-1],temp); [2]

3 Printf( The array sorted is \n ); for(i=0;i<r;i++) return 0; puts(names[i]); Exercise 3 #include <stdio.h> #define N 3 int symmetric(int pin[][n]); int trigonikos(int pin[][n]); int araios(int pin[][n]); int main() int i,j,a,b,c; int pinax[n][n]; printf("give the element [%d,%d] of pinax:\n",i+1,j+1); scanf("%d",&pinax[i][j]); a=symmetric(pinax); b=trigonikos(pinax); c=araios(pinax); if(a==1) printf("\no pinakas einai symmetrikos\n"); [3]

4 if(a==0) printf("\no pinakas DEN einai symmetrikos\n"); if(b==0) printf("\no pinakas DEN einai oute panw oute katw trigwnikos,einai diagwnios.\n"); if(b==2) printf("\no pinakas einai anw trigwnikos.\n"); if(b==1) printf("\no pinakas einai katw trigwnikos.\n"); if(b==3) printf("\no pinakas einai kai panw kai katw trigwnikos.\n"); if(c==1) printf("\no pinakas einai araios.\n"); if(c==0) printf("\no pinakas den einai araios\n"); return 0; int symmetric(int pin[][n]) int i,j; if(pin[i][j]!=pin[j][i]) return 0; return 1; [4]

5 int trigonikos(int pin[][n]) int i,j,count=0,count1=0,flag=0,n1; if(i>j ) if(pin[i][j]==0) count1++; if(i<j) if(pin[i][j]==0) count++; N1=((N*N)-N)/2; if(count==n1)//katw trigwnikos flag=1; if(count1==n1)//anw trigwnikos flag=2; if(count==n && count1==n1)//kai anw kai katw trigwnikos=diagwnios pinakas flag=3; return flag; [5]

6 int araios(int pin[][n]) int countzeros=0,i,j,posostozeros; if(pin[i][j]==0) countzeros++; posostozeros=(countzeros/n)*100; if(posostozeros>=80) return 1; else return 0; [6]

7 EXERCISE 4 #include <stdio.h> #include <string.h> #define R 5 #define C 30 int main() int i,j,max,thesi,sum=0,countch=0,mikos=0; char strings[r][c]; printf("***table of Strings - Names***\n\n"); for(i=0;(i<r && fgets(strings[i],c,stdin ));i++) ; if(i==r) printf("\n**table Full - input terminated \n"); for(i=0;i<r;i++) fputs(strings[i],stdout); //Euresh megistou string max=0; sum=0; for(i=0;i<r;i++) mikos=strlen(strings[i])-1; sum+=mikos; if(mikos>max) max=mikos; thesi=i; [7]

8 printf("\nto string me to megalitero mikos einai auto pou brisketai sthn %d seira \nkai einai to %s \nme mhkos %d",thesi+1,strings[thesi],max); printf("\no pinakas me ta strings periexei %d xaraktires\n",sum); return 0; EXERCISE 5 #include <stdio.h> #define N 3 int tautotikos(int pin[][n]); int main() int i,j,flag; int pinax[n][n]; printf("give the element [%d,%d] of pinax:\n",i+1,j+1); scanf("%d",&pinax[i][j]); printf("\n--emfanisi pinaka--\n"); printf("\n"); printf("%d ", pinax[i][j]); [8]

9 printf("\n"); flag=tautotikos(pinax); if (flag == 1 ) else int tautotikos(int pin[][n]) printf("einai o tautotikos pinakas\n"); printf("den einai o tautotikos pinakas \n"); int i,j,flag=1;//ypo8etw oti o pinakas einai tautotikos /* Check for unit (or identity) matrix */ for (i = 0; i < N; i++) for (j = 0; j < N; j++) if ((i==j) && pin[i][j]!= 1 ) // check an kapoio apo ta stoixeia ths diagwniou den einai 1 flag = 0; break; if( i!=j && pin[j][i]!= 0) // check an kapoio apo ta ypoloipa stoixeia den einai 0 flag=0; break; //an exei mpei se kapoia apo ta if shmainei oti den einai tautotikos giati parabiazontai oi anagkaies syn8hkes gia na einai enas pinakas tautotikos kai 8a epistrafei flag=0 [9]

10 return flag; [10]

11 EXERCISE 6 #include <stdio.h> #define N 3 int antisymmetrikos(int pin[][n]); int main() int i,j,flag; int pinax[n][n]; printf("give the element [%d,%d] of pinax:\n",i+1,j+1); scanf("%d",&pinax[i][j]); flag = antisymmetrikos(pinax); if (flag == 1 ) printf("einai antisymmetrikos pinakas.\n"); else printf("den einai antisymmetrikos pinakas.\n"); [11]

12 int antisymmetrikos(int pin[][n]) int i,j,flag=1; if (i==j) if(pin[i][j]!=0) flag = 0; else if(pin[i][j]!=-pin[j][i]) flag=0; return flag; [12]