Problem Statement: Smart City Parking Management
System
Context:
A smart city wants to implement an automated parking management system for its multi-level
parking garages. The system should handle real-time parking operations, including vehicle entry, exit,
and availability checks. The garages have the following constraints:
• Levels: Each garage has multiple levels, and each level can hold different types of vehicles
(e.g., cars, bikes, and trucks).
• Slots: Each level has a fixed number of slots for each type of vehicle, and the capacity may
vary across levels.
• Priority Assignment: When a vehicle enters, it should be assigned the closest available slot of
the appropriate type.
• Smart Exit: Upon exit, the system should free the slot and update availability.
Key Design Requirements:
1. Data Structure Selection: The selection of data structures is critical to ensuring the system’s
efficiency, scalability, and maintainability. Operations like finding the closest slot, updating
availability, and retrieving parked vehicle details must be fast and memory-efficient. You
must choose the appropriate data structures to:
o Track slot availability by type and level.
o Map vehicles to their parked slots for quick lookups.
o Minimize search time for slot allocation and optimize system performance while
handling dynamic queries.
Required Data Structures:
o Heaps: For efficient allocation of the closest available slot.
o Hash Maps: To map vehicles to their respective slots for quick lookups.
o Sets or Linked Lists: To dynamically track available slots within a level.
o Arrays or Trees: To store and manage parking levels and slots.
Avoid inefficient data structures (e.g., unsorted lists or simple queues) that may fail under load. The
goal is to select structures that optimize performance, minimize time complexity, and scale well as
the system grows.
2. Input Format: The input format must be user-friendly and simple to provide. The system
should allow for easy specification of levels, slots, and vehicle types in a structured format.
The input should include:
o Garage Setup Input: The number of levels and the capacity of each vehicle type (car,
bike, truck) on each level.
EXAMPLE:
3 # Number of levels
10 5 2 # Level 1: 10 car slots, 5 bike slots, 2 truck slots
15 10 5 # Level 2: 15 car slots, 10 bike slots, 5 truck slots
5 3 1 # Level 3: 5 car slots, 3 bike slots, 1 truck slot
Operations Input: Simple commands to interact with the system, such as parking a vehicle, exiting a
vehicle, or checking slot availability.
parkVehicle V1 car # Park vehicle V1 (car)
parkVehicle V2 bike # Park vehicle V2 (bike)
exitVehicle V1 # Vehicle V1 exits
isSlotAvailable car # Check if a car slot is available
OOP Design: The solution should be implemented using Object-Oriented Programming (OOP)
principles. The system needs to be modular, scalable, and maintainable. Each component of the
system (vehicles, slots, levels, etc.) should be encapsulated in classes with clear responsibilities.
OOP Concepts to Consider: The following OOP principles are available for use, and their
prioritization will directly affect the overall design and performance of the system. The specific
combination of these principles and the order in which you use them should be carefully considered.
The effectiveness of your solution will be evaluated based on the justification for choosing these
concepts:
1. Encapsulation
2. Abstraction
3. Inheritance
4. Polymorphism
5. Composition
Prioritization: The priority and effectiveness of these OOP concepts will be evaluated based on their
contribution to solving the problem. The concepts should be applied wisely:
o Encapsulation and Abstraction should be prioritized for clean, modular design and
for keeping the complexity hidden.
o Polymorphism can simplify operations with different vehicle and slot types, making
your system more flexible.
o Inheritance and Composition should be applied carefully to avoid over-complicating
the design while ensuring scalability and maintainability.
Operations to Implement: You are required to implement the following key operations for the
parking system:
o isSlotAvailable(vehicleType) → Returns whether a slot is available for the given
vehicle type.
o parkVehicle(vehicleId, vehicleType) → Parks the vehicle in the closest available slot
and returns the slot ID.
o exitVehicle(vehicleId) → Frees the slot occupied by the vehicle.
Each operation must be designed with performance in mind, ensuring that slot assignment,
availability checks, and updates are completed quickly and efficiently.
Constraints:
• Number of Levels: A maximum of 5 levels in the parking garage.
• Slot Capacity: Each level can have up to 100 slots.
• Vehicle Types: Cars, bikes, and trucks.
• Operations like slot assignment and availability checks must minimize time complexity.
******NOTE- THIS PROBLEM STATEMENT CAN BE SOLVED WITH MULTIPLE COMBINATION OF DATA
STRUCTURE AND OOPS CONCEPTS BUT THE SOULTION EFFICIENCY WILL VARY, ONCE THE DATA
STRUCTURE AND OOPS CONCEPT SELECTED IN FIRST SPRINT YOU CAN’T CHANGE THEM IN ANY
SPRINT,HENCE CHOOSE IT WISELY AND DEVELOP YOUR SOLUTION ON IT.******