Strategy Series
Clear Admit Strategy SeriesCraft a winning application with the Clear Admit Strategy Series! Step-by-Step guidance through the application process. Titles include a Resume Guide, Recommendations Guide, Waitlist Guide and more!

Interview Reports

A selection of interview field reports from fellow applicants posted to the MBA Admissions Wiki. Add your reports when you are finished with your interviews.
Chicago
Columbia
Dartmouth / Tuck
Duke / Fuqua
Harvard
Kellogg
Michigan / Ross
MIT / Sloan
Stanford
UNC / Chapel Hill
Virginia / Darden
Wharton
London Business School

MBA Tipline

We encourage admissions officers, students and applicants to alert us of interesting news and developments, please send an email to news@clearadmit.com so we can blog it.

Program Rankings

Rankings are a good way to start your research on various MBA Programs. Keep in mind each uses a different methodology.
Business Week
Economist
Financial Times
Forbes
USNews
Wall Street Journal

B-School Resources

The following are business resources offered by a variety of leading Business Schools. It's useful to subscribe to these resources, especially for the schools to which you are applying.
knowledge@wharton
INSEAD Knowledge
Harvard Working Knowledge
Knowledge @ Emory
Columbia Ideas @ Work
knowledge@ W. P. Carey
Stanford Knowledgebase
Ross Thought in Action

MBA Programs: The Rest of the World

As there is some variety in the length of international MBA programs, we have denoted the length of the program next to its name (1 = one year; 2 = 2 years). If an MBA Program is not listed, please e-mail and we will be happy to list it.

Additional Resources

Archives

GMAT Practice Question: Machines A, B, and C

Today’s GMAT practice problem comes from the test prep firm ManhattanGMAT.  To help prepare for the exam, see if you can solve the problem first, then read on for the correct answer and explanation.

Problem

Machines A, B, and C can either load nails into a bin or unload nails from that bin. Each machine works at a constant rate that is the same for loading and for unloading, although the individual machines may have different rates. Working together to load at their respective constant rates, machines A and B can load the bin in 6 minutes. Likewise, working together to load at their respective constant rates, machines B and C can load the bin in 9 minutes. How long will it take machine A to load the bin if machine C is simultaneously unloading the bin?

(A) 12 minutes
(B) 15 minutes
(C) 18 minutes
(D) 36 minutes
(E) 54 minutes

Solution

Write each machine’s rate as a lowercase letter. We add the rates for each given situation in which machines are working together to load the bin:

a + b = 1/6 bin per minute
b + c = 1/9 bin per minute

Notice that the rate should always be in “work per time” – in this case, “bins per minute,” not “minutes per bin.” If it takes machines A and B 6 minutes to load the bin, then they work at a rate of 1/6 of a bin per minute.

We are looking for an equation involving the difference of machine A’s rate and machine C’s rate. In other words, we are looking for a – c. The negative sign in front of the c indicates that machine C is unloading; in other words, it is working “against” machine A.

We can subtract the two given equations to get the following:
a – c = 1/6 – 1/9 = 3/18 – 2/18 = 1/18 bin per minute

Thus, it will take 18 minutes for machine A to load the bin, if machine C is simultaneously unloading the bin.

The correct answer is (C).

Leave a Reply

 

 

 

You can use these HTML tags

<a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>