INTRPRG Machine Project Specifications (1st Term AY 2011 2012)

Planner Application
Dont count every hour in the day, make every hour in the day count. -

In a university like DLSU, students choose their own schedules. Collaboration is about working together to achieve a goal but how will a group of people accomplish anything with their conflicting schedules in the way? Simple. Lets create a program that finds the common free time of 2 to 4 people and determine a schedule when they can meet and discuss.

Features:
1. User can enter their weekly schedules into the program as seen below. The input must take the schedule that represents their busy times. Program must also ask for the ff. inputs: a. Name of User b. Earliest time possible to arrive at school (ETP) c. Latest time possible to leave school (LTP)
User Name: Phoebe ETP: 8:00am LTP: 8:00pm Monday : 9:40am to 2:30pm Thursday : 9:40am to 2:30pm Wednesday : 2:00pm to 4:00pm Tuesday : 8:00am to 9:30am : 1:00pm to 4:10pm Friday : 8:00am to 9:30am : 1:00pm to 4:10pm User Name: Derek ETP: 9:00am LTP: 10:00pm Monday : 9:40am to 11:10am : 2:40pm to 4:10pm Thursday : 9:40am to 2:30pm Tuesday : 1:00pm to 2:30pm : 4:10pm to 5:50pm Friday : 1:00pm to 2:30pm : 4:10pm to 5:50pm Saturday : 9:00am to 12:00nn

Note: You can get the inputs in a way that is easiest for you (except console-based input) as long as you
get all the necessary inputs from the user. 2. The Program creates a detailed schedule of their common free time. The following are the list of computations that the program must do: a. Summarize the time periods that are available b. Round up to either --:30 or --:00 periods. c. Calculate the duration (in hours and minutes)

Free Time for Phoebe and Derek

Day Monday Tuesday Wednesday Thursday Friday Saturday Time 4:30pm to 8:00pm 10:00am to 1:00pm 6:00pm to 8:00pm 9:00am to 2:00pm 4:30pm to 8:00pm 10:00am to 1:00pm 6:00pm to 8:00pm 1:00pm to 8:00pm Duration (3 hours and 30 mins) (3 hours) (2 hours) (5 hours) (3 hours and 30 mins) (3 hours) (2 hours) (7 hours)

Page 1

3. The program must take inputs and display outputs through a graphical user interface. This is a hard requirement and therefore you will not get a score if your program is console-based in any way. Some features of your user interface must include: a. The option to edit the inputted schedule even after the program has displayed the schedule output. b. The option to reset ALL input fields.

Submission Guidelines
1. Submit the final source code (*.java files) and additional files (if any) needed to make your program compile successfully in JCreator on August 18, 2011. 2. This is an individual project to be written in Java Programming Language. Code sharing is strictly prohibited and will incur suitable disciplinary and academic consequences including a grade of zero in both machine project and final exam. 3. You may look for online materials to help you but you are required to understand the code used. Plagiarism is strictly prohibited therefore code snippets imported from the internet must be identified in your code through comments for demo purposes. 4. Questions regarding the machine project specs will only be entertained until July 15, 2011. You better read your machine project specifications early and bring your questions to class. Misunderstanding is NOT AN excuse for coming up with an incorrect solution. Make sure you understand the requirements. 5. You may use other IDE but your program must compile properly via JCreator.

Milestones
Date July 7 Output Detailed algorithm or description of solution (schedule analyzer) Console-based prototype that calculates for two inputted schedules. Screen designs (paper only/photoshop) Prototype GUI (doesnt have to be functional) (Input screen and output screens) Algorithm for output details (Improved console-based prototype) Prototype that includes GUI and logic. Partially working but logic is in place and complete; simply requires integration in the GUI. Purpose Evaluate understanding of the project specs and solution proposed.

July 21

Evaluate understanding of Java GUI and correctness of GUI. Address issues or factors that run the risk of failing to submit a complete/correct project on time.

August 4

Page 2

Rubric for grading your machine project

Criterion Schedule Representation and Analysis Exemplary 8 - 9 pts Advanced Java data structures (lists, classes) used and solution was optimized for faster processing and less resources consumed. Student must be able to explain his/her solution well. 5 - 6 pts Program output can be saved in files (pdf or text files). Student must be able to explain the concept of streams. Satisfactory 6 - 7 pts Correct algorithm and appropriate use of data structures and variables. No signs of brute force solutions in any part of the program. Developing 4 - 5 pts Algorithm is complete and correct but had parts that were unnecessarily complicated or had brute force implementation. It also contained minor/ incidental bugs. 2 - 3 pts Detailed schedule were missing minor information or displayed incorrect information on certain tests. Schedule details were presented to the user in a cluttered manner. 1 - 2 pts GUI had minor bugs but did not cause program crashes. Ease of use is a bit of an issue as some labels/information was unclear. Beginning 2pts Incomplete or incorrect solution or a program that generates serious bugs or program crashes.

Detailed Schedule Output

3 - 4 pts Complete and correct details were displayed by the program. Information was presented in an easy to understand manner.

1 pt Detailed schedule were missing important information or had serious errors including conflicts.

GUI Design & Functionality

5 pts Advance use of GUI elements and exceptional errorhandling including prevention of invalid data and friendly error messages to the user. Student must be able to explain the concept of exception handling in Java.

3 - 4 pts Program was easy to use and had clear labels of its commands and input fields. GUI features were implemented completely and perfectly.

0 pt GUI is not responsive or program crashes at some point of the execution.

Page 3