Milestone

2017 Spring Quarter

Week 6

Report third draft

• integrate some terms in the introduction to two related algorithms;
• add two figures to illustrate the labeling process;
• correct grammar mistakes.

Week 5

Report second draft

• edit based on Professor's comments
• find that there are different versions of the C-G algorithm
• detailed term definition
• add transitive reduction illustration on the introduction to the C-G algorithm
• edit course scheduling algorithm pesudocode

Week 4

Report first draft done!

• Related Work section continues...
• Experimental results
• Conclusion

Week 3

Report second draft 2/3.

• Related Work continues...
• Course Scheduling Algorithm description

Week 2

Report first draft 1/3.

• Introduction
• Related Work
• Terms definition

Week 1

Project research report outline

2017 Winter Quarter

Week 9

03/12/2017

• Customizable width function for every level
• Use 6 quarters history to get a more accurate result

Week 8

03/04/2017

Implement Hu's Algorithm by labeling each course with a distance.

• distance calculation: its own course value + distance to the "sink"
• course value calculation: the number of specializations it satisfies.

After labeling, when a user takes 20 credits per quarter, the user can fulfill requirements in 3 years. On the contrary, without labeling, it takes the user 3 years and 1 quarter.

Week 7

02/26/2017

• Allow input what courses the user want to avoid.
• Use one priority queue and one graph for scheduling, instead of multiple graphs

Week 6

02/20/2017

• Allow input courses already taken and schedule from the half-way.
• Use multigraphs to get a better result. (Order of input graphs matters)

02/19/2017

• Use priority queue with a heuristic estimation for course values for better performance, but increase the time complexity
• Can set an upper bound range for the scheduling to get a valid schedule (take upper only restriction into account) It will make schedules on a upper bound range and pick the most efficient one.
  • solve the problem that some courses are upper standing student only.
  • Set a upper bound advanced. The bound will prevent the algorithm from assigning upper standing only courses into a level < upper bound (specified in function).

Week 5

02/12/2017

• Update crawler to crawl special information related to upper only issue
• Try two different ways to solve the upper only issue in scheduling

Week 4

02/05/2017

• Add specialization information for scheduling

02/04/2017

• replace the Scrapy crawler with a simpler crawler using BeautifulSoup and Request libraries.

Week 3

01/29/2017

• collect WebSoc info
• take units and quarters into account

01/28/2017

• Create Course and CoursesGraph objects.
• Take prerequisite's AND/OR relationship into account for scheduling

Week 2

01/22/2017

• Use Scrapy to collect WebSoc information

01/21/2017

• Write down the basic Coffman-Graham algorithm and basic graph representation.

Week 1

Project starts!