Consider a chain structured computation represented by a weighted graph G = (V, E) where V = {v1, v2, , vn} and E = {(vi , vi+1) | 1 ? i ? n ? 1}. We are also given a chain-structure m identical processors P = {P1, , Pm} (i.e., there exists a communication link between Pk and Pk+1 for 1 ? k ? m ? 1).

The set of vertices V represents computation modules, and the set of edges E represents communication between the two modules. Each node vi is assigned a weight wi denoting the execution time of the module on a single processor. Each edge (vi , vi+1) is assigned a weight ci denoting the amount of communication time between the two modules if they are assigned two different processors. If multiple modules are assigned to the same processor, the modules assigned to the same processor must be consecutive. Suppose modules va, va+1, , vb are assigned to Processor Pk. Then, the time taken by Pk, denoted by Tk, is the time to compute assigned modules plus the time to communicate between neighboring processors. Hence, Tk = P a?i?b wi + ca?1 + cb. Note here that ca?1 = 0 if a = 1 and cb = 0 if b = n.

The objective of the problem is to find an assignment ? : V ? P such that max1?k?m Tk is minimized, where we assume that each processor must take at least one module. (This assumption can be relaxed by adding m dummy modules with zero weight on computational and communication time.)

10. A and B are Boolean variables. They are either true or false. Consider the following table of joint probabilities. Give your Answer with two digits to the right of the decimal point(E.g., 0.20, not 0.2 or 0.200). A A' B 0.02 0.47 B' 0.05 0.46 What is P(A'|B)?QUESTION 11 We can think of s as key-value databases where the value is examinable. O a. Key-Value Database O b. Document Database O C. Column-Family Database O d. Graph Database QUESTION 12 Which of the following is not an aggregate-oriented database? O a. Key-Value Database O b. Document Database O c. Column-Family Database O d. Graph Database QUESTION 13 Which of the following databases would be a good choice for storing an e-commerce shopping cart? O a. Key-Value Database O b. Document Database O C. Column-Family Database O d. Graph Database QUESTION 14 Which of the following databases would be a good choice for storing web application session data? O a. Key-Value Database O b. Document Database O c. Column-Family Database O d. Graph Database QUESTION 15 We can query data fields in a O a. Key-Value Database O b. Document Database O C. Column-Family Database O d. Graph DatabaseThrough the grants of power in the Constitution, the framers sought to O A. define the powers of state governments. O B. create a government in which sovereignty was invested in the national government only. O . both empower government and limit it. O D. enumerate the rights of individuals. O E. abolish slavery.9% (10 marks) Answer the following: a. MPC = .?.What is the government spending multiplier? h. MPC = .85.What is the tax multiplier? c. If the government spending multiplier is 5, what is the tax multiplier? d. If the tax multiplier is -3, what is the government spending multiplier? e. If government purchases and taxes are increased by $150 billion simultaneously, what will the effect he on equilibrium output (income)? The table below shows a small database whose records correspond to courses offered in a university. Course Number Course Title Instructor Quarter CS 111 Digital Image Processing Gupta Spring CS 112 Computer Graphics Gupta Spring CS 117 Project in Computer Vision Hawkins Fall CS 116 Intro to Computer Vision Hawkins Winter CS 122A Intro to Database Management Spencer Spring CS 122A Intro to Database Management Wang Winter CS 122C Principles of Database Management Spencer Winter (a) Give a key for this database