Quiz — Lecture 24

Section A from memory, one line each. Section B shows your reasoning - marks are for method, not final answers. Answers are discussed in class; the exit ticket goes on a card.

Section A

A1. What two choices define a graph model?

A2. What does BFS give in an unweighted graph?

A3. How do you count connected components?

A4. What does a stalled topological peel mean?

Section B

B1. Friendships (1,2),(1,3),(4,5), vertex 6 alone: components and sizes.

B2. Prereqs b<a, c<a, d<b, e<c: give one valid order.

Exit ticket

Answer one of these on your card in 60 seconds (choose any one):

1. What is a node in the campus model, and why?

1. What does BFS level number mean?

1. When is there no valid ordering in cs-095?

Homework

• Before: skim the four student pages; attempt case 1 on paper.
• After: write a five-line pseudocode solution for any case you did not
• Enrichment (optional): the stretch question on each case page.