AI can be used to:

What is probably the most revolutionary innovation since the printing press?

[Module 5] Suppose d(u)=7, d(v)=15, and w(u,v)=5. After Relax(u,v), what is d(v)?

Suppose we want to find single-source shortest paths, but all the edge weights are negative. What would be the appropriate modification of Dijkstra’s algorithm?

[Module 4] Which property is essential for proving a greedy algorithm correct?

[Module 4] In Huffman coding, which characters should generally be placed closer to the root?

What is the minimum vertex cover in this graph? V = {a,b,c,d,e} E = {a,b}, {c,d}, {a,c}, {b,d}, {b,c}, {c,e}, {d.e}

[Module 6] The 2-approximation for Metric TSP first constructs:

Suppose I want to determine whether two strings, S and T, of length n, drawn from alphabet set D, are cryptoquips (the same under a permutation of the alphabet). For example, “abcabab” and “bcabcbc” are cryptoquips because we can map a to b, b to c, and c to a. Formally, they are cryptoquips if there exists a bijective function f:[1..|D|] –> [1..|D|] such that T[i] = f(S[i]). Which strategy can we use to do this efficiently?

[Module 5] Kruskal’s algorithm considers edges in: