Author: Anonymous

3. A fault tree analysis (FTA) differs from a reliability block diagram (RBD) in that an FTA

4. Which of the following is the most effective technique for prioritizing resources to improve system design?

Consider a graph where a vertex `u` currently has the smallest tentative distance and is about to be settled. A different path to another unsettled vertex `v` goes through one negative-weight edge later in the path. Which statement best explains the danger?

Why is pivot quality central to the running time of partition-based selection?

In the deterministic linear-time selection algorithm, after choosing the pivot recursively from the medians of groups of 5, the algorithm makes at most one recursive call on one side of the partition in addition to the pivot-selection recursion.

For interval scheduling, which of the following rules can fail to produce an optimal solution on some input? Select all that apply.

Suppose a student proposes the following interval-scheduling rule: “At each step, choose the interval that conflicts with the fewest remaining intervals; if tied, break ties by shortest length.” Which of the following are valid critiques? Select all that apply.

In a contradiction or exchange proof for interval scheduling by earliest finish time, which exchange is the key valid move?

In Dijkstra’s algorithm, what is true about a vertex once it is added to the settled set `S`?

If your only goal is to find the shortest path from source `s` to one target vertex `v`, when is it safe to stop Dijkstra’s algorithm?