Professional Documents
Culture Documents
KLE Dr.M.S.Sheshgiri
College of Engineering & Technology
Udyambag, Belagavi– 590008
Branch
“Computer Science”
Project
“TRAIN TICKET RESERVATION SYSTEM”
By
Shreyansh.B.Ladage (2KL19CS096)
Akash.V.Patil (2KL19CS004)
Pratik.Mathapathi (2KL19CS066)
Arun.Belagavi (2KL19CS011)
CONTENTS:
1. Introduction
2. Objective of the project
3. Data Structure
4. System requirements
5. Flowchart
6. Methodology
7. Implementation modules
8. Results
9. Advantages
10. Conclusion
11. Future Enhancements
12. References
INTRODUCTION:
This system is basically concerned with the reservation of railway tickets to the
passengers. In this we are discussing that how the reservation is done with the feature of
cancelling and waiting list.
In the project we are going to include entities like
1. Reservation
2. Cancellation
3. Display reserved and waiting list passengers.
DATA STRUCTURE:
Singly Linked List
Linked List is a sequential collection of nodes.Which is faster than array in
terms of deletion of nodes. It’s memory is dynamically allocated in runtime. This
saves time and space.
Each node consists of four different data field :
#Name
#Age
#Registration Number
#Link to the next node
Queue
Queue is a data structure in which insertion and deletion takes place from the
ends. It follows First In First Out Principle.
Queue data structure is used here to store the waiting list passengers. If anyone
cancels their ticket then that seat is allocated to the first passenger in the queue.
Linear queue
A Queue is a linear structure which follows a particular order in which the
operations are performed. The order is First In First Out (FIFO) .In a queue, we
remove the item the least recently added.
SYSTEM REQUIREMENT:
Software specification:
1. Operating System : Windows
2. Frontend : C programming
3. Backend : C programming
4. IDE : Visual Studio Code
Hardware specification:
1. RAM : 512mb
2. Disk space : >1GB
FLOWCHART:
START
Enter the
passenger
details
Check seat
availability
Yes
Yes
Confirm
booking No
Waiting list
available?
Display
details
Yes
Cancel
ticket?
No
Display
details
END
METHEDOLOGY
Used Concepts of data structures: Linked lists, stacks, Queues, to build a basic Railway
Reservation System in C Programming language. To book a ticket, enquiry and cancellation
process in efficient way so that user can use the system easily.
The system has functions:
1. Reserve:
Can book a ticket to any particular train he wishes to through the system.
2. Cancellation:
Passenger can cancel ticket through this function before the journey.
3. Waiting list:
If the reservation is full, prompt reservation full!! Put them in waiting list (queue) and give a
waiting list number. If any passenger wishes to cancel his ticket, he may cancel. Then the
passenger in waiting list is booked automatically
4. Display:
Display the detailed information about passenger’s reservation of ticket such as
Name and Registration number.
IMPLEMENTATION MODULE
1. node* deq();
2. int create();
3. int reserve(node*);
4. int cancel(int);
5. void enq(node*);
6. void display();
RESULT:
ADVANTAGES:
1. Reduces the burden of traveler waiting in the booking counter.
2. User-friendly.
3. Convenient.
4. Time savings.
5. Helpful during COVID
CONCLUSION:
System can be adapted in railway station for easy reservation of tickets in very less time,
and it can be used to keep records of passengers reservation and many other useful information
FUTURE ENHANCEMENT:
1. We can optimise our time complexity using some different data structure.
2. We can add features such as prioritising on the basis of age or railway employees and
gender.
3. We can add feature of tatkal reservation.
4. We can provide this solution on online portal.
REFERENCE:
1. www.youtube.com
2. www.tutorialspoint.com
3. www.greeksforgreek.org