1. Are the following topics covered in the portion of the chapter that you were supposed to read for today's class? mark Y (yes) or N (no) for each topic:
2. Let us assume that there is a queue of professors at the cafeteria. Show, step-by-step, what will happen if first N (Novick) arrives at the queue, then K (Kreinovich) follows, then N is served, then R (Roy) and C (Ceberio) join the queue.
3. For extra credit: write codes for push and pop in a stack when the stack is implemented as a an array.