Skip to content

mathblender17/Movie-Ticket-counter

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 

Repository files navigation

Movie-Ticket-counter-implementation

A Project to apply and implement concepts of Data Structures and Algorithms.

to design and implement a queue data structure that efficiently manages and processes movie ticket bookings in a first-come, first-served (FCFS) manner.

The FCFS queue is essential for ensuring fair and orderly processing of booking requests at a movie ticket counter.

The queue should adhere to the FCFS principle, where the first customer to arrive is the first to be served, creating a fair and orderly queue for ticket reservations.

Excepted outcome :

The expected outcome of this problem is to have a well-designed and efficiently implemented FCFS queue data structure that serves as a core component of a movie ticket booking system. This queue should maintain the order of booking requests and provide a fair and orderly ticket booking process for customers. The system should be capable of handling concurrent access and provide error handling for various scenarios. This FCFS queue, when integrated into a larger movie ticket booking system, will help ensure that customers are served in the order they arrive, creating a fair and efficient ticket booking experience

Getting Started

Just make sure that your environment can run C and some basic HTML code.

Results and Output :

Core code :

  • Enter the line to book ticket(Enqueue):Screenshot 2023-11-13 021718
  • Display:Screenshot 2023-11-13 022045
  • Book the ticket and come out of the line(Dequeue):Screenshot 2023-11-13 022404

Frontend :

Screenshot 2023-11-13 022542

  • processing: Screenshot 2023-11-13 022627
  • Entering the line:Screenshot 2023-11-13 022716

About

Queuing system for movie ticket counters-0.3

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published