Math-M 118 Waitlist

<p>What are the odds of me being able to get into the class as a #3 spot on the wait list and if I do when would I find out, because I don't want to to buy books for the class I currently have just to find out that I got into Finite.</p>

<p>Update, I signed up for a few more time slots and I’m at the number one spot in the wait list in those classes</p>

<p>I’m on 4 wait lists for the class 2 at #3 and 2 at #1</p>

<p>odds?</p>

<p>100% Don’t buy the book until you’re in it, but it shouldn’t take very long. Make sure though that you have a “drop if enrolled” class selected though, because otherwise you can be passed up by other people on the wait list. That seems to be a very little known fact.</p>

<p>Yeah I made sure to drop the class in that specific time slot for each one, do you have any idea when they release who made it in off the wait list?</p>

<p>Also, is it a good idea to buy from the TIS Bookstore on campus and if I wait until I’m in the class will they still have the book in stock?</p>

<p>You could get in over the summer (if a freshman is ahead of you and decides to drop the class) or during the first week of school, when students can basically drop and add as they please. </p>

<p>You really should have no problem buying the book at TIS or IU Bookstore, I never have except when they only do print on demand, which M118 definitely isn’t.</p>

<p>I’ve had friends who were in the 49th spot on a wait list in finite and ended up getting into the class because she always showed up and asked the professor.</p>

<p>The finite classes are usually dropped by quite a few students within the first week / first exam. Often people will go to class and tell their professors that they’re on the wait list and still participate until someone else drops it. A few professors I know have added people to the roster who were way farther on the wait list just because they showed up… </p>

<p>You should get an email however when you’re off the wait list. Also there are sooo many M118 books that you shouldn’t have a problem finding one!</p>