Student

User Tools

Site Tools

Trace: • registration_student_program_exit_date_reason • scheduling_proxy_section • place_sections_singleton • registration_student_generic_program_exit_date_reason • scheduling_group_course_change_method • scheduling_msalgo_course_to_be_place • scheduling_instructional_setting
general:scheduling_msalgo_course_to_be_place

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Next revision		Previous revision
general:scheduling_msalgo_course_to_be_place [2016/12/13 20:52] – created jstanfordgeneral:scheduling_msalgo_course_to_be_place [2020/07/08 13:54] (current) – external edit 127.0.0.1
Line 1: Line 1:
-A course number is automatically displayed. This is the course that MSALGO determines should be placed first. To select another course, click   to select the course. +A course number is automatically displayed. This is the course that MSALGO determines should be placed first. To select another course, click {{:images:smallpicklist.png|}} to [[general:select_course|select the course]].\\  \\   
- +The courses in the ellipsis lookup are sorted by the ranking in an algorithm: from the least number of sections and greatest number of conflicts within the number of sections, to the greatest number of sections and number of conflicts, from greatest to least, within the number of sections.\\  \\   
- +For each course, the course number and title, number of conflicts, and the number of sections placed are displayed. (The lower the number of conflicts, the more difficult to place.)\\  \\   
-The courses in the ellipsis lookup are sorted by the ranking in an algorithm: from +If all sections of a course are placed,  the message "Placed" is displayed. Otherwise, the number of sections placed out of the number of sections available is displayed (e.g., 0 of 1).\\  \\   
-the least number of sections and greatest number of conflicts within the number of +The algorithm ranks the most difficult courses to place first, but any course can be selected for placing.\\  \\   
-sections, to the greatest number of sections and number of conflicts, from greatest +Data for the selected course is displayed, including the course title, number of semesters and periods, number of conflicts, number of sections placed, and number of requests.\\  \\  
-to least, within the number of sections. +
- +
-For each course, the course number and title, number of conflicts, and the number +
-of sections placed are displayed. (The lower the number of conflicts, the more difficult +
-to place.) If all sections of a course are placed, the message "Placed" is displayed. +
-Otherwise, the number of sections placed out of the number of sections available +
-is displayed (e.g., 0 of 1). +
- +
- +
-The algorithm ranks the most difficult courses to place first, but any course can +
-be selected for placing. +
- +
- +
-Data for the selected course is displayed, including the course title, number of +
-semesters and periods, number of conflicts, number of sections placed, and number +
-of requests. +
- +
- +
-Section placement guidelines+
  
general/scheduling_msalgo_course_to_be_place.1481662371.txt.gz · Last modified: 2016/12/13 15:52 (external edit)

Page Tools

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International

Americans with Disabilities Act (ADA) and Web Accessibility

The Texas Computer Cooperative (TCC) is committed to making its websites accessible to all users. It is TCC policy to ensure that new and updated content complies with Web Content Accessibility Guidelines (WCAG) 2.0 Level AA. We welcome comments and suggestions to improve the accessibility of our websites. If the format of any material on our website interferes with your ability to access the information, use this form to leave a comment about the accessibility of our website.