medium · GMAT Quant
A network engineer is configuring a data routing protocol where packets must travel through a 4 × 3 grid of nodes. A packet starts at the bottom-left node and must reach the top-right node, moving only one node to the right or one node up at a time.
What is the number of different paths a packet can take?
- 35
- 12
- 210
- 81
- 32
Sign up free to see the explanation and track your rank →
More GMAT Quant practice
- Including both endpoints, how many distinct integer price points are in this range?
- Which of the following expressions must result in a positive value?
- Which property of arithmetic justifies that first step?
- Which of the following must also be an even integer?
- Which of the following inequalities correctly represents this range?
- Which of the following includes the number 0?
- How many unique meal combinations can a customer create?
- What is the probability that the lightbulb is functional?