![]() ![]() Monthly, 6 months and annual subscriptions are available. All classes are shown in a week view, you can scroll to get the information you want so that you will not forget even one class. Each assignment and class has its own notification. Today’s classes are shown in a specific module so that you can get them intuitively. Done an assignment easily, just by one tap. Sort all assignments into different sections as you want. Add a course, exam or assignment easily. Manage detailed information of all your instructors. Easily manage different semesters and holidays. The app allows you to set general notification of all classes and separate alarms of each assignment. You can either organize your assignments by date, by course or by priority or sort them by completed or uncompleted.Ī powerful notification feature makes sure that you will never miss even one class or assignment. Kinds of sections are designed to track down all your assignments easily and intuitively. By the way, you can cancel the separate class in case of emergency events. You are supplied with a set of icons for your courses, and the icons will be continually updated in every upgrade version. All your classes will be displayed in a week-view within the schedule module. You can easily input and manage your courses, classes, and exams. Once you use the app you will want nothing else to make your school life easier. Our Pocket Schedule is one of the best tools to track down all your courses, classes, and assignments. *Are you a parent who often troubled with that you would like to take care of kids while they are having exam but you do not even know when the exam is? *Are you a teacher who often troubled with different courses of different grades & classes? Our algorithm is essentially a recursive tree, which is explained more in the image below.*Are you a student who often troubled with when and where the next class will be? Prior to commit 9102865 this is the algorithm that was used. This does run faster than my old algorithm and generates fewer total schedules because the old algorithm generated some schedules that were included in larger ones (sub-graphs). ![]() Therefore, to find all possible schedules, I implemented the Bron-Kerbosch maximal clique finding algorithm. Representing the problem as a graph means that possible non-conflicting schedules are maximal cliques. I realized that the scheduling program could be thought of as a graph where vertices represent a section of a class and edges exist between vertices that are compatible (can be taken together). The new algorithm implemented by commit 9102865 is the Bron-Kerbosch maximal clique finding algorithm. ![]() If you are running on data that is not from UR, then you may have to change some things.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |