1. true/false:
mark either t (true) or f (false) for each statement in below. write in one short sentence why you chose that answer, if necessary. you may lose points if your answer is very long.
a. adjacency lists are more space efficient than adjacency matrices for sparse graphs. a sparse graph g = (v, e) has |e| = o(|v|).
b. the maximum number of edges in a graph with n vertices is n (n +1) / 2 .
c. a spanning tree of a graph with n vertices contains n edges.
d. dijkstra’s algorithm does not work on directed graphs.
e. a dynamic programming algorithm makes short-sighted choices that are locally optimal.
f. dynamic programming is an appropriate choice to solve merge sort.
g. prim’s and kruskal’s algorithms are examples of greedy algorithms.
h. in a flow network, the capacity of an edge must be less than or equal to the flow on the edge.
i. dynamic programming uses memoization to avoid solving the same subproblem more than once.
j. choice of data structures do not impact the time complexity of graph algorithms.

1. package newton’s method for approximating square roots (case study 3.6) in a function named newton. this function expects the input number as an argument and returns the estimate of its square root. the script should also include a main function that allows the user to compute square roots of inputs until she presses the enter/return key. 2. convert newton’s method for approximating square roots in project 1 to a recursive function named newton. (hint: the estimate of the square root should be passed as a second argument to the function.) 3. elena complains that the recursive newton function in project 2 includes an extra argument for the estimate. the function’s users should not have to provide this value, which is always the same, when they call this function. modify the definition of the function so that it uses a keyword parameter with the appropriate default value for this argument, and call the function without a second argument to demonstrate that it solves this problem. 4. restructure newton’s method (case study 3.6) by decomposing it into three cooperating functions. the newton function can use either the recursive strategy of project 1 or the iterative strategy of case study 3.6. the task of testing for the limit is assigned to a function named limitreached, whereas the task of computing a new approximation is assigned to a function named improveestimate. each function expects the relevant arguments and returns an appropriate value. 5. a list is sorted in ascending order if it is empty or each item except the last one is less than or equal to its successor. define a predicate issorted that expects a list as an argument and returns true if the list is sorted, or returns false otherwise. (hint: for a list of length 2 or greater, loop through the list and compare pairs of items, from left to right, and return false if the first item in a pair is greater.)

Asoftware company hired ray, a college graduate to work in their development team. ray is assigned to work in the coding phase of a project. what happens during the coding phase of a software development project? a. the customer receives a working model of the software. b. developers convert the program design into code. c. developers gather requirements directly from the stakeholders. d. testing teams check the product for quality.

Rafael needs to add a title row to a table that he has inserted in word. what should he do? use the alignment options. use the merge and center option for all the cells in the top row. use the merge and center option on the first two cells in the top row. none of the above