Next up from SIGCSE 2018 is John MacCormick's session on Strategies for Baing the CS Theory Course on Non-decision Problems MacCormicks's stance is that CS theory is tough the first time around and using non-decision problems is a viable approach to make theory more accessible to beginners. As MacCormick said in his paper: … a decision problem may ask the yes/no question, "Does this graph have a Hamilton cycle?" The corresponding non-decision problem is, "Please give me a Hamilton cycle of this graph if it has one.