fees1

Upload: sahil-sethi

Post on 03-Apr-2018

228 views

Category:

Documents


0 download

TRANSCRIPT

  • 7/28/2019 FEES1

    1/66

    A

    PROJECT REPORT

    ON

    FEE STRUCTURE & MAINTENANCE

    Submitted to

    KURUKSHETRA UNIVERSITY, KURUKSHETRA

    IN THE PARTIAL FULFILLMENT OF THE REQUIREMENT FOR THE

    DEGREE OF BACHELOR OF COMMERCE WITH COMPUTER

    APPLICATION (3rd YEAR)

    SESSION 2011 2012

    UNDER THE SUPERVISION OF: SUBMITTED BY:

    Miss. Punita Chopra Manmeet Kaur

    (Lect. of Comp. B.Com. 3rd (CA)

    Sc. & Application.) Roll No. 1752

    University Roll No..

    HINDU GIRLS COLLEGE,

    JAGADHRI-135003

    1

  • 7/28/2019 FEES1

    2/66

    CERTIFICATE

    2

  • 7/28/2019 FEES1

    3/66

    ACKNOWLEDGEMENT

    3

  • 7/28/2019 FEES1

    4/66

    ACKNOWLEDGEMENT

    It is a matter of great of pleasure for me for submitting a project report on FEE

    STRUCTURE AND MAINTAINENCE in accordance with syllabus prescribed by

    Kurukshetra University, Kurukshetra.

    First of all, I would like to thank the god almighty who drives the colorful world

    who always shows us the right path in the life. Secondly to our parents whom we are

    greatly indebted having bought up with greatly indebted having brought up with love

    encouragement throughout our life. There is always a sense of gratitude which oneexpress to other for help and timely Service provided by them. I am thankful to those

    who have been helpful to me during training period.

    I would like to thank Dr. Mrs. Ujjwal Sharma, Principal,Hindu Girls College for

    taking interest in the completion of my project. I am deeply indebted to Mrs.

    Sonia Sharma, Head, Deptt. of Computer Sc. & Application & Miss.

    Punita Chopra Lect. Deptt. Of Comp. Sc. & App. HINDU GIRLS

    COLLEGE for providing me all the available for the complete course.

    This letter of thanks would be incomplete if I missed out the mention of my

    friends and my family members. I am very thankful to my Parents, which have been a

    constant source of inspiration for me from the very starting of my life.

    MANMEET KAUR

    4

  • 7/28/2019 FEES1

    5/66

    PREFACE

    5

  • 7/28/2019 FEES1

    6/66

    PREFACE

    Computers are using in every aspect of our life. The offices where we work, the

    stores where we shop, the schools and colleges we attend, the banks we handle our

    money even the devices we use in our home are being radically altered by computers.

    Computer usage is growing by leaps and bounds in business, industry,

    government, colleges, schools and other institutes. But at which rate the demand of the

    date is growing, India could not expertise at such rate. We have improved a lot and

    reached up to SUPER SOMPUTERS still we need more of manpower.

    All the inspirited me to join this three year degree course with computer

    Applications. As one of the subject, this course is aimed at making a student a complete

    and self-reliant programmer. We are given all the needed knowledge about the structure

    and basis of computer at the first stage, then study of the various business requirements is

    involved in this year as a subject named business data processing. Thus candidate is

    exposed to real time environment. They have to work in any institute and have to change

    a manually working system in a computerized system so that they are able to understand

    the problem arising out of such an environment.

    To make it reliable, I have used the function of find, delete, modify, and list

    because I have centralized the project completely on users Reliability and satisfaction.

    In this way, this project is complete and suitable in every manner. So realizing

    this fact and according to time demand computers are necessary achievement. So I have

    6

  • 7/28/2019 FEES1

    7/66

    to Chosen B.Com. (Computer Application). This degree course aims at providing the

    students knowledge about the various applications of computers. So it is necessary to

    jump in practical field. Hence I accepted this project, which is a part of my subject.

    Now I have completed my project. It has helped in increasing my knowledge. I

    would keep in the line with the outside world realize the need of quality maintenance

    factor.

    7

  • 7/28/2019 FEES1

    8/66

    INDEX

    8

  • 7/28/2019 FEES1

    9/66

    INDEX

    CONTENTS PAGE NO.

    Introduction to Problem Area

    Existing System

    Proposed System

    Hardware and Software Requirement

    System Design

    o Input Design

    o Output Design

    o File Design

    o DFD

    Coding

    Output & Report

    Merits of Project

    Limitation of Project

    Further scope of project

    Conclusion

    Reference

    9

  • 7/28/2019 FEES1

    10/66

    INTRODUCTION

    TOPROBLEM AREA

    10

  • 7/28/2019 FEES1

    11/66

    INTRODUCTION TO PROBLEM AREA

    For certain courses/ programs, the student have the acolyte of paying their tuition

    fee in installments as specified a from time to time. At the time of depositing fee studentmust. Counter sign on the payment receipt slip. Without counter sign the paid fee treated

    as invalid fee and no certificate issued to those candidates.

    The first installment is due from the student of the first day of the month

    following the month of the batch that the student is admitted to. Subsequent installments

    would be due on the first day of each subsequent month, irrespective of whether student

    continue with the batch or takes a break or drops out the course at any point of time.

    The installments due need to be paid on or before the tenth day of the month.

    After the 10th day, fees would be collected till the 20 th with a late fees fine of Rs.10/- per

    day. In case the 10th or the 20th of the month falls on a holiday. The next working day

    would be the last due date.

    In case of the nonpayment of the installment due by the 20 th of the month, the

    student would govern by the cancellation of admission rules.

    No fees would refundable in case a student is deemed to have dropped out or has

    taken a break.

    Library and other security deposits, if any are refundable on completion of the

    course/program and after clearance being received from the relevant authority.

    Fee, once paid shall not be refunded under any circumstances.

    11

  • 7/28/2019 FEES1

    12/66

    EXISTING SYSTEM

    12

  • 7/28/2019 FEES1

    13/66

    EXISING SYSTEM

    Firstly all this process was carried out on paper through pen, thus its a time consuming

    and difficult to maintain the records and edit too.

    Existing system are manually in which work was done by manually which requires a lot

    of man power. It is time consuming and inefficient. Firstly, all this process is carried out

    on a register through pen, which requires a lot of time. Duplicacy is the main problem

    faced in the existing system. Because of this records are entered twice which requires

    great time. In existing system records are maintain one by one student and fees limit is

    enter each student. It is very difficult.

    This system consumes longer period and results in delay. In an existing system, some

    mistakes creep in and results are not correct which leads to falsification.

    So, in the present era, world is moving on a fast track and existing system cannot

    complete the requirements of its users, with the changing world progress.

    users.

    13

  • 7/28/2019 FEES1

    14/66

    PROPOSED SYSTEM

    14

  • 7/28/2019 FEES1

    15/66

    PROPOSED SYSTEM

    The objective is to computerize the manual system or the current system to improve the

    functionality. Main objective is to provide all sorts of queries and reports which is

    required by the department. The administrator has the right to add the new record, delete

    the record, update the record etc.

    Proposed system overcomes all the problems faced in existing system. The proposed

    system fees structure is operated by the student appointed by organization or individual

    student, has made the work easier as firstly, this all process was carried out on a papers

    thus time consuming but today this process is carried through a computer who is linked to

    all the departments

    In this project if we wants add records firstly we enter the serial no. of the student , name,

    address, class, fess, course active we want to search records, deletes, modify and find the

    records.

    If we handle the system manually, a large number of man powers are required. With

    computerization system manpower may be saved. Time may also be saved. Reducing the

    time factor for payment if money, computer will do the job accurately, efficiently and in

    time up to date information may be obtained from computer any time. The output

    generated by the computer will be in tabulated from which will be understood more

    clearly. Neatly typed results will be taken hence making the reading easy. Multiple copies

    can be generated at a time, thus saving the time. In order to success any record it will

    only require to give a suitable command to the computer and the desired record will

    either be displayed on the screen or printer.

    15

  • 7/28/2019 FEES1

    16/66

    HARWARE

    &

    SOFTWARE

    REQUIREMENT

    16

  • 7/28/2019 FEES1

    17/66

    HARDWARE SOFTWARE REQUIREMENT

    2.1 HARDWARE:-

    Main Memory (RAM) -----------> 20MB

    Hard disk drive ------------------> 3GB

    Processor

    VER 2.0 REL 3.0 or greater

    2.2 SOFTWARE :-

    Operating system ------------------>.As/400

    C

    17

  • 7/28/2019 FEES1

    18/66

    SYSTEM DESIGN

    18

  • 7/28/2019 FEES1

    19/66

    INPUT DESIGN

    19

  • 7/28/2019 FEES1

    20/66

    SYSTEM DESIGN

    INPUT DESIGN

    Fees Structure & its Maintenance includes different kind of modules :-

    1) Add New Records :- This is a Module used to Store the Information of the New

    Student/ Known/ Relative and So on , Which is Very Important For Us.

    2) Modify Any Record :- This Module is used to Modify any Record which is stored

    in the Database of the Office Automation Pages.

    4) Query :- This Module give the Facility to the Person to Make the Query of the

    Student /Known/ Relative record, according to the Phone No. Wise, Name Wise,

    Location wise, Fax No Wise and so on.

    .

    20

  • 7/28/2019 FEES1

    21/66

    OUTPUT DESIGN

    21

  • 7/28/2019 FEES1

    22/66

    OUTPUT DESIGN

    First thing which must be considered while designing the project for a student one

    has to look for the output results that the student require. In our project where S.C.Place

    has allotted us the project on Fees Structure & its Maintenance. There we have to

    handle all leave accounting information regarding the no of students that are Studying in

    school and their Fees. The output design of the system is the most important aspect for

    the functional users. As a matter of fact , the complete system design effort begins with

    the idea of generating various output reports needed by the management for taking

    various decisions.

    Output from computers is required to communicate the results of processing itusers. The major concern of the user in the system design is always with the output.

    Therefore, the output design must be intangible and impelling. Going for the back, the

    system analyst would evolve suitable procedure and design the forms to capture the input

    data of the organization.

    Display Records :- This is a Module used to View the Of the all the Student/ Known/

    Relative and So on.

    Delete Any Record :- This Module is used to Delete the Any Record from the Database,

    If there is any use of the Data.

    22

  • 7/28/2019 FEES1

    23/66

    FILE DESIGN

    23

  • 7/28/2019 FEES1

    24/66

    FILE DESIGN

    While reading and writing formatted text files is very easy. It is not always the most

    efficient way to handle files. Also there will be times when you need to store unformatted

    (raw) binary data not text.

    When we open a file in a binary mode that is called binary file. When a file is in binary

    mode the data stored is different from the character format. E.g. suppose we have an int

    value in binary format. It takes space according to character in value.

    The Structure of Emp has been created in order to made entry of customers. The

    employee entery comprises of

    Following items.

    struct emp

    {

    char name[40],des[30],dep[30],add[100],type[2],reason[100];

    int id,day,ldtfr,ldtto;

    float bs;

    struct date k;

    };

    24

  • 7/28/2019 FEES1

    25/66

    DFD

    25

  • 7/28/2019 FEES1

    26/66

    DATA FLOW DIAGRAM

    26

    Applicant InputForm

    Input Student

    Information

    Student DB

    Enroll inStudent

    StudentSchedule

    Collect Fees Financial DB

    Cash Linear

  • 7/28/2019 FEES1

    27/66

    SOURCE CODE

    27

  • 7/28/2019 FEES1

    28/66

    SOURCE CODE

    #include

    #include

    #include

    #include

    #include

    #include

    struct fees

    {

    int srno,fee;

    char name[15],address[15],course[15],city[15];

    };

    void addnew();

    void modify();

    void list();

    void Delete();

    void find();

    void password();

    void main()

    {

    int ch;

    password();

    while(1)

    {

    28

  • 7/28/2019 FEES1

    29/66

    clrscr();

    gotoxy(30,5);

    printf("1.Add New");

    gotoxy(30,7);

    printf("2.List");

    gotoxy(30,9);

    printf("3.Delete");

    gotoxy(30,11);

    printf("4.Modify");

    gotoxy(30,13);

    printf("5.Find");

    gotoxy(30,15);

    printf("6.Exit");

    gotoxy(20,18);

    printf("Now please enter your choice:");

    scanf("%d",&ch);

    switch(ch)

    {

    case 1:addnew();

    break;

    case 2:list();

    break;

    case 3:Delete();

    break;

    case 4:modify();

    29

  • 7/28/2019 FEES1

    30/66

    break;

    case 5:find();

    break;

    case 6:

    clrscr();

    gotoxy(24,12);

    printf(">>");

    getch();

    exit(0);

    }

    }

    }

    void addnew()

    {

    FILE *fp;

    char ch;

    struct fees p;

    clrscr();

    fp=fopen("stud.dat","a+");

    clrscr();

    printf("\n\t\t*****************************************");

    printf("\n\t\tEnter the information for the student");

    printf("\n\t\t*****************************************");

    do

    {

    30

  • 7/28/2019 FEES1

    31/66

    printf("\n\n\n\tEnter the serial number :");

    scanf("%d",&p.srno);

    fflush(stdin);

    printf("\n\tEnter Your Name :");

    gets(p.name);

    printf("\n\tEnter Your Address :");

    gets(p.address);

    printf("\n\tEnter Your Course :");

    gets(p.course);

    printf("\n\tEnter Your Fees :");

    scanf("%d",&p.fee);

    fflush(stdin);

    printf("\n\tEnter Your City :");

    gets(p.city);

    printf("\n\n\t\tDo you want to save record[y/n]: ");

    fflush(stdin);

    ch=getchar();

    if(ch=='y'|| ch=='Y')

    {

    fwrite(&p,sizeof(p),1,fp);

    }

    printf("\n\n\t\tWould you want to enter more records[y/n]: ");

    fflush(stdin);

    ch=getchar();

    }

    31

  • 7/28/2019 FEES1

    32/66

    while(ch=='y'|| ch=='Y');

    fclose(fp);

    }

    void list()

    {

    int records=0;

    struct fees p;

    FILE *fp;

    clrscr();

    fp=fopen("stud.dat","r");

    textcolor(3);

    printf("\t\t\t\t");

    cprintf("Total Records");

    printf("\n**********************************************************

    **************************");

    cprintf("SrNo. Name Address Course Fees City");

    printf("\n**********************************************************

    **************************");

    while(fread(&p,sizeof(p),1,fp))

    {

    printf("\n%-5d",p.srno);

    printf("%-15s",p.name);

    printf("%-15s",p.address);

    printf(" %-12s",p.course);

    printf(" %6d",p.fee);

    32

  • 7/28/2019 FEES1

    33/66

    printf(" %-12s",p.city);

    records++;

    if(records==19)

    {

    printf("\n**********************************************************

    **************************");

    printf("\npress any key to continue");

    getch();

    clrscr();

    cprintf("SrNo. Name Address Course Fees City");

    printf("\n**********************************************************

    **************************");

    }

    }

    printf("\n**********************************************************

    **************************");

    printf("\t");

    cprintf("Total %d records in the list",records);

    printf("\n**********************************************************

    **************************");

    fclose(fp);

    getch();

    }

    void find()

    {

    33

  • 7/28/2019 FEES1

    34/66

    FILE *fp;

    struct fees p;

    int ch,i,record=1;

    char j[10];

    fp=fopen("stud.dat","r");

    clrscr();

    printf("\n**********************************************************

    **************************");

    printf("\n1.Serial No.\t\t\t\t\n2.Name\t\t\t\t\t\t\t\t\n3.Fees\n");

    printf("\n\t\t\tEnter your choice for finding the records");

    scanf("%d",&ch);

    switch(ch)

    {

    case 1:printf("Enter the serial number which you want to find");

    scanf("%d",&i);

    while(fread(&p,sizeof(p),1,fp))

    {

    if(i==p.srno)

    {

    printf("\n**********************************************************

    *********");

    printf("\n Name Address Course Fees City");

    printf("\n**********************************************************

    *********");

    printf("\n %-10s",p.name);

    34

  • 7/28/2019 FEES1

    35/66

    printf(" %-12s",p.address);

    printf(" %-12s",p.course);

    printf(" %-12d",p.fee);

    printf(" %-11s",p.city);

    record++;

    getch();

    }

    }

    break;

    case 2:

    printf("************************************************************

    ************************");

    cprintf("\n\t\t\t\t\t\t\t\t\t\tEnter the require name for finding");

    printf("\n**********************************************************

    **************************");

    fflush(stdin);

    gets(j);

    while(fread(&p,sizeof(p),1,fp))

    {

    if(strcmp(j,p.name)==0)

    {

    printf("\n**********************************************************

    *********");

    printf("\n Name Address Course Fees City");

    35

  • 7/28/2019 FEES1

    36/66

    printf("\n**********************************************************

    *********");

    printf("\n %-10s",p.name);

    printf(" %-12s",p.address);

    printf(" %-12s",p.course);

    printf(" %-12d",p.fee);

    printf(" %-11s",p.city);

    record++;

    getch();

    }

    getch();

    if(record%5==0)

    {

    record=0;

    printf("press any key to continue...........");

    getch();

    clrscr();

    }

    }

    break;

    case 3:

    printf("Enter the course fees which you want to find");

    scanf("%d",&i);

    while(fread(&p,sizeof(p),1,fp))

    {

    36

  • 7/28/2019 FEES1

    37/66

    if(i==p.fee)

    {

    printf("\n**********************************************************

    *********");

    printf("\n Name Address Course Fees City");

    printf("\n**********************************************************

    *********");

    printf("\n %-10s",p.name);

    printf(" %-12s",p.address);

    printf(" %-12s",p.course);

    printf(" %-12d",p.fee);

    printf(" %-11s",p.city);

    record++;

    getch();

    }

    if(record%5==0)

    {

    record=0;

    printf("press any key to continue...........");

    getch();

    clrscr();

    }

    }

    break;

    }

    37

  • 7/28/2019 FEES1

    38/66

    fclose(fp);

    }

    void modify()

    {

    FILE *fp,*ft;

    int i;

    struct fees p;

    clrscr();

    fp=fopen("stud.dat","r");

    ft=fopen("red.dat","w");

    list();

    clrscr();

    printf("\nEnter the serial number which you want to be modify");

    scanf("%d",&i);

    while(fread(&p,sizeof(p),1,fp))

    {

    if(i!=p.srno)

    {

    fwrite(&p,sizeof(p),1,ft);

    printf("Record Not Found");

    break;

    }

    else

    {

    printf("Enter the serial number");

    38

  • 7/28/2019 FEES1

    39/66

    scanf("%d",&p.srno);

    fflush(stdin);

    printf("Enter your good name ");

    gets(p.name);

    printf("Enter your course name ");

    gets(p.course);

    fflush(stdin);

    printf("Enter your fees ");

    scanf("%d",&p.fee);

    fflush(stdin);

    printf("Enter your city/capital ");

    gets(p.city);

    printf("Enter your complete address ");

    gets(p.address);

    fwrite(&p,sizeof(p),1,ft);

    printf("\n The records are modified in a proper manner");

    }

    }

    fclose(fp);

    fclose(ft);

    remove("stud.dat");

    rename("red.dat","stud.dat");

    getch();

    }

    void Delete()

    39

  • 7/28/2019 FEES1

    40/66

    {

    FILE *fp,*ft;

    int i;

    struct fees p;

    clrscr();

    fp=fopen("stud.dat","r");

    ft=fopen("red.dat","w");

    clrscr();

    printf("\nEnter the number which you want to delete");

    scanf("%d",&i);

    while(fread(&p,sizeof(p),1,fp))

    {

    if(i==p.srno)

    {

    continue;

    }

    fwrite(&p,sizeof(p),1,ft);

    }

    fclose(fp);

    fclose(ft);

    remove("stud.dat");

    rename("red.dat","stud.dat");

    }

    void password()

    {

    40

  • 7/28/2019 FEES1

    41/66

    char ch[]="kamal";

    char ch1[6],ch2;

    int i;

    clrscr();

    textcolor(4);

    printf("\n\n\n\n\n\t\t\t");

    cprintf("Enter your password");

    for(i=0;i

  • 7/28/2019 FEES1

    42/66

    gotoxy(24,12);

    printf(">>");

    getch();

    exit(0);

    }

    clrscr();

    }

    42

  • 7/28/2019 FEES1

    43/66

    OUTPUT

    43

  • 7/28/2019 FEES1

    44/66

    44

  • 7/28/2019 FEES1

    45/66

    45

  • 7/28/2019 FEES1

    46/66

    46

  • 7/28/2019 FEES1

    47/66

    47

  • 7/28/2019 FEES1

    48/66

    48

  • 7/28/2019 FEES1

    49/66

    49

  • 7/28/2019 FEES1

    50/66

    50

  • 7/28/2019 FEES1

    51/66

    51

  • 7/28/2019 FEES1

    52/66

    52

  • 7/28/2019 FEES1

    53/66

    53

  • 7/28/2019 FEES1

    54/66

    54

  • 7/28/2019 FEES1

    55/66

    55

  • 7/28/2019 FEES1

    56/66

    56

  • 7/28/2019 FEES1

    57/66

    ADVANTAGES

    OF

    PROJECT

    57

  • 7/28/2019 FEES1

    58/66

    ADVANTAGES OF PROJECTADVANTAGES OF PROJECT

    Lot of time is saved.

    Efforts of the concerned staff can be reduced.

    Speed and accuracy can be maintained.

    Redundancy can be reduced.

    Any information can easily be retrievable at any point.

    Searching problem can be removed.

    Modification of any period at any day can easily be carried out at any

    time.

    58

  • 7/28/2019 FEES1

    59/66

    LIMITATION

    OF

    PROJECT

    59

  • 7/28/2019 FEES1

    60/66

    LIMITATIONS OF THE PROJECTLIMITATIONS OF THE PROJECT

    Operator is required.

    Proper maintenance is required

    Data collected in this field are not sufficient.

    This system is applicable only in schools and colleges.

    60

  • 7/28/2019 FEES1

    61/66

    FURTHER

    SCOPE OF

    PROJECT

    61

  • 7/28/2019 FEES1

    62/66

    FURTHER SCOPE OF PROJECT

    Now we can easily say that the future of the project is quite bright in time to

    time to come and some new features. Future plan is that we will use the same database in

    networking also. And also upgrade the software with more features and good looks and

    thus can maintain all records in proper and safe manner.

    62

  • 7/28/2019 FEES1

    63/66

    CONCLUSION

    63

  • 7/28/2019 FEES1

    64/66

    CONCLUSION

    The use of computer in the process of calculating Fees of all employees helps in many

    ways, which may be described as follows: -

    It makes our work easy.

    The calculations are most accurate than manual calculations.

    So, this software not only helps in Fees Structure system but make the management easy

    to maintain and the result made is accurate.

    64

  • 7/28/2019 FEES1

    65/66

    REFERENCES

    65

  • 7/28/2019 FEES1

    66/66

    REFERENCES

    Let us c : Yashavant Kanetkar

    Programming With C : Schaum

    Data Structure in C : Robert L.Kruse

    : Bruce P.leung

    : Clovis L.Tondo