RAJARAMBAPU INSTITUTE OF
TECHNOLOGY’S(POLETECHNIC)LOHEGAON PUNE -411047
A PROJECT REPORT
ON
TITLE: - “REPORT ON TELEPHONE BILLING MANAGEMENT SYSTEM”
SUBMITED TO
MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION
INPARTIAL FULFILLMENT OF THE REQUIRMENTS FOR THE AWARD OF
DIPLOMA IN COMPUTER ENGNEERING
BY
1. Mahadev Sakhare
[Link] Suryavanshi
[Link] Sutar
UNDER THE GUIDANCE OF
Prof. Priyanka Kasare
DEPARTMENT OF COMPUTER ENGINEERING
RAJARAMBAPU INSTITUTE OF TECHNAOLOGY’S (POLYTECHNIC)
LOHEGAON, PUNE-411047(2019-2020)
1
RAJARAMBAPU INSTITUTE OF
TECHNOLOGY’S(POLETECHNIC)LOHEGAON PUNE -411047
CERTIFICATE
This is to certify that, the project entitled “REPORT ON SIMPLE
RESULT SYSTEM ” has been Successfully completed by “
MAHADEV SAKHARE ”, impartial fulfillment of the requirement of
Engineering Diploma Program in Computer of Maharashtra State Board
of Technical Education During Academic Year 2020-21.
Project Guide FY Co-Ordinator Principal
(Mrs. Priyanka Kasare) (Mrs. Priyanka Kasare) (Mr. S. K. Joshi)
2
RAJARAMBAPU INSTITUTE OF
TECHNOLOGY’S(POLETECHNIC)LOHEGAON PUNE -411047
CERTIFICATE
This is to certify that, the project entitled “REPORT ON SIMPLE
RESULT SYSTEM ” has been Successfully completed by “ TEJAS
SURYAVANSHI ”, impartial fulfillment of the requirement of
Engineering Diploma Program in Computer of Maharashtra State Board
of Technical Education During Academic Year 2020-21.
Project Guide FY Co-Ordinator Principal
(Mrs. Priyanka Kasare) (Mrs. Priyanka Kasare) (Mr. S. K. Joshi)
3
RAJARAMBAPU INSTITUTE OF
TECHNOLOGY’S(POLETECHNIC)LOHEGAON PUNE -411047
CERTIFICATE
This is to certify that, the project entitled “REPORT ON SIMPLE
RESULT SYSTEM ” has been Successfully completed by “ SANKET
SUTAR ”, impartial fulfillment of the requirement of Engineering
Diploma Program in Computer of Maharashtra State Board of Technical
Education During Academic Year 2020-21.
Project Guide FY Co-Ordinator Principal
(Mrs. Priyanka Kasare) (Mrs. Priyanka Kasare) (Mr. S. K. Joshi)
4
ACKNOWLEDGEMENT
We have an opportunity to express our deep sense of graduate to Prof.
Mrs. Priyanka Kasare (project guide), Department of Computer for her
valuable guidance and suggestion during the course of this project work.
Her encouragement at all stages has contribution greatly to complete this
project to work systematic manner. We thankful to prof. Mr. Vinod
Jadhav, Head of Department for his continue support to complete this
project work. We thankful to prof. Mr. Joshi S.K, principal of
Rajarambapu Institute of Technology (Polytechnic) Lohegaon, pune-
411047, for allowing us to carry out his project.
5
ABSTRACT
The main objective of the project is to provide the examination result to
the student in a simple way. This project is useful for students and
institutions for getting the results in simple manner. By a result analyzer
with subject status and marks is an application tool for displaying the
results in secure way. The system is intended for the student. And the
privileges that are provided to student are to read and execute his/here
result by providing user name and password for secure login and in case
of new student the registration is available. And the guest user has the
privilege only to [Link] whole result analyzer will be under the
control of the administrator and the admin as the full privileges to read,
write and execute the result. And admin gives the privileges to the
Teacher and student and the guest user to access the result. The student
can share or download his/here result.
6
INDEX
Sr. Topic Name Page
No. Number
1 Introduction
2 Basic Concept
3 Source Code
4 Output
5 Features
6 Advantages and Disadvantages
7 Conclusion
7
INTRODUCTION
MOTIVATION In computer science, a Designand Analysis of Algorithm is a particular way of
organizing data in a computer so that it can be used efficiently. It can implement on or more
particular Abstract Data Types (ADT), which are the means of specifying the contract of
operations and their complexity. In comparison, it is a concrete implementation of the contract
provided by an ADT. Data structures provide a means to manage large amounts of data
efficiently for uses such as large databases and internet indexing services. Usually, efficient data
structures are key to designing efficient algorithms. Some formal design methods and
programming languages emphasize data structures, rather than algorithms, as the key organizing
factor in software design. Storing and retrieving can be carried out on data stored in both main
memory and secondary memory. The implementation of a data structures usually requires
writing a set of procedures that create and manipulate instances of that structure. The efficiency
of data structure cannot be analyzed separately from those operations. This observation
motivates the theoretical concept of abstract data type, a data structure that is defined indirectly
by the operations that may be performed on it, and mathematical properties of those operations
(including their space and time cost). 1.2 Problem Definition To create a Student Result System
using ‘C’ Language involving concepts of Searching and Sorting and its analysis. This software
will contain all the necessary information regarding student’s record.
Objective of Project The objective of the project is to create a Student Result System to store the
Name, Roll no., Marks of different student using a linear data structure using C programming. In
this software one can very easily add student’s record, sort student’s record, search student’s
record, compute (using algorithms) and view all student’s records. This application stand out
among all other software in a way that it is user friendly and can be modified easily as per the
requirements. It allows user to add new/view/sort/search records.
8
BASIC CONCEPT
The purpose of the project is to present the requirement of the
Computerization of (SIMPLE RESULT SYSTEM).
Simple result system is a mini c language [Link] can look after
The students’marks and can update them any time. Subject wise marks
can be added to the students. The project is simple and easy to [Link]
order to run this project,you will first need editors like turbo c++ or code
blocks [Link] you compile &run the project you will be welcome
with a “welcome screen”.after that, you will c different option on your
computer screen. Select the desired function you want for the
modification of the project the major part of the system is handled by the
[Link] can add and delet the [Link],he can add [Link]
adding techers ,the admin can finaly give marks to [Link] the
records are saved.
9
Source Code
#include<stdio.h>
#include<conio.h>
#include<process.h>
struct student
{
int rollno;
char name[50];
int p_marks,c_marks,m_marks,e_marks,cs_marks;
float per;
char grade;
int std;
}
st;
FILE *fptr;
void write_student()
{fptr=fopen("[Link]","ab");
printf("\n please enter the new details of student\n");
printf("\n enter the roll no of student");
scanf("%d",&[Link]);
fflush(stdin);
printf("\n\nenter the name of student");
gets([Link]);
printf("\n enter the marks in physics out of100:");
scanf("%d",&st.p_marks);
10
printf("\n enter the marks in chemistry out of 100:");
scanf("%d",&st.c_marks);
printf("\n enter the marks in maths out of 100:");
scanf("%d",&st.m_marks);
printf("\n enter the marks in english out of 100:");
scanf("%d",&st.e_marks);
printf("\n enter the marks in computer science out of 100:");
scanf("%d",&st.cs_marks);
[Link]=(st.p_marks+st.c_marks+st.m_marks+st.e_marks+st.cs_marks)/5.0;
if([Link]>=60)
[Link]='a';
else if([Link]>=50 &&[Link]<60)
[Link]='b';
else if([Link]>=33 &&[Link]<50)
[Link]='c';
else
[Link]='f';
fwrite(&st,sizeof(st),1,fptr);
fclose(fptr);
printf("\n\n student record has been created");
getch();
}
void display_all()
{ clrscr();
printf("/n/n/n/t/t display all record!!!/n/n");
fptr=fopen("[Link]","rb");
while ((fread(&st,sizeof(st),1,fptr))>0)
11
{
printf("\nroll number of student:%d",[Link]);
printf("\nname of student:%s",[Link]);
printf("\nmarks in physics:%d",st.p_marks);
printf("\nmarks in chemistry:%d",st.c_marks);
printf("\nmarks in maths:%d",st.m_marks);
printf("\nmarks in english:%d",st.e_marks);
printf("\nmarks in computer science:%d",st.cs_marks);
printf("\npercentage of student is : %.2f",[Link]);
printf("\n grade of student is : %c",[Link]);
printf("\n\n================================================\n");
getch();
}
fclose(fptr);
getch();
}
void display_sp(int n)
{int flag=0;
fptr=fopen("[Link]","rb");
while ((fread(&st,sizeof(st),1,fptr))>0)
{if([Link]==n)
{ clrscr();
printf("\nroll number of student: %d",[Link]);
printf("\n name of the student : %s",[Link]);
printf("\n marks in physics : %d",st.p_marks);
printf("\n marks in chemistry : %d",st.c_marks);
12
printf("\n marks in maths : %d",st.m_marks);
printf("\n marks in english : %d",st.e_marks);
printf("\n marks in computer science: %d",st.cs_marks);
printf("\n percentage of student is : %.2f",[Link]);
printf("\n grade of student is : %c",[Link]);
flag=1;
}
}
fclose(fptr);
if (flag==0)
printf("\n\n record not exist");
getch();
}
void modify_student()
{int no,found=0;
clrscr();
printf("\n\n\t to modify");
printf("\n\n\t please enter the roll no of student");
scanf("%d",&no);
fptr=fopen("[Link]","rb+");
while((fread(&st,sizeof(st),1,fptr))>0 && found==0)
{
if([Link]==no)
{printf("\n roll no of student: %d",[Link]);
printf("\n\n name of student : %s",[Link]);
printf("\n marks in physics : %d",st.p_marks);
printf("\n marks in chemistry : %d",st.c_marks);
13
printf("\n marks in maths : %d",st.m_marks);
printf("\n marks in english : %d",st.e_marks);
printf("\n marks in computer science : %d",st.cs_marks);
printf("\n percentage of student is: %.2f",[Link]);
printf("\n grade of student is : %c",[Link]);
printf("\n please enter the new details of student\n");
printf("\n enter the roll no of student");
scanf("%d",&[Link]);
fflush(stdin);
printf("\n\n enter the name of student");
gets([Link]);
printf("\n enter the marks in physics out of 100:");
scanf("%d",&st.p_marks);
printf("\n enter the marks in chemistyr out of 100:");
scanf("%d",&st.c_marks);
printf("\n enter the marks in maths out of 100:");
scanf("%d",&st.m_marks);
printf("\n enter the marks in english out of 100:");
scanf("%d",&st.e_marks);
printf("\n enter the marks in computer science out of 100:");
scanf("%d",&st.cs_marks);
[Link]=(st.p_marks+st.c_marks+st.m_marks+st.e_marks+st.cs_marks)/5.0;
if([Link]>=60)
[Link]='a';
else if([Link]>=50 && [Link]<60)
[Link]='b';
else if([Link]>=33 && [Link]<50)
14
[Link]='c';
else [Link]='f';
fseek(fptr,-(long)sizeof(st),1);
fwrite(&st,sizeof(st),1,fptr);
printf("\n\n\t record updated");
found=1;
}
}
fclose(fptr);
if(found==0)
printf("\n\n record not found");
getch();
}
void delete_student()
{int no;
FILE *fptr2;
clrscr();
printf("\n\n\n\t delete record");
printf("\n\n please enter the roll no of student you want to delete");
scanf("%d",&no);
fptr=fopen("[Link]","rb");
fptr2=fopen("[Link]","wb");
rewind(fptr);
while((fread(&st,sizeof(st),1,fptr))>0)
{
if([Link]!=no)
{fwrite(&st,sizeof(st),1,fptr2);
15
}
}
fclose(fptr2);
fclose(fptr);
remove("[Link]");
rename("[Link]","[Link]");
printf("\n\n\t record deleted..");
getch();
}
void class_result()
{clrscr();
fptr=fopen("[Link]","rb");
if(fptr==NULL)
{
printf("ERROR!!! FILE COULD NOT BE OPEN\n\n\n go to entry menu to creat file");
printf("\n\n\n program is closing....");
getch();
exit(0);
}
printf("\n\n\t\t ALL STUDENT RESULT \n\n");
printf("==============================================================
====\n");
printf("[Link]. Name P C M E CS %age Grade\n");
printf("==============================================================
====\n");
while((fread(&st,sizeof(st),1,fptr))>0)
{
16
printf("%-6d %-10s %-3d %-3d %-3d %-3d %-3d %-3.2f %-1c\n",[Link],[Link],
st.p_marks,st.c_marks,st.m_marks,st.e_marks,st.cs_marks,[Link],[Link]);
}
fclose(fptr);
getch();
}
void result()
{int ans,rno;
char ch;
clrscr();
printf("\n\n\n result menu");
printf("\n\n\[Link] result\n\[Link] report card \n\[Link] to main menu");
printf("\n\n\n enter choice(1/2)?");
scanf("%d",&ans);
switch(ans)
{
case1 : class_result();
break;
case2 :{
do{
char ans;
clrscr();
printf("\n\n enter roll no of student :");
scanf("%d",&rno);
display_sp(rno);
printf("\n\n do you want to see more result(y/n)?");
scanf("%c",&ans);
17
} while(ans=='y' ||ans=='Y');
break;
case3 : break;
default: printf("\a");
}
}
{
clrscr();
gotoxy(35,11);
printf("student");
gotoxy(33,14);
printf("report card");
gotoxy(35,17);
printf("project");
printf("\n\n\n\n\n this project ismade by : [Link] Sakhare");
printf("\n\n [Link] Suryavanshi");
printf("\n\n [Link] Sutar");
printf("\n\n name of collage : RIT POLYTECHNIC COLLAGE PUNE");
getch();
}
}
void entry_menu()
{char ch2;
clrscr();
printf("\n\n\n\t entry menu");
printf("\n\n\[Link] student record");
18
printf("\n\n\[Link] all student record");
printf("\n\n\[Link] student records");
printf("\n\n\[Link] student record");
printf("\n\n\[Link] student record");
printf("\n\n\[Link] to main menu ");
printf("\n\n\tplease enter your choice(1-6)");
ch2=getche();
switch(ch2)
{
case '1':clrscr();
write_student();
break;
case '2':display_all();
break;
case '3':{
int num;
clrscr();
printf("\n\n\t please enter the roll no");
scanf("%d",&num);
display_sp(num);
}
break;
case '4':modify_student();
break;
case '5':delete_student();
break;
case '6':break;
19
default: printf("\a");entry_menu();
}
}
void main()
{char ch;
do
{
clrscr();
printf("\n\n\n\t main menu");
printf("\n\n\[Link] menu");
printf("\n\n\[Link]/edit menu");
printf("\n\n\[Link]");
printf("\n\n\tplease select your option(1-3)");
ch=getche();
switch(ch)
{ case '1':clrscr();
result();
break;
case '2':entry_menu();
break;
case '3':exit(0);
default:printf("\a");
}
}
while(ch!='3');
}
20
Output
1
2
3
Advantages and Disadvantages
Advantages
[Link] book management
[Link] marks and result on a single database
[Link] and manage students and declare results.
[Link] scores,percentages,and grades.
Disadvantages
[Link] student result management system is prone to hack.
[Link] technical glitches and issues.
[Link] cannot edit or modify scores after the
deadline
4
CONCLUSION
The projects clearly depicts that the Student Result System is very
efficient. It shows how the concept of File Handing can be used in
database management system in absence of databases like Oracle,
MySql etc. Although, this software can be further modified to be used as
multitasking and bigger software, but it effectively works under the
condition of limited resources and time.
