Slightly More Complicated Enrollment Scenarios
Two students waitlisted for the same lecture but two different discussions—Important Concept!
There is no guarantee of a seat in the lecture. A student who waitlists a discussion at a less popular time may have a better chance of obtaining a seat in the lecture, regardless of his exact placement on the wait list for either the lecture or the discussion.
Consider the following example:
First Student
#4 on wait list for MATH 009A 001
#1 on wait list for MATH 009A 022 (this discussion is at a “good” time, like T 9-10 a.m.)
Second Student
#3 on wait list for MATH 009A 001
#6 on wait list for MATH 009A 032 (this discussion is at a “bad” time, like F 4-5 p.m.)
If section 32 has six seats open up before section 22 has any seats open up, the second student will move into the lecture and discussion section 032 before the first student. If section 022 never has any seats open up, the first student will never move into the lecture.
A student tries to add a class when the lecture is open but his desired discussion is not open.
If a student is in the process of adding a lecture that is open and tries to add a discussion/lab that is full but has a wait list, the student will be waitlisted in both sections.
If a seat in the discussion opens up while there are still seats available in the lecture, the student will be added to both. There is no guarantee of a seat in the lecture.

A student enrolled in both a lecture and discussion wants to try to get into a discussion section that is waitlisted
A student who has successfully enrolled in a lecture and discussion has the option of getting on the wait list for one other discussion. If the other discussion opens up, he will be automatically moved from the first discussion to the second, just as if an advisor were changing his section on screen SEC. The student will receive a web mail notifying him of the change. See below for the PAWS sequence.

Student has already enrolled:

Student tries to add the section he really wants:

The result
<- Back