CS代考 CS61B Fall 2009 – cscodehelp代写

CS61B Fall 2009
UNIVERSITY OF CALIFORNIA Department of Electrical Engineering and Computer Sciences Computer Science Division
Test #3 (corrected)
P. N. Hilfinger

Copyright By cscodehelp代写 加微信 cscodehelp

READ THIS PAGE FIRST. Please do not discuss this exam with people who haven’t taken it. Your exam should contain 6 problems on 7 pages. Officially, it is worth 20 points (out of a total of 200).
This is an open-book test. You have fifty minutes to complete it. You may consult any books, notes, or other inanimate objects available to you. You may use any program text supplied in lectures, problem sets, or solutions. Please write your answers in the spaces provided in the test. Make sure to put your name, login, and lab section in the space provided below. Put your login and initials clearly on each page of this test and on any additional sheets of paper you use for your answers.
Be warned: my tests are known to cause panic. Fortunately, this reputation is entirely unjus- tified. Just read all the questions carefully to begin with, and first try to answer those parts about which you feel most confident. Do not be alarmed if some of the answers are obvious. Should you feel an attack of anxiety coming on, feel free to jump up and run around the outside of the building once or twice.
Your name:
Login of person to your Left: Right:
Discussion section number or time:
Discussion TA:
Lab section number or time:

Test #3 Login: Initials: 2
Unless a question says otherwise, time estimates refer to asymptotic bounds (O(· · ·), Ω(· · ·), Θ(· · ·)). Always give the simplest bounds possible (O(f (x)) is “simpler” than O(f (x) + g(x)) and O(Kf(x))).
1. [3 points] A suffix tree for a string S is a trie that contains all suffixes of S. For example, if S is “banana✷”, its suffix tree is a trie contains the seven strings “banana✷,” “anana✷,” “nana✷,” . . . , “✷” (where ‘✷’ is a unique terminating character).
a. [2 points] Draw the suffix tree for “banana✷.”
b. [1 point] Given a string P and a suffix tree for a string S, describe succinctly how to determine whether P is a substring of S (i.e., not necessarily a suffix) in time proportional only to the length of P.

Test #3 Login: Initials: 3
2. [3 points] In a directed graph with N nodes, let the edges be represented by an N × N array E, so that E[i][j] is the weight (or length) of the edge from node i to node j (assume nodes are identified by numbers 0..N − 1). E[i][i] = 0 for all i. If there is no edge from i to j, then E[i][j]= ∞.
a. [1point]Thefollowingalgorithm(knownastheFloyd-Warshallalgorithm)computesd[i][j], the length of the shortest path from node i to node j, for all pairs i and j:
Initialize d to the contents of E; for (int k = 0; k < N; k += 1) for (int i = 0; i < N; i += 1) for (int j = 0; j < N; j += 1) d[i][j] = Math.min (d[i][j], d[i][k] + d[k][j]); Assuming that Math.min (the minimum function) takes constant time, what is the best- case time cost of this algorithm, as a function of N, the number of vertices? What is the worst-case time cost? b. [2 points] Under the same assumptions as part (a), what are the best and worst case costs of computing d[i][j] for all i and j using Dijkstra’s algorithm, assuming that the graph is connected? Give your reasoning. Under what circumstances, if any, is it better to use Dijkstra’s algorithm for this purpose than the Floyd-Warshall algorithm? Test #3 Login: Initials: 4 3. [2 points] Consider 2-4 trees containing the (integer) keys 1–15. a. Illustrate the 2-4 tree with these keys having the smallest possible height. b. Illustrate a 2-4 tree containing keys 1–15 and having the largest possible height. Test #3 Login: Initials: 5 4. [4 points] Consider the problem of sorting N distinct strings each of length K = 4 lg N using a radix sort, assuming that the strings contain only the characters ‘A’ and ‘B’. a. Using LSD radix sort, how long will this take; that is, what are the best- and worst-case times? Give your reasoning. Assume that (as in Java), moving a string is a constant-time operation (that is, it involves copying a pointer rather than the characters themselves). b. Suppose instead we sort the strings in part (a) using MSD radix sort. Now what are the best and worst-case times? Give your reasoning. Test #3 Login: Initials: 5. Fill in the blank to correctly complete the quotation below: She got the which of what-she-did, Hid the bell with a blot, she did, But she fell in love with a Where is the which of the what-she-did? 6. [8 points] In discussing random numbers, I remarked that the following is not a good general solution to the problem of randomly selecting K different numbers in the range 0..N − 1 when N is much larger than K: /** Fill B with a random selection of A.length different integers in the range 0 .. N-1, where N >= B.length, using R as a random source. */
void choose1 (int[] B, int N, java.util.Random R) { int K = B.length;
int[] A = new int[N];
for (int i = 0; i < N; i += 1) for (int k = 0; k < K; k += 1) { swap A[N-1-k] with A[R.nextInt (N-k)]; B[k] = A[N-1-k]; (.nextInt(p) selects a pseudo-random number in the range 0 to p − 1.) This algorithm fills an array with 0..N, and then swaps the last item with a random item in the array, the second to last with a random item in the first N − 1 items, and so forth for a total of K items. a. [1 point] Give a time bound on choose1 as a function of N, K, or both, assuming that .nextInt requires constant time. b. [6 points] With a better choice of data structure in place of array A, this algorithm is not so bad. Specifically, I’d like to write it as: void choose2 (int[] B, int N, java.util.Random R) { int K = B.length; Ints A = new Ints (N); /* A is initialized to 0, 1, ..., N-1 */ for (int k = 0; k < K; k += 1) { A.swap (N-1-k, R.nextInt (N-k)); B[k] = A.get (N-1-k); } implemented in such a way that it uses only O(K) space. Fill in the class definition on the next page to give the desired effect. Use anything in the Java library you want. Don’t bother to detect errors. Login: Initials: 7 /** A sequence of ints, indexed (like an array) from 0. Uses space * proportional to min(N, M), where N is the size of the sequence and * M is the number of swap operations applied. */ public class Ints { /** An N-element sequence initialized to { 0, 1, ..., N-1 }. */ public Ints (int N) { // FILL IN /** The length of this sequence. */ public int size () { // FILL IN /** The Ith item in this sequence (numbering from 0). */ public int get (int i) { // FILL IN /** Swap the Ith and Jth item in this sequence. */ public void swap (int i, int j) { // FILL IN c. [1 point] Give a time bound on choose2 with your implementation of Ints, as a function of N, K, or both, and show your reasoning. State any assumptions you make about the speed of methods in the Java library. 程序代写 CS代考 加微信: cscodehelp QQ: 2235208643 Email: kyit630461@163.com