Vehicle parking management system

CHAPTER 1
INTRODUCTION

In this chapter the introduction of file structure and records is given.

1.I FILE STRUCTURES

File Structures is the Organization of Data in Secondary Storage Device in Such a way
that minimizes the access time and the storage space.
File Structure: It is a combination of
-Representation for data in files and
-The operations for accessing the data
It allows applications to read write and modify data search. An improvement in file Structure
design makes an application hundred times faster to access the data faster from the storage disk we
use file structure. Disks are slow which are used to pack Thousands of megabytes of data.

The need of File Structure:

As we know without proper structure of organizing is ordinary system, it will generate
some types of problems. So, avoiding this kind of problems we go for File Structure.
The File structure means it talks about how the system will store and access the record from
memory and also it tells how the disk perform its tasks and also how to speed up the execution of
transferring data
Data processing from a computer science prospective:

 Storage of data
 Organization of data
 Access to data
This will be built on your knowledge of Data Structures.

1
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

A file can contain:

1. Fixed-length records - all the records are exactly the same length
2. Variable-length records - the length of each record varies.
Using variable-length records might enable you to save disk space. When you use fixed-length
records, you need to make the record length equal to the length of the longest record. If your
application generates many short records with occasional long ones, using fixed-length records
wastes a lot of disk space, so o variable-length records would be a better choice.

1.2 HISTORY OF FILE STRUCTURES

Early work with files presumed that files were on tape, since most files were. Access was
sequential, and the cost of access grew in direct proportion, to the size of the file. As files grew
intolerably large for unaided sequential access and as storage devices such as hard disks became
available, indexes were added to files. The indexes made it possible to keep a list of keys and
pointers in a smaller file that could be searched more quickly. With key and pointer, the user had
direct access to the large, primary file. But simple indexes had some of the same sequential flaws
as the data file, and as the indexes grew, they too became difficult to manage, especially for
dynamic files in which the set of keys changes. In the early 1960’s, the idea of applying tree
structures emerged. But trees can grow very unevenly as records are added and deleted, resulting
in long searches requiring many disk accesses to find a record. In 1963, researchers developed an
elegant, self-adjusting binary tree structure, called AVL tree, for data in memory.

The problem was that, even with a balanced binary tree, dozens of accesses were required
to find a record in even moderate-sized files. A method was needed to keep a tree balanced 2when
each node of thee tree was not a single record, as in a binary tree, but a file block containing
dozens, perhaps even hundreds, of records. Hashing is a good way to get what we want with a
single request, with files that do not change size greatly over time. Hashed indexes were used to
provide fast access to files. But until recently, hashing did not work well with volatile, dynamic
files. Extendible dynamic hashing can retrieve information with 1 or at most 2 disk accesses, no
matter how big the file became

2
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

1.3 RECORD
A record is a collection of fields, possibly of different data types, typically in fixed number
and sequence. The fields of a record may also be called members, particularly in object-oriented
programming. Fields may also be called elements, though the risk confusion with the elements of
the collection.
For example, a data could be stored as record containing a numeric year field, a month
field represented as a string, and a numeric day-of-month field. A personnel record might contain a
name, a salary, and a rank. A circle record contains a center and a radius- in this instance, the
center itself might be represented as point record containing x and y coordinates.
Records are distinguished from arrays be the fact that their number of fields is typically
fixed, each field has a name, and that field may have a different type.
A record type is a data type that describes such values and variable. Most modern
computer languages allow the programmer to define new data record types. The definition
includes specifying the data types of each field and the identified by which it can be accessed. In
type theory, product types are generally preferred due to the simplicity, but the proper record types
are studied in languages such as System F-sub. Since type-theoretical records may contain first
class function-typed fields in addition to data, they can be express many features of object oriented
programming.
Structure, especially liked data structure. Many computer files are organized as array of
logical records, often grouped into larger physical records or block for efficiency.
Record Structures:
1. Fixed Length Record Structure: Each record is stored in fixed size. The size can be determined
by adding the maximum space occupied by each field and some space reserved for the header data.
2. Fixed Field Count: The number of the fields in each record is fixed.
3. Index Structure for Records: An index is a collection of key field and reference field.
4. Key Field: Key Field is a member of record which can uniquely identify the record.
5. Reference Field: Reference Field contains the value that points to the address of the
corresponding record in the file.

3
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

1.4 VARIABLE LENGTH RECORD

Variable-length records are the records that vary in size. It requires the creation of multiple
blocks of multiple sizes to store them. These variable-length records are kept in the following
ways in the database system:
1. Storage of multiple record types in a file.
2. It is kept as Record types that enable repeating fields like multisets or arrays
3. It is kept as Record types that enable variable lengths either for one field or more

In variable-length records, there exist the following two problems:

1Defining the way of representing a single record so as to extract the individual attributes easily
2Defining the way of storing variable-length records within a block so as to extract that record in a
block easily

Thus the representation of a variable-length record can be divided into two parts:
1. An initial part of the record with fixed-length attributes such as numeric values, dates, fixed-
length character attributes for storing their value.
2. The data for variable-length attributes such as varchar type is represented in the initial part of
the record by (offset, length) pair. The offset refers to the place where that record begins, and
length refers to the length of the variable-size attribute. Thus, the initial part stores fixed-size
information about each attribute, i.e., whether it is the fixed-length or variable-length attribute.

1.5 APPLICATION OF FILE STRUCTURES

4
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

Relative to other parts of a computer, disks are slow. 1 can pack thousands of
megabytes on a disk that fits into a notebook computer. The time it takes to get information from
even relatively slow electronic random-access memory (RAM) is about 120 nanoseconds. Getting
the same information from a typical disk takes 30 milliseconds. So, the disk access is a quarter of a
million times longer than a memory access. Hence, disks are very slow compared to memory. On
the other hand, disks provide enormous capacity at much less cost than memory.
They also keep the information stored on them when they are turned off Tension between
a disk’s relatively slow access time and its enormous, non-volatile capacity, is the driving force
behind file structure design.

5
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

CHAPTER 2
2.1 Overview Of Vehicle parking Management System :
The Vehicle Parking Management System is an innovative software solution designed to
streamline and enhance the management of vehicle parking in a variety of settings. The vehicle
parking Management System aims to address the challenges faced by establishments in effectively
organizing and controlling their parking operations. By leveraging advanced technology and a
user-friendly interface, VPMS offers a comprehensive suite of features that simplify the process of
check-in, check-out, and billing, having account of number of vehicles , and optimizing production
workflows. This report provides an overview of the key functionalities and benefits of the vehicle
parking Management System.

It highlights the importance of efficient parking management in the hospitality industry

and outlines how VPMS can contribute to improved operational efficiency, cost savings, and
customer satisfaction. The subsequent sections will delve into the specific features and capabilities
of VPMS management. Moreover, the report will also discuss the potential challenges in
implementing and adopting the system, along with recommendations for successful integration.

2.2Problem statement description:

Design and develop a comprehensive mocktail management system that addresses the
challenges faced by restaurants, and beverage establishments in efficiently managing their
mocktail recipes, inventory, pricing, and ordering processes. The system should streamline
mocktail creation, enhance inventory control, optimize pricing strategies, and facilitate seamless
communication between bartenders, management, and suppliers, ultimately improving overall
operational efficiency and customer satisfaction

6
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

CHAPTER 3

DESIGN AND DEVELOPMENT OF VEHICLE PARKING

MANAGEMENT SYSTEM USING VARIABLE LENGTH
RECORD
3.1 ABOUT THE PTOGRAMMING LANGUAGE C++
In the program “Time Complexity of Search and Traverse of a Key in secondary indexing”, we
have used C++ as a medium to compile and run the program because of its versatile uses in the
industry. It was designed with a bias toward system programming and embedded, resource
constrained and large systems, with performance, efficiency and flexibility of use as its design
highlights. C++ has also been found useful in many other contexts, with key strengths being
software infrastructure and resource-constrained applications, including desktop applications,
servers (e.g. e-commerce, web search or SQL servers), and performance-critical applications. C++
is a compiled language, with implementations of it available on many platforms. Many vendors
provide C++ compilers, including the Free Software Foundation, Microsoft, Intel, and IBM.C++ is
a powerful and versatile programming language that is widely used for developing a wide range of
applications, including system software, games, embedded systems, and high-performance
software.

Here are some key points about C++:

General Purpose Language: C++ is a general-purpose programming language, meaning
it can be used for various applications and domains. It supports both procedural and object-
oriented programming paradigms.
Derived from C: C++ was developed as an extension of the C programming language,
adding additional features such as classes, objects, and inheritance while maintaining compatibility
with C. This means that most C programs can be compiled and run as C++ programs.
Object-Oriented Programming (OOP): C++ supports the principles of object-oriented
programming, which allow you to structure your code into reusable objects. This includes
concepts like classes, objects, encapsulation, inheritance, and polymorphism.
High Performance: C++ is known for its efficiency and performance. It provides low-
level control over hardware resources and supports features like manual memory management,
inline assembly, and direct manipulation of pointers. This makes it suitable for developing
applications that require high performance, such as game engines and real-time systems.
Standard Template Library (STL): C++ includes the Standard Template Library, which
provides a collection of generic algorithms and data structures. It includes containers like vectors,
lists, maps, and algorithms like sorting, searching, and manipulating collections. The STL allows
for rapid development and code reuse.

7
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

Cross-Platform Development: C++ is widely supported on various platforms, including

Windows, macOS, Linux, and embedded systems. This enables developers to write code that can
be compiled and run on different operating systems without significant modifications.
Extensibility and Compatibility: C++ supports the use of libraries written in other
languages like C and assembly, allowing for easy integration with existing codebases. It also
provides features like function overloading, templates, and operator overloading, which contribute
to code extensibility and reusability.

3.2 ABOUT CODE::BLOCKS

Code::Blocks is a free, open-source cross-platform IDE that supports multiple compilers
including GCC, Clang and Visual C++. It is developed in C++ using wxWidgets as the GUI
toolkit. Using a plugin architecture, its capabilities and features are defined by the provided
plugins. Currently, Code::Blocks is oriented towards C, C++, and Fortran. It has a custom build
system and optional Make support
Code::Blocks is being developed for Windows and Linux and has been ported to
FreeBSD, OpenBSD and Solaris. The latest binary provided for macOS version is 13.12 released
on 2013/12/26 (compatible with Mac OS X 10.6 and later), but more recent versions can be
compiled and MacPorts supplies version 17.12.

3.3 FEATURES OF CODE::BLOCKS

 It’s completely open-source and there are no additional or hidden costs.
 It’s cross-platform meaning it will run on Linux, Mac, and Windows all the same.
 The platform is written in C++ so no additional libraries are needed.
 High usability as a courtesy of plugins.
 It’s has a really quick custom build system.
 A workspace that combines multiple projects.
 The ability to import Dev C++ projects.
 Full breakpoint support, for easier debugging.
 Syntax highlighting.
 Automatically format code to the desired style.

3.4 OPERATIONS PERFORMED ON VEHICLE PARKING MANAGEMENT

INFORMATION
The operations performed on the information are given below

 Adding the record(vehicle)

 Displaying all the records
 Search the required record
 Modify the specific record
 Deleting the required record

8
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

3.5.1 ADDING THE RECORD

Record of the vehicle parking management information consists of the fields like vehicle
Number, name of the vehicle, vehicle model, vehicle type of registration and vehicle type. New
record that should be added must contain all the fields of the record. Each vehicle record should be
having unique identity number i.e., vehicle number (VNO) Duplication of the vehicle number
(VNO) is not allowed
After successful addition of the record the record list of the vehicle can be displayed by
display function which consists of vehicle number (VNO) list

3.5.2 DISPLAYING ALL THE RECORDS

The vehicle parking management information containing the vehicle number, name of the
vehicle, vehicle model, vehicle type of registration and vehicle type is displayed and deleted
records are displayed using “*”

3.5.3 SEARCH THE REQUIRED RECORD The

required information is retrieved from the vehicle parking management information using the
variable length record. The vehicle parking management information associated with the required
vehicle or number (VNO) is displayed which consists of all the fields of the record. If there is no
entry for the required record "record not found is displayed".

9
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

3.5.4 MODIFY THE SPECIFIC RECORD

The specific record required for modifying is first searched using vehicle number (VNO) and
record details are displayed and then vehicle number, name of the vehicle, vehicle model, vehicle
type of registration and vehicle type can be updated. If there is no entry for the required record
"record not found is displayed".

3.5.5 DELETING THE EXISTING RECORD

The vehicle record desired to be deleted is using the variable length record i.e.; vehicle
number (VNO). The record associated with the vehicle number (VNO) is deleted. The deleted
record is displayed with the asterisk symbol (*) in the beginning of the record and the record list
can be displayed using display ().

10
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

CHAPTER 4

ALGORITHM AND IMPLEMENTATION

This chapter is algorithm and implementation of the vehicle parking management information using
file structure concept of variable length record.

4.1 ALGORITHM FOR INSERT FUNCTION

In addition to the vehicle type, here are some additional details you can provide to add a vehicle
to the parking management system:
1. Owner's name: The name of the vehicle owner or primary user.
2. Contact information: Contact details like phone number or email address for communication
purposes.
3. Vehicle make and model: The brand and specific model of the vehicle.
4. Vehicle color: The color of the vehicle for easy identification.
5. Vehicle registration number: The registration number assigned to the vehicle by the relevant
authorities.
6. Parking permit or tag: If applicable, any parking permits or tags associated with the vehicle.
These details will help ensure accurate registration and management of the vehicle in the parking
system.

1. Declare variables

2. Read the details with Id

3. Open the text file in input mode using fstream

4. If file does not exist, open the text file in output and append mode, write the details into the file
and close the file

5. Else fetch details from the file using temporary variables

6. While not the end of file

11
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

a. if the inputted id matches with the fetched id

b. close the file output a display message that id already exist

c. goto the beginning of insert function

7. close the file

8. Open the text file in output and append mode to write the new details

9. close the file

12
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

4.2 ALGORITHM FOR SEARCH FUNCTIONS

A search function plays a vital role in any of the programs or files. This function is basically
important to search the particular data in the file. search looks in the file within the library that we are
viewing. In our program we have used the search particular candidate. So here we are giving liberty to
the user to search any by giving three fields or parameters like name of the party, party symbol, name
and gender, id etc. So, this helps the user to find any candidate by giving any one of these field and
search. Search refers to the process of finding specific information or data within a larger set of data. It
is a fundamental operation in many applications and is commonly performed in various domains,
including web search engines, databases, file systems, and more. Search is commonly accessed through
user interfaces that allow users to enter their search queries and view the search results. These
interfaces may include search bars, filters, and pagination to refine and navigate through the
results effectively

1. Declare variables

2. Read the id to search

3. Open the text file in input mode using fstream

4. If file does not exist, call network functions

5. Else fetch the details from the file

6. While not the end of file

a. If the inputted id matches with the fetched Id

b. Display the details of inputted Id and increment the found variable

7. Close the file

8. If found equal to 0

9. Display an output message that artwork Id not found

13
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

4.3 ALGORITHM FOR DELETE FUNCTION

A delete function refers to a functionality or operation that removes or deletes data,
objects, or elements from a collection, database, file system, or any other data structure. It
allows for the removal of unwanted or obsolete data, providing data management and
organization capabilities.
Here are some key points about delete functions:
Deletion Operations: Delete functions typically involve identifying the target data or
elements to be deleted and removing them from the collection or data structure. This can
include deleting records from a database, removing files from a file system, or eliminating
objects from memory.
Criteria for Deletion: Delete functions often require specific criteria or conditions to
determine which data or elements should be deleted. For example, you may specify a
particular identifier, value, or pattern to identify the items to be deleted.
1. Declare variables

2. Read the id to delete

3. Open the text file in input mode using fstream

4. If file does not exist, call network functions

5. Else fetch the details from the file

6. While not the end of file

a. If the inputted id matches with the fetched Id

b. Display the message stating record deleted successfully and increment the found
variable

c. Else append the details into another file by opening that file in out and append mode

7. Close the file

8. Remove the old file

9. Rename the new file to old file name

14
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

10. If found equals to 0

11. Display an output message stating network not found

4.4 ALGORITHM FOR DISPLAY FUNCTION

1. Declare variables

2. Open the text file in input mode using fstream

3. If file does not exist, call network functions

4. Else fetch the details from the file

5. While not the end of file

a. Display details from fetched file

b. Then increment the found variable

6. Close the file

7. If found equals to 0

8. Display an output message stating records not found

15
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

CHAPTER-5

HARDWARE AND SOFTWARE REQUIREMENTS

5.1 Hardware Requirements:

Processor: Dual core or higher version

RAM: 4 MB or higher
Hard Disk:10 GB

5.2 Software Requirements:

Compiler: Dev C++

Operating System: Windows 10

16
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

5.3 Code snippet for vehicle management system

Code for main menu

int main()

int choice;

char ans;

system ("cls");

do {

system ("cls" ) ;
cout<<"********************************************************************"<<endl;
cout<<" VEHICLE PARKING RESERVATION SYSTEM "<<endl;
cout<<"1. Arrival of a vehicle"<<endl
cout<<"2. Total number of vehicles parked"<<endl
cout<<"3. Departure of vehicle"<<endl
cout<<"4. Total Amount collected "<<endl
cout<<"5. Display "<<endl
cout<<"6. Exit"<<endl
cout<<"********************************************************************"<<endl
cout<<"Enter your Choice : ";
cin>>choice;
switch(choice)
{
case 1: system ( "cls" ) ;
cout<<"Add : "<<endl;
veh.at(i).addVehicle();
break;
case 2: system ( "cls" ) ;
totalveh();
break;
case 3: system ( "cls" ) ;
cout<<"Departure : "<<endl
veh.at(i).deleteVehicle();
break;
case 4: system ( "cls" ) ;
totalamount();
break;
case 5: system ( "cls" ) ;
veh.at(i).show();

17
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

break;
case 6: exit(0);
}
cout<<"\n Do you want to continue, press y/n : "<<endl;
cin>>ans;
if(ans=='n')
{
break;
}
else
{ conti
nue; }
}while(1);
return 0;
}

18
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

code for adding vehicle

void vehicle::addVehicle()
{
vehicle *v = new vehicle;
cout<<"Enter vehicle type(1 for Car/2 for Bike) : ";
cin>>v->type;
cout<<"Enter vehicle number : ";
cin>>v->pltno;
cout<<"Enter arrival time in hours minutes and seconds : ";
cin>>v->arrive.hh>>v->arrive.col1>>v->arrive.mm>>v->arrive.col2>>v->arrive.ss;
cout<<"Enter date in day month and year: ";
cin>>v->dt.day>>v->dt.sym1>>v->dt.month>>v->dt.sym2>>v->dt.year;
veh.at(i).pltno=v->pltno;
veh.at(i).type=v->type;
veh.at(i).arrive.hh=v->arrive.hh;
veh.at(i).arrive.mm=v->arrive.mm;
veh.at(i).arrive.ss=v->arrive.ss;
veh.at(i).dt.day=v->dt.day;
veh.at(i).dt.month=v->dt.month;
veh.at(i).dt.year=v->dt.year;
i++;
totalvehicle++;
if(v->type == 1)
{
totalcar++;
}
else
{ tot
albike++;
} cout<<"\
nVehicle added successfully"<<endl;
}

Code for deleting a vehicle

void vehicle:: deleteVehicle()

{ str
ing pno;
int typ;
time depart;
int time_diff;
int charge=0;
cout<<"Enter vehicle type(1 for Car/2 for Bike) : ";
cin>>typ;
cout<<"Enter vehicle number : ";

19
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

cin>>pno;
cout<<"Enter departure time in hours minutes and seconds : ";
cin>>depart.hh>>depart.col1>>depart.mm>>depart.col2>>depart.ss;
for(int j=0;j<=i;j++)
{ if((veh.at(j).pltno==pno)&&(veh.at(j
).type==typ)) {
veh.at(j).departure.hh=depart.hh;
veh.at(j).departure.mm=depart.mm;
veh.at(j).departure.ss=depart.ss;
time_diff=computeTimeDifference(veh.at(j).arrive,depart);
if(veh.at(j).type== 1)
{
totalcar--;
if(time_diff<2)
{ char
ge=20;
}
else
{
if((time_diff>2) && ((time_diff<5)))
{
charge=40;
}
else
{ charg
e=50;

}
}
}
else
{ to
talbike--;
if( time_diff<2)
{
charge=5;
}
else
{ if((ti
me_diff>2) && ((time_diff<5)))
{ cha
rge=10;
}
else
{ ch

20
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

arge=20;
}
}
} cout<<"\
nVehicle having vehicle number : "<<veh.at(j).pltno<<" has left the parking after paying Rs.
"<<charge<<endl;
file.open("parkingDatabase.txt",ios::app);
if(!file)
{
cerr << "Error: file could not be opened" << endl;
exit(1);
} file<<veh.at(j).type<<"\t\t\t"<<veh.at(j).pltno<<"\t\t\
t"<<veh.at(j).dt.day<<"/"<<veh.at(j).dt.month<<"/"<<veh.at(j).dt.year<<"\t\t\t"<<
veh.at(j).arrive.hh<<":"<<veh.at(j).arrive.mm<<":"<<veh.at(j).arrive.ss<<"\t\t\
t"<<veh.at(j).departure.hh<<":"<<veh.at(j).departure.mm<<":"<<veh.at(j).departure.ss<<endl;
file.close();
veh.erase(veh.begin()+j);
i-;
totalvehicle--;
totalamt = totalamt+charge;
break;
}
if(j==i)
{ cou
t<<"\nWrong Entry , Try Again "<<endl;
cout<<"Departure : "<<endl;
deleteVehicle();
}
}

Code for printing the total vehicles

21
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

void vehicle::printvehicle(vehicle v)

cout<<v.type<<"\t\t\t"<<v.pltno<<"\t\t\t"<<v.dt.day<<"/"<<v.dt.month<<"/"<<v.dt.year<<"\t\t\t"<<
v.arrive.hh<<":"<<v.arrive.mm<<":"<<v.arrive.ss<<endl;

void vehicle::show()

cout<<"Vehicle Type\t\tVehicle Number\t\t\tDate\t\t\tArrival Time"<<endl;

for(int j=0;j<i;j++)

printvehicle(veh[j]);

void totalveh()

cout<<"Total number of vehicle parked : "<< totalvehicle<<endl;

cout<<"Total number of car parked : "<< totalcar<<endl;

cout<<"Total number of bike parked : "<< totalbike<<endl;

Code for printing total amount

22
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

void totalamount()

cout<<"Total Collection till now : "<<totalamt<<endl;

23
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

CHAPTER 6

Result and Analysis and Discussion

This chapter discusses about the result obtained during implementation.

Figure 6.1 Main Menu

This section consists of operations such as insertion , display , search , modify and
deletion of records (vehicle).

Figure 6.2 Check-in page

24
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

Figure 6.3 Insertion of vehicle record

This section consists of the fields like type of vehicle, vehicle number, arrival time, arrival
date. Each vehicle record should have a unique identity i.e., vehicle number (VNO).

Figure 6.4 Display of records

This section displays all the record details present in the file and deleted records are displayed
using “*”.

25
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

Figure 6.5 total parked vehicles count

Figure 6.6 departure of vehicles

This section checks out a vehicle by displaying the parking fare they need to pay.

Figure 6.7 Total fare collected

26
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

CHAPTER 6
CONCLUSION

In this mini project emphasis on managing the vehicle parking management using variable
length record is done. The validation of mini project is done by conducting different set of operations
like insertion, deletion, display by considering different data set. Thus, we strongly design our project
using variable length record. It is much easier and user friendly because it is organized in such a way
that variable length record strategy is used in storage compaction. Hence variable length record can be
very effective mode of operating on records

27
Department of IS&E ,PESITM ,Shivamogga
 Vehicle parking management system

REFERENCES

1. File Structures with C++ by Michael J Folk.

2. File Structures using C++ by K R Venugopal K G Srinivasa P M Krishnaraj, Tata McGraw-Hill
2009Referred Page No-4,39-40
3. https://www.programiz.com/cpp-programming/online-compiler/
4. https://www.interviewbit.com/online-cpp-compiler/
5. https://library.netapp.com/ecmdocs/ECMP1196995/html/GUID-A926B796-9C0D-4935-A84A-
D9BF291487A4.html
6. https://www.w3schools.com/CPP/default.a

28
Department of IS&E ,PESITM ,Shivamogga