Car Parking Slot Allocation System
Chapter 1
INTRODUCTION
Background of the Study
Parking in big parking lot can be very challenging and effortful. Even when an indication is provided that a small percentage of slots is still available in the enormous car parks, most drivers do not seem to be able to locate those slots. Car Parking Slot Allocation System is a system that automates the searching and guides drivers on which location is their chosen slot located in the parking area. The system is designed to prevent problems usually associated with parking cars in a certain parking lot.
How does it work? When a car is waiting at the entrance, the operator will give the driver the slot card number indicating where to park in the area. This will avoid time delay if there are any cars waiting in the entrance waiting for their turn.
How does the system know which parking slot to allocate? The group created a simulation of a parking lot which composed of two separate parking areas – Parking Area A and Parking Area B, and thus each area is consisting of 40 parking slots. Because there are two parking areas in the parking lot, both of this areas will be applied using Allocation Algorithm. The application of Allocation algorithm in these areas will only allocate the vacant or available slots. Those slots that are not vacant or already occupied will not be allocated anymore and this will be ignored by the system.
The purpose of this project is to simulate and implement a real parking lot environment that allocate vacant parking slots using Allocation algorithm. As computer science students, the used and application of algorithm is the most important foundation of the field of Computer Science. Through this algorithm, this will tell the computer to do the task in the most efficient manner. Hence, by applying Allocation algorithm in the group’s study, an effective and efficient solution in the problems of allocating parking slots will be easily located by the system because of the application of algorithm. In
INTRODUCTION
Background of the Study
Parking in big parking lot can be very challenging and effortful. Even when an indication is provided that a small percentage of slots is still available in the enormous car parks, most drivers do not seem to be able to locate those slots. Car Parking Slot Allocation System is a system that automates the searching and guides drivers on which location is their chosen slot located in the parking area. The system is designed to prevent problems usually associated with parking cars in a certain parking lot.
How does it work? When a car is waiting at the entrance, the operator will give the driver the slot card number indicating where to park in the area. This will avoid time delay if there are any cars waiting in the entrance waiting for their turn.
How does the system know which parking slot to allocate? The group created a simulation of a parking lot which composed of two separate parking areas – Parking Area A and Parking Area B, and thus each area is consisting of 40 parking slots. Because there are two parking areas in the parking lot, both of this areas will be applied using Allocation Algorithm. The application of Allocation algorithm in these areas will only allocate the vacant or available slots. Those slots that are not vacant or already occupied will not be allocated anymore and this will be ignored by the system.
The purpose of this project is to simulate and implement a real parking lot environment that allocate vacant parking slots using Allocation algorithm. As computer science students, the used and application of algorithm is the most important foundation of the field of Computer Science. Through this algorithm, this will tell the computer to do the task in the most efficient manner. Hence, by applying Allocation algorithm in the group’s study, an effective and efficient solution in the problems of allocating parking slots will be easily located by the system because of the application of algorithm. In
Bibliography: [2] G.P. Kegel (March 2009) The Parking Spot Finder. Retrieved, October 10, 2011. From www.alexandria.tue.nl/extra1/afstversl/wsk-i/kegel2009 web address. [3] Lou Tylee (1998) Learn Microsoft Visual Basic 6.0. Retrieved, November 17, 2011. From www.thainguyen.edu.vn/Thanhvien/c2bachquangsc web address. [4] Ningyuan Chen (September 2011) Simple Parking Lot Management System. Retrieved, August 3, 2011. From www.publications.theseus.final/handle/134024 web address. [5] Ramdeo Anand (May 5, 2010) Gray-box Testing. Retrieved, February 15, 2012. From http://www.testinggeek.com/gray-box-testing web address. [6] Rochester Institute of Technology (December 6, 2001) Best-Fit Allocation Algorithm. Retrieved, January 5, 2012. From www.cs.rit.edu/~ark/lectures/gc/03_03_03.html web address. [7] Wikipedia - The Free Encyclopedia (March 2011) Allocation Algorithm. Retrieved, September 29, 2011. From http://en.wikipedia.org/wiki/Allocation_algorithm web address. [8] Wikipedia - The Free Encyclopedia (June 2011) Top-down Approach. Retrieved, January 10, 2012. From http://en.wikipedia.org/wiki/Top_down_approach web address.