Data Sufficiency

Question 1

Yes/No solving strategy

Answer 1

1. Pick any number that keeps the first (or second) statement true
   2.double check #1
2. What answer will it give you in the question a yes or a no?
3. Repeat 1-3 actively try to get the opposite in the question: yes or no.
   If the multiple values give you both “yes” and “no”. The statement is not sufficient

Question 2

What are the steps to solving DS problems?

Answer 2

1. Determine whether the question is value or yes/no.
   value?= sufficient if there is 1 value, NS if there is more than 1 or none at all.
   yes/no?= sufficient when always yes or always no
2. Separate given info from the question itself.
3. Rephrase the question
4. Use AD/BCE grid to eliminate answers

Question 3

What should you do when a question asks for a value or yes/no that is a combo ?

Answer 3

1. Notice that all you need is a combo- speak out loud and articulate how to reveal the combo
2. Manipulate the given statement to look like the combo in question.
   Watch out for c traps they are common in combo problems.

Question 4

what are hidden constraints and when do they appear?

Answer 4

Hidden constraints appear in DS and PS problems. They often are in the shape of units of measure. For example, you cannot buy -4 stamps, thus the value would be positive. You also cannot buy 1/2 of a stamp, thus the value needs to be an integer.