Design an algorithm to solve the following problem. Input: a directed, acyclic graph G=(V,E) and two vertices s and t. Output: the number of directed paths from s to t (this number may be zero).

A directed acyclic graph has a unique source vertex and a unique sink vertex. It is true that this graph has a unique topological sorting?

“Recognize how children influence and respond to what happens around them.” Which of the following NEPEM categories does this statement BEST match:

Celtic military forays to the Mediterranean world may have been inspired by

Which of the following BEST matches with the “Activities” portion of a logic model?

Insrtuctions for problems 2-5: For each of the following problems, you do not have to prove the correctness of your design or report its runtime. You can use the algorithms from class, such as DFS, Explore, BFS, Dijkstra’s (using min-heaps), SCC, Kruskal’s, Prim’s etc., as a blackbox subroutine for your algorithm. Make sure to explain your algorithm in words (no pseudocode!). Faster – and correct – designs worth more credit.

Design an algorithm to solve the following problem. Input: a weighted, undirected graph G=(V,E) with positive edge weights, along with and edge e. Output: the length of the shortest cycle containing e, or report if such cycle does not exist.

According to the research done by Radey & Randolph (2008), which of the following sources of parenting information is the LEAST commonly accessed?

Which of the following is NOT an example of the group mode of parent education?

A series circuit consists of a 0.55-H inductor with internal resistance of 8.0 Ω connected in series with a 4.0-Ω resistor, an open switch, and an ideal 12-V battery.   (a) When the switch is closed, what is the initial current through the 4.0-Ω resistor?  [currinit][currunits] (b) What is the current through the 4.0-Ω resistor a very long time after the switch is closed?  [currfin][currunits2]