|
|
• Chairpersons determine the number of classes of
each elective to be offered based on student requests and
staffing considerations. Preference in most elective courses
is given to upper class students. 1. Some classes may be oversubscribed (more
requests than seats); 2. Some classes may not be offered (due to
insufficient demand or budgetary limitations); 3. Some classes conflict making
it impossible to schedule all requests;
• Selection for oversubscribed courses will be made by
lottery. In the interest of fairness, the school is
scheduled, by official class designation, randomly within a
grade with seniors given preference in programming, followed
by juniors and then sophomores. Students will be placed in
their second or third choice classes (whenever space
permits) if it is not possible to program the first choice
class.
• Students will be scheduled for the courses
requested subject to the following conditions and/or
limitations:
• Please supply alternate choices in the
event that we cannot schedule you for a requested course.
You will be scheduled according to your requests whenever possible.
If you do not supply an alternative, you will be scheduled
for an appropriate course by the Guidance Department.
• Incomplete program requests will result in your
being programmed by the Guidance Department for whatever
classes are necessary so that you have a graduating
program.
•Scheduling begins once programming requests have been
compiled for all students. Every effort is made to avoid
scheduling conflicts. However, each semester there are
approximately 95 singleton courses (classes for which only
one section exists, e.g. A.P. Latin). When a student's requests
contain more than one singleton course, conflicts are likely to
occur.
•Students with conflicts are contacted whenever
possible to help resolve this problem.
•Students should base their requests for
the coming term on progress in their present classes and on
discusssions with their classroom teachers, Guidance Counselors,
Department Chairpersons, and parents.
Page created by S. Brustein; last revision 10/10/03
