VISVESVARAYA TECHNOLOGICAL UNIVERSITY

BELAGAVI, KARNATAKA, INDIA

A MINI-PROJECT REPORT
ON

“SEMINAR HALL MANAGEMENT

SYSTEM”
Submitted in partial fulfillment of the requirement for the VI semester BE in
Information Science and Engineering
FS mini-project-18ISL67

Submitted by

SADVI H D [1SG18IS088]
SAHANA A [1SG18IS089]

Under the guidance of

Prof. Chaithra B M
Assistant Professor
Dept. Of ISE, SCE

DEPARTMENT OF INFORMATION SCIENCE & ENGINEERING

SAPTHAGIRI COLLEGE OF ENGINEERING
Bengaluru-57
2020-21
 SAPTHAGIRI COLLEGE OF ENGINEERING
14/5, Chikkasandra, Hesaraghatta Main Road, Bengaluru-560057
[AFFILIATED TO VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELAGAVI]

Department of Information Science & Engineering

CERTIFICATE
Certified that the project work entitled “SEMINAR HALL MANAGEMENT

SYSTEM” carried out by SADVI H D [1SG18IS088], SAHANA A [1G18IS089]

bonafide students of 6th semester, department of Information Science & Engineering carried
out at our college Sapthagiri College of Engineering, Bengaluru in partial fulfillment for the
6th Semester BE, FILE STRUCTURES Mini-Project- 18ISL67/17ISL68 by Visvesvaraya
Technological University, Belagavi during the year 2020-21. It is certified that all
corrections/suggestions indicated for Internal Assessment have been incorporated in the Report
deposited in the departmental library. The project report has been approved as it satisfies the
academic requirements in respect of Project work prescribed for the said Degree.

Signature of the Guide Signature of the HOD

Prof. Chaithra B M Dr. H R Ranganatha
Assistant Professor Head of Dept, ISE

External Viva
Name of the Examiners Signature of the Examiners with date
1. …....…........................ 1. …........................................
2. …....…........................ 2. …........................................
 ABSTRACT

This system is an “SEMINAR HALL BOOKING MANAGEMENT” software projects.

It includes all the features and functions needed to efficiently manage a seminar hall. It
includes administrator account which is used to handle/control all the system functionality.
The system keeps track of seminar hall status and advance bookings. The system keeps
records of seminar hall bookings along with associated event details and user contacts in
a well-maintained database. The administrator can easily check the seminar hall bookings
and timings in the system GUI. The system also allows notifies when a new event timing
draws near. Each department has the username and password to book the seminar hall for
their requirement.

Through this they can view the available dates of particular seminar hall and also
the facilities in the hall like capacity, mic’s, projector, markerboard etc. This provides
user-friendly environment while booking the seminar hall it gives suggestion
regarding the selection of seminar hall based on the capacity and availability. The
concern department head can view the list of the request. The acceptance and rejection
can be viewed by the user through that log in or even by the email id.

i
 ACKNOWLEDGEMENT

Any achievement doesn’t depend solely on the individual efforts but on the guidance,
encouragement and co-operation of intellectuals, elders and friends. A number of personalities
have helped us. We would like to take this opportunity to thank them all.

We would like to express our heart-felt gratitude to Dr. H. Ramakrishna, Principal, Sapthagiri
College of Engineering, Bengaluru, for his help and inspiration during the tenure of the course.

It is great privilege to extend our deep sense of gratitude to Dr. H R Ranganatha, Head of
the Department, Information Science and Engineering, Sapthagiri College of Engineering,
Bengaluru, who patronized throughout our career, for his constant support and encouragement
and for the facilities provided to carry out this work successfully.

We wish to express our sincere thanks to our guide Prof. Chaithra B M, Assistant Professor,
Department of Information Science and Engineering, Sapthagiri College of Engineering,
Bengaluru for helping us throughout and guiding us from time to time. We also extend our
sense of gratitude and sincere thanks to non-teaching staff members of Information Science
and Engineering, Sapthagiri College of Engineering, Bengaluru for their views and
encouraging ideas.

Finally, we also thank our family and friends for their co-operation and motivation.

SADVI H D (1SG18IS088)
SAHANA A (1SG18IS089)

ii
 TABLE OF CONTENTS

Chapter no Chapter Name Page no

1 INTRODUCTION 01
1.1 INTRODUCTION TO FILE STRUCTURES 01
1.2 HISTORY 02
1.3 ABOUT THE FILE 02
1.4 VARIOUS STORAGE KIND OF FIELDS 03
1.5 APPLICATION OF THE FILE STRUCTURE 04

2 SYSTEM ANALYSIS 06
2.1 ANALYSIS OF APPLICATION 06
2.2 ARCHITECTURE 06
2.3 OPERATION PERFORMED ON A FILE 07

3 SYSTEM DESIGN 09
3.1 DESIGN OF THE FIELDS AND RECORDS 09
3.2 INDEXING 10

4 IMPLEMENTATION 14
4.1 ABOUT JAVA AND JAVAFX 14
4.2 PSEUDO CODE 14
4.3 INSERTION MODULE PSEUDO CODE 14

5 SYSTEM TESTING 17

SNAPSHOTS 19

CONCLUSION AND FUTURE ENHANCEMENT 26

REFERENCES 27

iii
Figure Name of the figure Page
no no

4.4 Testing table 18

5.1 Login records 19

5.2 Write function 20

5.3 Data and index file 20

5.4 Display function 21

5.5 Search function 21

iv
SEMINAR HALL MANAGEMENT SYSTEM

CHAPTER 1

INTRODUCTION

1.1 Introduction To File Structure

File Structures is the Organization of Data in Secondary Storage Device in such a way that
minimizes the access time and the storage space. A File Structure is a combination of
representations for data in files and of operations for accessing the data. File Structure allows
applications to read, write and modify data. It also supports finding the data that matches some
search criteria or reading through the data in some particular order. An improvementin file
structure design may makes an application hundreds of time faster. The details of the
representation of the data and the implementation of the operations determine the efficiency
of the file structure for particular applications.
The goal of File Structure is to get the information we need with one access to the disk. If
it is not possible, then get the information with as few accesses as possible. Group information
so that we are likely to get everything we need with only one trip of the disk. It is relatively
easy to come up with File Structure designs that meet the general goals when the files never
change. When files grow or shrink when information is added and deleted, it is much more
difficult.
Goal of this course is with reference to time and space is to first minimize number of trips
to the disk in order to get desired information. Ideally get what we need in one disk access or
get it with as few disk accesses as possible. Secondly grouping related information so that we
are likely to get everything we need with only one trip to the disk for example name, address,
phone number, account balance.
Good File Structure design must have:

➢ Fast access to great capacity.

➢ Reduce the number of disk accesses

➢ By collecting data into buffers, blocks or buckets.

➢ Manage growth by splitting these collections

Department of ISE, CSE 2020-21 Page 5

SEMINAR HALL MANAGEMENT SYSTEM
1.2 History

➢ History of File Structure design, in the beginning the file access was sequential, and
the cost of access grew in direct proportional to the size of the file. So Indexes were
addedto files.
➢ Indexes made it possible to keep a list of keys and pointers in a smaller file that could
be searched more quickly
➢ Simple indexes become difficult to manage for dynamic files in which the set of keys
changes. Hence Tree Structures were introduced.

➢ Trees grew unevenly as records were added and deleted, resulting in long searches
requiring multiple disk accesses to find a record. Hence an elegant, self-adjusting
binary tree structure called an AVL Tree was developed for data in memory.

➢ Even with a balanced binary tree, dozens of accesses were required to find a record in
moderate sized files.
➢ A method was needed to keep a tree balanced when each node of the tree was not a
single record as in a binary tree, but a file block containing hundreds of records. Hence
B-trees were introduced.
➢ AVL trees grow from top down as records are added, B-trees grow from the bottom up.

➢ B-trees provided excellent access performance but, a file could not be accessed
sequentially with efficiency.

➢ The above problem was solved using B+ tree which is a combination of a B-tree
and asequential linked list added at the bottom level of the B-tree.

➢ To further reduce the number of disk accesses, Hashing was introduced for files
that donot change size greatly overtime.

1.3 About the file

A File is an object on a computer that stores data, information, settings, or commandsused

with a computer program. In a graphical user interface such as Microsoft Windows, files
display as icons that relate to the program that opens the file. For example, the picture is an
icon associated with adobe acrobat PDF files, if the file was on your computer, double clicking
the icon in Windows would open that file in adobe acrobat or the PDF reader installed on the
computer. A File is created using a software program on the computer.

Department of ISE, CSE 2020-21 Page 6

SEMINAR HALL MANAGEMENT SYSTEM
For example, to create a text file we use text editor, to create an image file we use an image
editor, and to create a document we use a word processor.
Files are not made for just reading the contents; we can also perform some operations on
the Files.

➢ Read operation: Meant to read the information which is stored into the files.

➢ Write operation: For inserting some new contents into a file.

➢ Rename or change the Name of the file.

➢ Copy the file from one location to the other.

➢ Sorting or arrange the contents of the file.

➢ Move or cut the file from one place to another.

➢ Delete a file.

➢ Execute Means to Run means File Display Output.

We can also link a file with any other File. These are also called Symbolic Links, in the
symbolic links all the files are linked by using some text Alias.

1.4 Various storage kind of fields and records

Field Structures:

There are many ways of adding structure to files to maintain the identity of fields. Four
mostcommon methods follow:
Method 1: Force the fields into a predictable length. Fix the length of fields. The fields of
thefile vary in length to make the fields fixed length we have to predict lengths.
Method 2: Begin each field with a length Indicator; store the field length just ahead of the
field.
Method 3: Place a delimiter at the end of each field to separate it from the next field.
Method 4: Use a “keyword = Value” expression to identify each field and its contents.

Department of ISE, CSE 2020-21 Page 7

SEMINAR HALL MANAGEMENT SYSTEM
Record Structures:

A record can be defined as a set of fields that belong together when the file is viewed
interms of a higher-level organization. Five most common methods follow:

Method 1: Make the records be a predictable number of bytes in

length.Method 2: Make the record be a predictable number of fields in
length.
Method 3: Begin each record with a length indicator consisting of a count of the number of
bytes that the record contains.
Method 4: Use a second file to keep track of the beginning byte address for each record.
Method 5: Place a delimiter at the end of each record to separate it from the next record.

1.5 Application of file structure

Amaze file manager:

Amaze File Manager is a newer app comparatively speaking and it’s a pretty good. It’s
open source and focuses on as lighter experience for those who just need to do some light file
browsing. It features Material Design, SMB file sharing, a built-in app manager to uninstall
apps, root explorer, and more. It manages to include the most important stuff without feeling
bloated. It’s free to download and use with optional in-app purchases in case you want to help
fund development.
Asus file manager:

It’s not every day we see on OEM app make an app list, but File Manager by ASUS is
actually really good. It’s compatible with most devices, even non-ASUS ones. You’ll also get
clean, simple interface with LAN and SMB support, could storage support, support for various
types of files, archiving support, and more. It’s entirely free with no in-app purchases and
provides a great experience for a simple file browser. About the only negative part is the lack
of root access.

ES file explorer pro:

ES File Explorer has been around as long as most Android nerds can remember and comes
with pretty much every feature you can ask for in a file browser. A while back, it was
purchased by another company. Since then, things haven’t gone well. The free version of the

Department of ISE, CSE 2020-21 Page 8

SEMINAR HALL MANAGEMENT SYSTEM
app, while very capable, now has a ton of added bloat ware that not only doesn’t add to the
experience, but activity subtracts from it. Thankfully, the pro version of the app doesn’t have
these features.

File manager:

File Manager is blandly named, but it’s actually quite good. It’s a newer file manager app
that gives you one of the best sets of features without adding too much bloat. You’ll get basic
file management features along with cloud storage features, NAS support, and more.

MK explorer:

MK Explorer is another newer file manager option. It’s a simple option that doesn’t have
a whole lot of flair. That is extremely preferable if you really just want something simple. It
features a Material Design interface, the basic file management features (copy, paste, delete,
SD Card support for Lollipop), and root access. There are also support for 20 languages and
it has a built-in text editor, gallery, and music player. It doesn’t have anything like cloud
storage or network storage support, but that’s not really what it’s for. It’s a good, cheap option.

X-Plore file manager:

X-Plore file Manager is one of the more unique options on the list. It’s a forced dual-
pane app which means you’ll be managing two windows at once pretty much all the time.
This is kind of cool if you’re copy/pasting between folders or need to move files quickly.
Italso comes with support for various types of files, cloud storage, network storage, a built-

in hex editor, root support and plenty of other features.

Department of ISE, CSE 2020-21 Page 9

SEMINAR HALL MANAGEMENT SYSTEM
CHAPTER 2

SYSTEM ANALYSIS
2.1 Analysis of The Application
To design and develop an online SEMINAR HALL booking application which will
allow internal users and external users also to book SEMINAR HALL as per their
expected event schedules. Any user internal or external has to raise a request for SEMINAR
HALL booking and it will be approved by admin. A logged in user can check availability
date wise and hourly wise too. Will have the option to provide the hourly availability info
too while raising the request. Once approved an email notification can be sent over
confirming the booking, we can also send SMS notification. The home page of the
system shows the available seminar halls details on particular dates, after user’s book
the venue then all the details can be visible on the screen that the seminar hall name,
number, date, time, etc. The main aim of developing this seminar hall or function hall
booking system project is to provide online seminar hall booking platform to the students
in their colleges or schools or universities. This seminar-hall booking project is developed
with C++.

2.2 Architecture
Seminar hall booking is a very simple C++ project. It uses very simple file handling
operations to make up the whole project; these include adding, deleting, searching, listing and
modifying records, to or from file. To make this simple Seminar-hall booking management
system project in C++ better, graphics has been effectively utilized throughout. The source
code of this project is not too long. It is complete, totally error-free and easy to understand.

Seminar hall booking system helps to reduce manual process of reservation and getting
approvals and this helps in efficient management of availability and bookie details. System
helps to edit, update the details and shows the information of bookings. Faculties can search
based on event, location, category. When a faculty searches for venues the search must contain
the detailed information (booked details, name of the event) and also its availability within
choosing check in and checkout date. It helps reduce the time spent in searching for authorized
persons and unreserved halls can be utilized in a better way to avoid repetition by using
seminar hall booking system. The role of seminar hall in-charge is to check the request came
to the seminar hall. When in-charges login into their account the list of new requests are
displayed in their page as shown. The request can be either accepted or rejected based on the
Department of ISE, CSE 2020-21 Page 10
SEMINAR HALL MANAGEMENT SYSTEM
priority of the request. It provides the searching facilities based on various factors such as
booking, time and availability of halls. It helps to find the bookie details and shows the
information of booked halls. The admin can track all the information about reservations and it
is highly authenticate.

2.3 Operation Performed On A File

The files are used to store the required information for its later uses. There are many
fileoperations that can be perform by the computer system.

Here are the list of same common file operation:

• File Create operation

• File Delete operation

• File Open operation

• File Create operation

• File Close operation

• File Read operation

• File Write operation

• File Search operation

• File Append operation

File Create operation

• The file is created with no data.

• The file create operation is the first step of the file.

• Without creating any file, there is no any operation can be performed.

File Delete operation

•File must has to be deleted when it is no longer needed just to free up the
diskspace.
•The file delete operation is the last step of the file.

Department of ISE, CSE 2020-21 Page 11

SEMINAR HALL MANAGEMENT SYSTEM
•After deleting the file, if doesn’t exist.

File Open operation

• The process must open the file before using it.

File Close operation

• The file must be closed to free up the internal table space, when all the
accessesare finished and the attributes and the disk addresses are no longer
needed.
File Read operation
• The file read operation is performed just to read the data that are stored in
therequired file.
File Write operation

• The file write operation is used to write the data to the file again, generally
at thecurrent position.
File Search operation

• The file search operation is used to search the data to the file based on
primarykey.
File Append operation

• The file append operation is used to add records on to the end of the record.

Department of ISE, CSE 2020-21 Page 12

SEMINAR HALL MANAGEMENT SYSTEM

CHAPTER 3

SYSTEM DESIGN
3.1 Design of the Fields and Records

File system is used to control how data is stored and retrieved. Without a file system,
information placed in a storage medium would be one large body of data with no way to tell
where one piece of information stops and the next begins. By separating the data into pieces
and giving each piece a name, the information is easily isolated and identified.

Taking its name from the way paper-based information systems are named, each group of data
is called a "file". The structure and logic rules used to manage the groups of information and
their name is called a "file system". There are many different kinds of file systems. Each one
has different structure and logic, properties of speed, flexibility, security, size and more. Some
file systems have been designed to be used for specific applications. For example, the ISO
9660 file system is designed specifically for optical discs.

File systems can be used on numerous different types of storage l devices that use different
kinds of media. The most common storage device in use today is a hard disk drive. Other kinds
of media that are used include flash memory, magnetic tapes, and optical discs. In some cases,
such as with tmpfs, the computer's main memory (random-access memory, RAM) is used to
create a temporary file system for short term use. Some file systems are used on local data
storage devices others provide file access via a network protocol (for example, NFS, SMB, or
9P clients).

Some file systems are "virtual", meaning that the supplied "files" (called virtual files) are
computed on request (e.g., proofs) or are merely a mapping into a different file system used
as a backing store. The file system manages access to both the content of files and the metadata
about those files. It is responsible for arranging storage space; reliability, efficiency, and
tuning with regard to the physical storage medium are important design considerations.

File systems allocate space in a granular manner, usually multiple physical units on the
device. The file system is responsible for organizing files and directories, and keeping
track of which areas of the media belong to which file and which are not being used. For
example, in Apple DOS of the early 1980s, 256- byte sectors on 140 kilobyte floppy disk
used a track/sector map.

Department of ISE, CSE 2020-21 Page 13

SEMINAR HALL MANAGEMENT SYSTEM

This results in unused space when a file is not an exact multiple of the allocation unit, sometimes
referred to as slack space. For a 512-byte allocation, the average unused space is 256 bytes. For
64 KB clusters, the average unused space is 32 KB. The size of the allocation unit is chosen
when the file system is created. Choosing the allocation size based on the average size of the
files expected to be in the file system can minimize the amount of unusable space. Frequently
the default allocation may provide reasonable usage.

3.2 Indexing
An indexed file is a computer file with an index that allows easy random access to any record
given its file key. The key must be such that it uniquely identifies a record. If more than one
index is present the other ones are called alternate indexes. The indexes are created with the
file and maintained by the system.

An index for a fill works like a catalogue in a library. Cards in alphabetic order tell us where
to find books by a particular author. In real-world databases, indices like this might be too
large to be efficient.

There are two kinds of indices

1. Ordered indices: indices are based on a sorted ordering of the values.

2. Hash indices: indices are based on the values being distributed uniformly across a range of
buckets.

3.2.1 PRIMARY INDEXING

Index on Sequential File, also called Primary Index, when the Index is associated to a Data
File which is in turn sorted with respect to the search key.

1. A Primary Index forces a sequential file organization on the Data File;

2. Since a Data File can have just one order there can be just one Primary Index for Data
File. Usually used when the search key is also the primary key of the relation.

Usually, these indexes fit in

main memory. Indexes on
sequential files can be:

1. Dense: One entry in the index file for every record in the data file;

Department of ISE, CSE 2020-21 Page 14

SEMINAR HALL MANAGEMENT SYSTEM
2. Sparse: One entry in the index file for each block of the data file.

3.2.2 SECONDARY INDEXING

Secondary index may be generated from a field which is a candidate key and has a unique
value in every record, or a non-key with duplicate value. Often one wants to find all records
whose values in a certain field (which is not the search key of the primary index) satisfy some
condition. One can specify a secondary index with an index entry for each search key value;
index entry points to a bucket, which contains pointers to all the actual records with that
particular search key.

Department of ISE, CSE 2020-21 Page 15

SEMINAR HALL MANAGEMENT SYSTEM

Department of ISE, CSE 2020-21 Page 16

SEMINAR HALL MANAGEMENT SYSTEM

Department of ISE, CSE 2020-21 Page 17

SEMINAR HALL MANAGEMENT SYSTEM
CHAPTER 4

IMPLEMENTATION
4.1 About Java & JavaFX

Java is a general-purpose programming language that is class-based, object-oriented, and

designed to have as few implementation dependencies as possible. It is intended
tolet application developers write once, run anywhere (WORA), meaning that compiled
Java code can run on all platforms that support Java without the need for recompilation.
Java applications are typically compiled to bytecode that can run on any Java virtual
machine (JVM) regardless of the underlying computer architecture. The syntax of Java is
similar to C and C++, but it has fewer low-level facilities than either of them.

Java was originally developed by James Gosling at Sun Microsystems (which has since
been acquired by Oracle) and released in 1995 as a core component of Sun Microsystems'
Java platform.
JavaFX is a Java library used to develop Desktop applications as well as Rich Internet
Applications (RIA). The applications built in JavaFX, can run on multiple platforms
including Web, Mobile and Desktops.

JavaFX is intended to replace swing in Java applications as a GUI framework. However,

it provides more functionalities than swing. Like Swing, JavaFX also provides its own
components and doesn't depend upon the operating system. It is lightweight and hardware
accelerated. It supports various operating systems including Windows, Linux and Mac
OS.

JavaFX was developed by Chris Oliver. Initially the project was named as Form Follows
Functions (F3). It is intended to provide the richer functionalities for the GUI application
development. Later, Sun Micro-systems acquired F3 project as JavaFX in June, 2005.

4.2 Pseudo Code

Pseudo code is a simple way of writing programming code in English. Pseudo code is
notactual programming languages.

It uses short phrases to write code for programs before you actually create it in a
specificlanguage.

Once the functionality of the program is known, then one can use pseudo code to
createstatements to achieve the required results for your program.

Department of ISE, CSE 2020-21 Page 18

SEMINAR HALL MANAGEMENT SYSTEM
4.3 Insertion module pseudo code

Step1: Input the staff id, staff name, customer name, customer details, date and details of the
event into hall.txt.

Step2: Open the file hall.txt and write the contents into it until the condition is satisfied.
Step3: Close the file.

Display module pseudo code

Step1: Open the file hall.txt.

Step2: Unpack the contents.

Step3: Display the contents of seminar.txt.

Step4: Close the file.

Deletion module pseudo code

Step1: Get the flag using parse function.

Step2: If flag is true

Then open the file.

Copy all the contents prior and

after the record to be deleted in a temp file.

Delete the original file.

Rename the temp file to the original file name.

Else Return False i.e. Record doesn’t exist.

Step3: End that module.

Search module pseudo code

Step1: Open the file.

Step 2: Get the flag using parse function

If flag is true
Record exists otherwise go to else part

Using search function extract the record

using the primary key ID

Department of ISE, CSE 2020-21 Page 19

SEMINAR HALL MANAGEMENT SYSTEM
Or using secondary key Hall.
Else flag is false

Record doesn’t exist in file

Modify module pseudo code

Step1: Open the file.

Step 2: While file is not equal to end of file

If key is equal to ID

Get the position from index file

Get the address from the file

Point to that address of the file

Copy all the contents prior to the record in temp file.
Get the modified items and write it to the current line.
Copy all the content after the record in the temp file.
Delete the original file and rename temp file to original name.

Indexing pseudo code

Step 1: Start the program.

Step 2: Open the file hall.txt

Step 3: While file is not equal to end of file

Get the position from file.

Erase the contents from buffer.

Copy the contents from file to buffer.

If the contents of buffer are not deleted

then If buffer is empty

then break.

Extract the id

Get the address of the id

Step 4: Close the file.

Step 5: Erase the contents of buffer.

Department of ISE, CSE 2020-21 Page 20

 SEMINAR HALL MANAGEMENT SYSTEM
CHAPTER 4

SOFTWARE TESTING

4.1 Unit Testing

Unit testing is a software testing method by which individual units of source code, sets of
one or more computer program modules together with associated control data, usage procedures,
and operating procedures, are tested to determine whether they are fit for use.
4.2 System Testing

System testing is a level of software testing where a complete and integrated software is
tested. The process of testing an integrated system to verify that it needs specified requirements.
This Java program works well on the Windows operating system. The IDE used for coding is
IntelliJ IDEA. The code works well with Java 8.x and JavaFX is required to be installed
separately if newer version of Java is being used. It is recommended to run the project in a IDE
that supports the latestversion of the programming language.
4.3 Integration Testing

Integration testing is a phase in software testing in which individual software modules

are combined and tested as a group. It occurs after unit testing and before validation testing.
Login and displaying the user dashboard with the top series showcase has a relation with multiple
files such as users.txt and topSeries.txt. Integration testing is done by signing a user to the
dashboard and checking if the various components are working properly.

The main objectives of testing process are as follows.

Testing is a process of executing a program with the intent of finding an error.

A good test case is one that has high probability of finding undiscovered error.

A successful test is one that uncovers the undiscovered error.

Department of ISE, CSE 2020-21 Page 21

SEMINAR HALL MANAGEMENT SYSTEM

4.4 Testing table

Test case Id
Description Input Values Expected Actual Remarks
Output Output
Staff id=1
1. Add Booking Booking
Staff Name =Meghana
booking Record record
Customer Name=Anand
records added added
phone num=5824762211 PASS
date: 06/07/2021

2. Search for date: 06/07/2021 Displays Displays

personal the the details
details details of of booking
PASS
booking

Staff id=1
3. Displays all Displays Displays
Staff Name =Meghana
the records all the all the
Customer Name=Anand
of Booking records records
phone num=5824762211 PASS

date: 06/07/2021

Modifies
the records

4. Customer Name=Anand Modifies Modifies PASS

records records

Department of ISE, CSE 2020-21 Page 22

SEMINAR HALL MANAGEMENT SYSTEM
CHAPTER 5

SNAPSHOTS
5.1 Login records

Department of ISE, CSE 2020-21 Page 23

SEMINAR HALL MANAGEMENT SYSTEM
5.2 Write function:

5.3 Data and index File:

Department of ISE, CSE 2020-21 Page 24

SEMINAR HALL MANAGEMENT SYSTEM
5.4 Display:

5.5 Search:

Department of ISE, CSE 2020-21 Page 25

SEMINAR HALL MANAGEMENT SYSTEM

CONCLUSION AND FUTURE ENHANCEMENT

This system computerizes the seminar hall booking management process. It manages the
different operations in fields such as maintain record of available customer and its details. It
has the searching option along with managing capability. The aim of this project was to build
a seminar hall booking through which allowed to Add, Search, Modify and Display records
of individuals. At the completion of this project, we are able to store and manage the details
of the individuals and are able to work with according to the requirement.

Hence by seeing all these facilities provided by the Seminar Hall booking management
system, we can conclude that this form of record maintenance can lead to the proper storing
and managing of the details without any inconvenience. The project entitled “Seminar Hall
and Auditorium Booking System” was successfully executed. ... The system provides security
to user documents. However, the possibilities for innovation are infinite and scope for
development is innumerable

Department of ISE, CSE 2020-21 Page 26

SEMINAR HALL MANAGEMENT SYSTEM

REFERENCES

1. www.stackoverflow.com

2. www.youtube.com

3. File Structures –An Object Oriented Approach with C++ By Michael J.Folk,
Bill Zoellick, Greg Riccardi

4. edu.gcf.global.org

5. support.office.com

6. www.geeksforgeeks.org

7. www.quora.com

8. www.wikipedia.org

9. codeforgeeks.com

10. www.google.com

Department of ISE, CSE 2020-21 Page 27