b. S = 5 /D + 6 * (C + B)/E
c. R = A < B AND C * F > G + 3
Answer:---------------
a. D = A + B/ 5
------------- (+) ------------------------ |
b. S = 5 /D + 6 * (C + B)/E
------------- (+) ------------------------ |
c. R = A < B AND C * F > G + 3
------------- (AND) ------------------------ |
1) a) If A is a 4×5 matrix and B is a 5×2 matrix, then size of AB is: b) If C is a 3×4 matrix and size of DC is 2×4 matrix , then size of D is: c) True or False: If A and B are both 3 × 3 then AB = BA d) The 2 × 2 identity matrix is: I = e) Shade the region 3x + 2y > 6. f) Write the augmented matrix...
(1,3), с %3D (2,1), d (3,4) (1,2), b (4,2), f (5,3) and (5,5). Let 5. Let a = е 3 - {a, b, c, d, e, f, g} be the set of these 7 points. We define the following partial order on S: We have (r, y)(', y) iff x< x and y < / Draw the Hasse diagram of S S 6. We consider the same partial order as in Problem 5, but it is now defined on R2....
5 B A 7 F 2 D 4 E 6 G (10 pts.) Remember that shortestpath () finds shortest paths from a single source to all des- tinations. Use shortestpath() remaining vertices. Generate the paths in an ascending order of length and complete the following table. Again, to obtain the length of the shortest paths from vertex A to all assume that ties are broken by alphabetical order in choose(). Iteration S Vertex Distance selected A B F G E...
File Edit Format View Help Graphs and trees 4. [6 marks] Using the following graph representation (G(V,E,w)): v a,b,c,d,e,f E fa,b), (a,f),fa,d), (b,e), (b,d), (c,f),(c,d),(d,e),d,f)) W(a,b) 4,W(a,f) 9,W(a,d) 10 W(b,e) 12,W(b,d) 7,W(c,d) 3 a) Draw the graph including weights. b) Given the following algorithm for Inding a minimum spanning tree for a graph: Given a graph (G(V,E)) create a new graph (F) with nodes (V) and no edges Add all the edges (E) to a set S and order them...
Let gx)- t) dt, where f is the function whose graph is shown (a) Evaluate gtx) for x - 0, 1, 2, 3, 4, 5, and 6 gt1)-1/2 0t2)-0 g(3) - -1/2 ot4)-0 9(5)-3/2 9(6)-4 (b) Estimate g(7). (Use the midpoint to get the most precise estimate.) 9(7)- (c) Where does g have a maximum and a minimum value? minimumx maximum x (d) Sketch a rough graph of g.
Let gx)- t) dt, where f is the function whose graph...
Q4 The network diagram of a project is shown below E.4 B.3 G.5 D.5 A.7 F.2 C.4 (a) Use two-pass method to determine the critical path. (3 points) (b) What is the project duration? ( points) (c) What is the slack time of activity F? ( points)
Q4 The network diagram of a project is shown below E.4 B.3 G.5 D.5 A.7 F.2 C.4 (a) Use two-pass method to determine the critical path. (3 points) (b) What is the project...
0.09/1 points Previous Answers SCalcET8 5.3.002. Let g(x)-f(t) dt, where f is the function whose graph is shown (a) Evaluate g(x) for x 0, 1, 2, 3, 4, 5, and 6 g(0)0 9(2)-8 g(3)-( 20 9(4)- 9(5) 9(6) ) g(6)- (b) Estimate g(7). (Use the midpoint to get the most precise estimate.) 9(7)- (c) Where does g have a maximum and a minimum value? minimum x= maximum x= (d) Sketch a rough graph of g. 7 83 gtx ry again....
1. Evaluate the following determinants: 8 7 3 4 0 2 (a) 4 0 1 (c) 6 0 3 6 03 8 2 3 ab (e) b c с a b 1 1 1 2 3 (b) 4 7 5 3 6 9 4 -2 (d) 8 11 4 х (f) 3 9 5 0 y 2 -18 7
Explain ur working
4. [6 marks] Using the following graph representation (G(VE,w)): V a, b,c, d,e, fh E -la, b, [a, fl,la,d, (b,ej, [b,d, c,fl,fc,d],Id,el, sd, f) W(a, b) 4, W(a, f)-9, W(a, d)-10 W(b, e) 12, W (b, d)7, W(c,d) 3 a) [3 marks] Draw the graph including weights. b) [2 + 1-3 marks] Given the following algorithm for finding a minimum spanning tree for a graph: Given a graph (G(V,E)) create a new graph (F) vith nodes (V)...
Consider the following graph of f(x) on the closed interval (0,5): 5 4 3 2 1 0 -1 0 1 2 3 5 6 (If the picture doesn't load, click here 95graph2) Use the graph of f(x) to answer the following: (a) On what interval(s) is f(x) increasing? (b) On what interval(s) is f(x) decreasing? (c) On what interval(s) is f(x) concave up? (d) On what interval(s) is f(x) concave down? (e) Where are the inflection points (both x and...