A

Micro Project On

“Hospital Billing Management System”

Submitted By

6.Mahima Mogal.
10.Harsh Phadanis.

Under Guidance of
Mrs. M. M. Gawade

Diploma Course in Information Technology

(As per directives of I Scheme, MSBTE)

Sinhgad Institutes
Sinhgad Technical Education Society’s
SOU. VENUTAI CHAVAN POLYTECHNIC, PUNE - 411041
ACADEMIC YEAR 2022 - 2023
Maharashtra State Board of technical
Education Certificate
This is to certify that Ms.Mahima Mogal with Roll No. 6 of
Third Semester of Diploma in Information Technology of
Institute Sou. Venutai Chavan Polytechnic (Code:0040) has
successfully completed the Micro-Project in DATA
STRUCTURE (22519) for the academic year 2022-2023.

Place: SVCP, Pune Enrolment No:

2000400213

Date: Exam Seat No: 155360

Mrs.M.M.Gawade Mr. U. S. Shirshetti Dr. M. S.

Jadhav
Subject Teacher Head of Department Principal
Maharashtra State Board of technical
Education Certificate
This is to certify that Mr. Harsh Phadnis with Roll No.10 of
Third Semester of Diploma in Information Technology of
Institute Sou. Venutai Chavan Polytechnic (Code:0040) has
successfully completed the Micro-Project in DATA
STRUCTURE (22519) for the academic year 2022-2023.

Place: SVCP, Pune Enrolment No:

2000400218

Date: Exam Seat No:155364

Mrs.M.M.Gawade Mr. U. S. Shirshetti Dr. M. S.

Jadhav
Subject Teacher Head of Department Principal
 Annexure – I
Part A-Micro project proposal

A. BRIEF INTRODUCTION:
In this project, we will know a queue is a collection of entities that are maintained in a
sequence and can be modified by the addition of entities at one end of the sequence and the
removal of entities from the other end of the sequence. By convention, the end of the
sequence at which elements are added is called the back, tail, or rear of the queue, and the
end at which elements are removed is called the head or front of the queue, analogously to the
words used when people line up to wait for goods or services.
The operation of adding an element to the rear of the queue is known as enqueue, and the
operation of removing an element from the front is known as dequeue. Other operations may
also be allowed, often including a peek or front operation that returns the value of the next
element to be dequeued without dequeuing it.

B. AIM OF THE PROJECT:

The project entitled Implement relevant algorithms using Data Structures.

C. INTENTED COURSE OUTCOME:

 Perform basic operations on arrays.
 Apply different searching and sorting techniques.
 Implement basic operations on stack and queue using array representation.
 Implement basic operations on Linked List.
 Implement program to create and traverse tree to solve problems.

D. RESOURCES REQUIRED:

Name of Resource
Sr . No. Specification
Required
1 Laptop Intel (R) Core i7- 16GB RAM
2 Operating system Windows 11
3 Software Notepad, Google chrome
3. ACTION PLAN:

SR.NO. DETAIL OF ACTIVITY WEEK

1 Discussion and finalization of topic

2 Preparation and submission of Abstract

3 Literature Review

4 Collection of Data

5 Discussion and outline of Content

6 Editing and proof Reading of Content

7 Compilation of Report and Presentation

8 Final submission of Micro Project

GROUP MEMBERS:

Roll. No. Name of group members

6 Mahima vitthal mogal
10 Harsh Phadnis
 Annexure II
Part B- Micro-Project
1.Rationale

Data structure is an important aspect for Computer Engineering and Information

Technology Diploma graduates. Data structure is a logical & mathematical model of
storing & organizing data ln a particular way in a computer. The methods and
techniques of Data Structures are widely used in industries. After learning this subject
student will be able to identify the problem, analyze different algorithms to solve the
problem & choose most appropriate data structure to represent the data.

2.Course Outcome Addressed

 Perform basic operations on arrays.
 Apply different searching and sorting techniques.
 Implement basic operations on stack and queue using array representation.
 Implement basic operations on Linked List.
 Implement program to create and traverse tree to solve problems.

3.Actual Method Followed

The process for this micro project is to make a “Hospital Billing Management System”
We collect information and organize by following points:
1. Collect the information on Data Structure.
2. Show the information to faculty.
3. Learn about code.
4. First make a raw report and then correct it.
5. After all the corrections make a proposal.
6. Then prepare a project on “Hospital Billing Management System”
7. Make a program using data structure
8. Make pdf of report and print it.
9. We learn more about Data Structure

ANNEXURE III
Evaluation Sheet for the Micro Project
Academic Year: 2022-2023 Name of the Faculty: Mrs .M .M .Gawade.
Course: SYIF Course Code: 22317 Semester: Third

Title of the project: “Hospital Billing Management System”

COs addressed by Micro Project:

S. No Course Outcomes
A Perform basic operations on arrays.

B Apply different searching and sorting techniques.

C Implement basic operations on stack and queue using array representation.

D Implement basic operations on Linked List.

Implement program to create and traverse tree to solve problems

Major learning outcomes achieved by students by doing the project

(a) Practical outcome:

 INSERT and DELETE operations using queue.

(b) Unit outcomes in Cognitive domain:

 Develop program to perform the given operation on a linear queue.

Comments/suggestions about team work /leadership/inter-personal communication (if

any)

…………………………………………………………………………………………………

Marks out of 6 for Marks out of 4 for

Roll performance in performance in
No Name of the Student group activity oral/ presentation Total Marks out
(D5 Col.8) (D5 Col.9) of 10
6 Mahima mogal

10 Harsh phadanis

(Name & Signature)

 Algorithm :
Step 1: Start
Step 2: Declare structure customer
Step 3: Declare account_ no ,name, balance
Step 4: Declare void accept (struct customer , int)
Void display (struct customer , int)
Int search (struct customer ,int ,int)
Void deposite (struct customer ,int ,int ,int)
Void widraw (struct customer ,int ,int )
Step 5: Define struct customer data [20];
Step 6: Declare n, choice , account no, amount ,index;
Step 7: Read n
accept ( data ,n)
Step 8: Using switch choice
Step 9: Case 1
Display ( data, n)
Break;
Case 2
Read account no
Index = search ( data , n)
If ( index == -1)
Print record not found
Break;
Case 3
Deposite ( data , n , account no)
Break;
Case 4
Read account no ,amount
Withdraw ( data , account no , amount )
Break ;
Step 10: while ( choice ! = 0 )
Step 11: Define
Void accept ()
Void display ()
Int search ()
Void diposite ()
Void widraw ()
Step 12: Stop
 Code:
#include <stdio.h>
struct customer
{
int account_no;
char name[80];
int balance;
};

void accept(struct customer[], int);

void display(struct customer[], int);
int search(struct customer[], int, int);
void deposit(struct customer[], int, int, int);
void withdraw(struct customer[], int, int, int);

int main()
{
struct customer data[20];
int n, choice, account_no, amount, index;

printf("Hospital Billing Management System\n\n");

printf("Number of Patients records you want to enter? : ");
scanf("%d", &n);
accept(data, n);
do
{

printf("\n SVCP Hospital : \n");

printf("__________\n");
printf("Press 1 to display all records.\n");
printf("Press 2 to search a record.\n");
printf("Press 3 to patients's bill.\n");
printf("Press 4 to Total paid amount.\n");
printf("Press 0 to exit\n");
printf("\nEnter choice(0-4) : ");
scanf("%d", &choice);
switch (choice)
{
case 1:
printf("\n______________\n");
display(data, n);
printf("_____________\n");
break;
case 2:
printf("Enter Patient_id to search : ");
scanf("%d", &account_no);
index = search(data, n, account_no);
if (index == - 1)
{
printf("Record not found : ");
}
else
{
printf("\n____________\n");
printf("A/c Number: %d\nName: %s\n Remaining Bill: %d\n",
data[index].account_no, data[index].name,
data[index].balance);
printf("___________\n");
}
break;
case 3:
 printf("Enter account number : ");
scanf("%d", &account_no);
printf("Enter Patient's Bill Amount : ");
scanf("%d", &amount);
deposit(data, n, account_no, amount);
break;
case 4:
printf("Enter account number : ");
scanf("%d", &account_no);
printf("Enter amount paid : ");
scanf("%d", &amount);
withdraw(data, n, account_no, amount);
}
}
while (choice != 0);

return 0;
}

void accept(struct customer list[80], int s)

{
int i;
for (i = 0; i < s; i++)
{
printf("\nEnter data for Record #%d", i + 1);

printf("\nEnter account_no : ");

scanf("%d", &list[i].account_no);
fflush(stdin);
printf("Enter Patient_name : ");
 gets(list[i].name);
list[i].balance = 0;
}
}

void display(struct customer list[80], int s)

{
int i;

printf("\n\nA/c No\tName\tBill\n");
for (i = 0; i < s; i++)
{
printf("%d\t%s\t%d\n", list[i].account_no, list[i].name,
list[i].balance);
}
}

int search(struct customer list[80], int s, int number)

{
int i;

for (i = 0; i < s; i++)

{
if (list[i].account_no == number)
{
return i;
}
}
return - 1;
}
void deposit(struct customer list[], int s, int number, int amt)
{
int i = search(list, s, number);
if (i == - 1)
{
printf("!!Record not found!!");
}
else
{
list[i].balance += amt;
}
}

void withdraw(struct customer list[], int s, int number, int amt)

{
int i = search(list, s, number);
if (i == - 1)
{
printf("Record not found\n");
}
else if (list[i].balance < amt)
{
printf("Insufficient balance\n");
}
else
{
list[i].balance -= amt;
}
}