Hostel facility booking system using priority algorithm presentation.

1. HOSTEL FACILITY BOOKING
SYSTEM USING PRIORITY
SCHEDULING ALGORITHM
NAME : NUR AININ SOFIYA BINTI CHE
AZIZ
MATRIC NO : BTCL 15041253
SUPERVISOR : PROF DR. MOKHAIRI BIN
MAKHTAR

2. Table of Content
 Introduction
 Problem Statement
 Objective
 Scope
 Framework
 Process Model (CD, DFD)
 Data Model (ERD, Data Dictionary)
 Solution of Complexity (Algorithm)
 Proof of Concept

3. INTRODUCTION
1

4. • The aim of this system is to help student at UniSZA,
Besut to book the hostel facility online without need to
go to the hostel college office.
• Student also can check if the room or place available at
that time.
• Priority scheduling will be used and implement in this
project.
• Priority scheduling is a method of scheduling processes
based on priority.
• If there a redundancy happen, student that have higher
position at UniSZA will get.

5. Problem Statement2

6. • Still use a manual system where student need
get fill in the booking form or apply in a form of
letter.

7. Objective3

8. i. To analyze
the hostel
facility
booking
system
ii. To design
the hostel
facility
booking
system.
iii. To
implement the
hostel booking
system

9. SCOPE
4

10. Student
• Able to register, login
•Student will enter date,
start and end time, facility
they want to book check
whether available or not.
•If available they can book.
•User can cancel or update
booking detail before admin
approved.
Admin
•Able to
register, login.
•Admin will
approved the
student booking
request
•View report.

11. FRAMEWORK5

13. PROCESS MODEL
Context Diagram (CD)
Data Flow Diagram (DFD)
6

14. Context Diagram

15. DFD LEVEL 0

16. DFD LEVEL 1

17. DFD LEVEL 1

18. DFD LEVEL 1

19. DATA MODEL
Entity Relationship Diagram (ERD)
Data Dictionary
7

20. Entity Relationship Data

21. DATA DICTIONARY
Table Student

22. Table Admin

23. Table Booking

24. Table Facilities

25. Solution of Complexity
(Algorithm)8

26. • Priority algorithm is the algorithm is a method
of scheduling processes based on priority.
• In this method, the scheduler will choose the
task to work as per priority.
• Each process is assign a priority. The process
with the higher priorities is carried out first.

27. • For example, to handle jobs sent to the Computer Science
Department's printer: Jobs sent by the department chair
should be printed first(1), then jobs sent by professors(2),
then those sent by graduate students(3) .
• The values put into the priority queue would be the
priority and the associated information would be the
document to print.
• Each time the printer is free, the job with the highest
priority would be removed from the print queue, and
printed.

28. • Operation for priority queue.
OPERATION DESCRIPTION
Priority Q() (constructor) create an empty
priority queue
boolean empty() Return true if the priority queue is
empty
Void insert (Comparable p) add priority p to the priority queue
Comparable removeMax() Remove and return the highest
from the priority queue (error if
priority is empty

29. • Thus, use a same concept which is a higher priority, the
process will get execute.
• So, if borrow date and time is clash, the system will
choose the higher priority and will get to book and
overrule the other booking.

30. PROOF OF CONCEPT9

31. Student must
register
themselves first.

32. User login
into the
website.

33. This is homepage.
Student must
enter the detail to
check availability

34. If available, user can book.
If date and time clash, it
will look for the priority,
then who has a higher
priority will get to book
and it will overrule if the
current that want to book
has more higher priority.

35. User must wait
for the admin to
approve the
request.

36. THANK YOU
Q & A