WebTree Explained

WebTree is a student-designed initial course registration process that allows for each student to obtain one course before any student gets a second course. WebTree is based on a kind of lottery and uses an if-then logic to run. This system eliminates the need to stand in line or hover online in a bid to start the registration process.

You can think of WebTree as, in effect, lining up the whole student body and asking each student a pair of questions. Each question depends on the answer to the one before it. The first question is "what class do you most want?" The second question is "what do you want if that one is unavailable?" Questions like that continue until the student gets one course. The program then goes to the next student in line. Once each student has one class the process repeats until everyone's WebTree choices have been exhausted.

How to Use WebTree

To prepare for entering your choices:

  • Watch the video
  • Look at the schedule of classes and College Catalog to determine your course preferences
  • Enter the Course Reference Numbers (CRN) on the worksheet
  • Log into WebTree to record your selections.
    • This site uses Single-Sign-On and DUO for authentication. New students, and students on leave, will use the last four digits of their ID number as their PIN. Continuing students will use the PIN provided by their advisers.

Additional Resources

Review this flowchart (PDF) to view WebTree's decision-making process. It may be helpful to view this along with the video.

We have created a sample WebTree (PDF) for a first-year student wanting to take a lab-science and fulfill several other Ways of Knowing requirements. Notice how multiple sections of the same class are used, how sections are repeated in different trees, and how courses meeting at the same time are not placed in the same row of a branch, but they can be placed at different levels and different branches.

Here is a blank worksheet (PDF) that can be used to plot out your courses prior to entering them into WebTree.