Language:EN
Pages: 14
Rating : ⭐⭐⭐⭐⭐
Price: $10.99
Page 1 Preview
rocky catering service management system

Rocky catering service management system

COIT20245:

Submitted to: Azra
Ahmedi

Contents

1. Introduction..................................................................................................................................3

2.2.1. File Execution..........................................................................................................................5

2.2.1.1. IF CHOICE 1 IS SELECTED..........................................................................................6

2.2.1.4. IF CHOICE 4 IS SELECTED (Search for booking)......................................................11

2.2.1.5. IF CHOICE 5 IS SELECTED (Sort the bookings)........................................................12

The report is to demonstrate development of Menu Driven Console Java Program named Rocky

Catering Management Service. The software used for this purpose is IDE NetBeans 8.2. The

booking from user and calculate their charges (including discounts, fixed charges) depending upon

the deals offered. Furthermore, it displays a menu which allow user to select the option to get the

The Java Source code of this file contains a “class Booking”. This class consist of followings:

 Private Variables:// they cannot be accessed by another class

o Booking (): a default constructor

o Booking (parameters): a parametrized constructor

 Get methods/Accessors: // this method is used to access values of private instance variable

o getBookingName()

o enterBookingName()

o enterNumOfGuests()

The UML diagram for booking class is as follow:

 -sign indicates private

Figure 2:Flow Chart of Class Booking

Figure 3:Menu list

Page 6

User is asked to re-enter name.

Figure 8:Error Message for Maximum Booking

STEP 2: Now the user is required to input the number of guest but the entered number should not be blank or less than 10. In such cases error message will appear and user is asked to re-enter the number of guests.

a) Ten to twenty guests will be $29.50 per head.

Page 8

Figure 13:Currently Entered Bookings

2.2.1.2. IF CHOICE 2 IS SELECTED (Display all booking names, number of guests and charges)
When user select this option, entire bookings will be displayed which are entered so far. But if there is no booking entered, an error message will display on screen.

2.2.1.3. IF CHOICE 3 IS SELECTED (Display Statistics)
When this option is selected the source code will display the statistics which include the booking names having maximum and minimum number of guests (also their number), average number of guests and total charges. In such situation where there is no booking recorded, user will get an error message to enter atleast one booking.

Page 10

2.2.1.4. IF CHOICE 4 IS SELECTED (Search for booking)
When user enter choice 4 that is to search for booking, program will first check out if there is any booking entered so far. If, no booking is found it will generate an error message.

Figure 18: Error Message-Minimum Bookings Required For Choice 4

Figure 20:Booking Found Message

Page 12

2.2.1.6. IF CHOICE 6 IS SELECTED (Exit the application)
When choice 6 is selected the program will exit the application, displaying thankyou message and Programmer’s name.

Page 13

“Bubble Sorting Algorithm:” Though, it was the simplest sorting algorithm but comparing alphabetically one of the variables of object stored at one index to same variable of other object at adjacent index, ignoring case and swapping objects based on this comparison, was time consuming. Then I used mutator to store booking name in a string, compared them and swap the array objects position if the booking names were not in order

You are viewing 1/3rd of the document.Purchase the document to get full access instantly

Immediately available after payment
Both online and downloadable
No strings attached
How It Works
Login account
Login Your Account
Place in cart
Add to Cart
send in the money
Make payment
Document download
Download File
img

Uploaded by : Laura Marsh

PageId: DOC8E2CC98