# 9 Aug, 2021

Courses βΈ± Algorithms
You can also access the quiz on Itempool here if you want to practice, or see the notes below for more context.

#### In-class Quiz Questions

π
These questions pertain to the Oversized Pancake Flipper. "+" denotes happy side up.
1. Is it possible that the task is impossible?
1. Yes, even for K=2.
2. Yes, but only when K is very large; and it seems like it should be always possible if K = 2.
3. No, it's never impossible! In other words, the task is always possible for all values of K.
β
Yes, even for K = 2
Consider the input +- for K = 2.
1. What is the solution for: - - - + - + + - with K = 3? (Enter -1 for impossible.)
1. _______ (You were asked to enter a number in class.)
β
3
Flip at positions 1, 5, and 6 (1-based indexing).
1. What is the solution for: + + + + + with K = 4? (Enter -1 for impossible.)
1. _______ (You were asked to enter a number in class.)
β
0
Nothing to do.
1. What is the solution for: + - + - with K = 4? (Enter -1 for impossible.)
1. _______ (You were asked to enter a number in class.)
β
-1
This case is impossible.
1. Does the order in which the flips happen matter?
1. No, a set of flips executed in any sequence leads to the same outcome.
2. Yes, the sequence matters I can always find two different sequences of the SAME SET of flips leading to different outcomes.
3. It depends on the instance it may or may not matter.