3 Let A: (-1 -1 -1 +1 +1 -1 +1 +1), B: (-1 -1 +1 -1 +1 +1 +1 -1), C: (-1 +1 -1 +1 +1+1 -1 -1), andD: (-1 +1 -1 -1 -1 -1 +1 -1).S1=0-4 2 0 22; S2=2 -2-24;S3=0-24-22; S4=2 20.2-403;S5=-2-22-4; S6=2 2-2-4-203;S7=0-2-2 -4 22; S8=-2 2-4-20;What data do A, B, C and D send in S1 to S8? (64)

The given data is A: (-1-1-1+1+1-1+1+1) by calculating this expression. The value of A is 0 B:…

3 Let A: (-1 -1 +1), B: (-1 -1 +1 -1 +1 +1 +1 -1), C: (-1 +1 -1 +1 +1 +1 -1 -1), and D: (-1 +1 -1 -1 -1 -1 +1 -1). S1=0 -4 2 0 2 2 2; S2=2 -2 0. 2 0. -2 4; S3=0 -2 4. -2 2; S4=2 2 -4 0; S5=-2 -2 0. 2 -4; S6=2 2 -2 -4 -2 0; S7=0 -2 0 -2 -4 2; S8=-2 2 -4 -2 0 03; What data do A, B, C and D send in S1 to S8? (64)

3 Let A: (-1 -1 +1), B: (-1 -1 +1 -1 +1 +1 +1 -1), C: (-1 +1 -1 +1 +1 +1 -1 -1), and D: (-1 +1 -1 -1 -1 -1 +1 -1). S1=0 -4 2 0 2 2 2; S2=2 -2 0. 2 0. -2 4; S3=0 -2 4. -2 2; S4=2 2 -4 0; S5=-2 -2 0. 2 -4; S6=2 2 -2 -4 -2 0; S7=0 -2 0 -2 -4 2; S8=-2 2 -4 -2 0 03; What data do A, B, C and D send in S1 to S8? (64)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 7SA

See similar textbooks

Similar questions

[Unbalanced Rod] Given a set of n weights {w₁,..., wn} and a rod of length n - 1 inches, we can attach the weights to the rod at hooks placed at one inch distances apart as shown in the figure below. -1". /10 2 3 12 2 4 We can attach a weight to any hook but no two weights can be attached to the same hook and we have to attach all the weights. For any given assignment of weights to hooks, we can compute the location of the center of mass of the rod and the weights according to the following equation (neglecting the weights of the rod and the hooks). where 0 ≤ Pi≤n-1 is the position of weight along the rod. For example, in the figure shown above, the center of mass is computed as C= C = i Wi Pi Σi Wi 10 0+2 1+3·2+4·3+12.4 +2.5 10+2+3+4+12+2 78 33 The problem is to find an assignment of weights to hooks that makes the center of mass as far as possible to the left, i.e., minimize the value of c. Answer the following questions. 1. Describe a greedy algorithm that finds the assignments that…
Let A = {a, b, c} and B = {u, v}. Write a. A × B b. B × A
Ex: Let A1 ={x, y}, A2 ={1, 2}, and A3 ={a, b}, Find A1 × A2, (A1 × A2) × A3, A1 × A2 × A3.
1. Determine |A|, where: {z} b. A = {{z}} _d. A = {z, {z}, {z, {z}}} _e. A = P({z}) _f. A = P({Ø,z}) a. A = _c. A = {z, {z}}
2.a Σ : {c,A,G,T}, L = { w : w = CAG™T™C, m = j + n }. For example, CAGTTC E L; CTAGTC ¢ L because the symbols are not in the order specified by the characteristic function; CAGTT ¢ L because it does not end with c; and CAGGTTC € L because the number of T's do not equal the number of A's plus the number of G's. Prove that L¢ RLs using the RL pumping theorem.
code in java pls Summary: Given integer values for red, green, and blue, subtract the gray from each value. Computers represent color by combining the sub-colors red, green, and blue (rgb). Each sub-color's value can range from 0 to 255. Thus (255, 0, 0) is bright red, (130, 0, 130) is a medium purple, (0, 0, 0) is black, (255, 255, 255) is white, and (40, 40, 40) is a dark gray. (130, 50, 130) is a faded purple, due to the (50, 50, 50) gray part. (In other words, equal amounts of red, green, blue yield gray). Given values for red, green, and blue, remove the gray part. Ex: If the input is: 130 50 130 the output is: 80 0 80 Find the smallest value, and then subtract it from all three values, thus removing the gray.
Write recursive functions for the following equations:a. Harmonic number is defined by the equationb. Fibonacci numbers are defined by the formula:FN = FN-2 + FN-1, for N ≥ 2 with F0 = 0 and F1 = 1
Given L = {w = {a, b}*: |w| is even}, the correct statements are: (aa U ab Uba U bb)* is a regular expression that generates L. (ab Uba)* is a regular expression that generates L. aa U ab U ba U bb is a regular expression that generates L. ab U ba is a regular expression that generates L.
Write regular expression for: Σ = {a,b} L = {all words that can be of any length and only have one letter b in them} Using + as ONE or more occurences Using * as ZERO or more occurences Using () for grouping
Let A = {b, h, s}. Draw A(r) for each regular expression r below. (iii) r3 = (sh)*
[Fish Tank] You play with a clown fish that has an initial size so. The fish can eat other fish in a tank organized in m columns and n rows. The fish at column i and row j has a positive size si,j. When your fish eats another fish, it grows by that amount. For example, if your clown fish has a size of 10 and eats a fish of size 5, it becomes of size 15. You cannot eat a fish that is bigger than your size. The game starts by eating any fish in the first (left-most) column that is not bigger than yours. After that, you advance one column at a time by moving right. You have only three allowed moves. You either stay at the same row, move one row higher or one row lower. You will always move to the right. Thus, you will make exactly m moves to advance from left to right. Your goal is to exit the fish tank from the right with the biggest possible size. The figure below shows an example with the best answer highlighted. In this case, the final fish size is 71 (10+8+7+24+22). You are required…
B=(1)/(4)e*p slove for e