Tag Archives: software-development

The Challenge of Design

After lots and lots of struggling, some real, usable interfaces exist for Zadatak! Who would have thought it would have been a such a struggle after practicing with fake buttons. But usable code with real restrictions is another ball park. The new code supports page switches (easier than I thought it would be) and a nice background (much harder than I thought it would be!) . Transparency and scrolling were also new features for myself.

As far as the interface design goes, many challenges still exist and need to be tackled. Some I know how to handle (checking the user’s data for consistancy) and some will require some research before writing any actual code (how to grab our list of tasks from a SQL database and output it to the user). The biggest and most important challenge that exists for Zadatak is sending out alarms when working on a task is required. This is critical for the functionality of our app, even when the application isn’t running. I’m not sure how to tackle this one yet, but thank goodness for google!

Tagged , , ,

Magic of the Java Background

This past weekend was the RCOS Hackathon and I started getting into the structure of Zadatak. Our goals are to have the user put in as minimal information as possible and having the application do the rest of the work. This means the app has to dynamically allocate blocks of time to the schedule without bugging the user on details of when and how long. The app also has to work with pre-existing schedules, handle conflicts, and we want to include functionality on procrastinating and delaying work allotted blocks.

I set out to build some classes in Java that would encompass these requirements and ran into a pretty big question. What is a method of scheduling blocks into the right spots that takes our inputs (deadline and progress)? Our solution is based around 2 principles or functions. One to place the task into the calendar and one to manage a queue of tasks. The queue of tasks would be determined by an internal priority number(a factor of time remaining on task and amount of work task requires). The calendar placement would use a principle similar to operating system process management using a round robin style. Using all the remaining days for a task the placement would place hour by hour where time is free, trying to keep busy hours constant throughout the calendar. This week I’m going to try and implement these two ideas. Stay tuned for progress.


Tagged , , , ,