SURAJ
SURAJ
SURAJ
UTTARANCHAL UNIVERSITY
Session 2023-24
First and for most I am ever grateful to God to whom I owe my life. I would also
like to thank my parents for giving me the opportunity to study at Uttaranchal
University, Dehradun. I wish to express my deep sense of gratitude to our
Project Mentor Ms. Deepika Dua for his valuable guidance to prepare the
project and in assembling the project material. I am very thankful for his faithful
blessings and for providing necessary and related facilities required for our
computer project file.
BY
SURAJ BISHT
DECLARATION
I hereby declare that the project report titled “Cricket Score Display Project” is
submitted to Uttaranchal School of Computing Sciences. The project was done
under the guidance of Miss. Deepika Dua I further declare that the work
reported in this project has not been submitted and will not be submitted, either
in part or in full, for the award of any other degree or diploma in this university
or any other university or institute.
BY
SURAJ BISHT
CERTIFICATE OF ORIGINALITY
This is to certify that the project entitled “Cricket Score Display Project” by
Shriyank Rawat has been submitted in the partial fulfillment of the requirements
for the award of the degree of Bachelor of computer application from
Uttaranchal University, Dehradun. The results embodied in this project have not
been submitted to any other University or Institution for the record of any
degree.
Project Mentor
Miss. Deepika Dua
S.NO Topics Page no
Acknowledgement
Declaration
Certificate of originality
1 INTRODUCTION 1
2 OBJECTIVES 2
3 SYSTEM ANALYSIS 3
4 FLOWCHART 4
5 CODE 5
6 OUTPUT 13
TABLE OF CONTENT
INTRODUCTION
The main objectives of the project is to make the software fast in processing.
SOFTWARE USED:
Dev C ++
MINIMUM REQUIREMENT:
INTEL CORE 13 OR PENTIUM
4 GB RAM
SSD CAPACITY 128 GB OR HDD.
MAXIMUM REQUIREMENT:
NO LIMIT.
HARDWARE USED:
Windows 11 Home.
FLOWCHART
Source Code for Cricket Score Display Project Using C Language
#include<stdio.h>
#include<stdlib.h>
struct batsman
char name[25];
int runs,score,balls,toruns,tobal,ones,twos,threes,fours,sixes;
int max_six,max_run,max_four;
float str;
}pl1[100],pl3;
struct bowler
char name[25];
int runsgv,wkttkn,overs;
int max_w;
float econ;
}pl2[100],pl4;
int main()
int plno,choice;
int i,n,m;
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%s",pl1[i].name);
scanf("%d",&pl1[i].ones);
scanf("%d",&pl1[i].twos);
scanf("%d",&pl1[i].threes);
scanf("%d",&pl1[i].fours);
scanf("%d",&pl1[i].balls);
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%s",pl2[i].name);
scanf("%d",&pl2[i].runsgv);
scanf("%d",&pl2[i].wkttkn);
do
printf("Enter the choice:\n 1)Batsman detail:\n 2)Bowlers detail:\n 3)Match summary:\n 4)Record:\
n 5)Exit\n ");
scanf("%d",&choice);
switch(choice)
case 1:
scanf("%d",&plno);
plno--;
printf("===========================================================================\n");
printf(" Batsman runs balls fours sixes sr \n");
printf("===========================================================================\n");
pl1[plno].runs=(1*pl1[plno].ones)+(2*pl1[plno].twos)+(3*pl1[plno].threes)+(4*pl1[plno].fours)
+(6*pl1[plno].sixes);
pl1[plno].str=(pl1[plno].runs*100.00)/pl1[plno].balls;
break;
case 2:
scanf("%d",&plno);
plno--;
printf("=================================================================\n");
printf("=================================================================\n");
for(i=0;i<n;i++)
{ pl2[plno].econ=pl2[plno].runsgv/pl2[plno].overs;
}
break;
case 3:
printf("==========================================================================\n");
printf("==========================================================================\n");
for(i=0;i<1;i++)
pl1[i].runs=(1*pl1[i].ones)+(2*pl1[i].twos)+(3*pl1[i].threes)+(4*pl1[i].fours)+(6*pl1[i].sixes);
pl3.toruns+=pl1[i].runs;
pl1[i].str=(pl1[i].runs*100.00)/pl1[i].balls;
printf("TOTAL RUNS:%d\n\n",pl3.toruns);
printf("\n\n");
printf("=================================================================\n");
printf("=================================================================\n");
for(i=0;i<n;i++)
{ pl2[i].econ=pl2[i].runsgv/pl2[i].overs;
break;
case 4: pl3.max_run=0,pl4.max_w=0,pl3.max_four=0,pl3.max_six=0;
for(i=0;i<m;i++)
pl1[i].runs=(1*pl1[i].ones)+(2*pl1[i].twos)+(3*pl1[i].threes)+(4*pl1[i].fours)+(6*pl1[i].sixes);
if(pl3.max_run<pl1[i].runs)
pl3.max_run=pl1[i].runs;
if(pl3.max_six<pl1[i].sixes)
pl3.max_six=pl1[i].sixes;
if(pl3.max_four<pl1[i].fours)
pl3.max_four=pl1[i].fours;
if(pl4.max_w<pl2[i].wkttkn)
{
pl4.max_w=pl2[i].wkttkn;
break;
case 5:
exit(1);
default:
break;
}while(choice!=5);
return 0;
OUT PUT