GUTHMExercise 3 (Loop)x'+ 3x +2 for 0sx<1.5f(x) = {x4+ Vx+1for 1.5 sx <3.02X+5for 3s x<5.0Iog (*+1)• If a long x= 0 to x = 5.0, let define x, i= 1, 2, 3, ., N. where dx is distancebetween two successive point x, and x,. is equal to 0.01+x.Write the flowchart and pseudocode, so the program will find the maximumvalue of f(x)Premier Thmical Universitywww.uthm.edu.my

The conditions given are:- If long x = 0 to x = 5.0 define xi i = 1, 2, 3, ....., N. dx = distance…

Answered: Exercise 3 (Loop) for 0sx<15 for 1.5 sx…

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.3: Data Types

Problem 9E: (Practice) Although the total number of bytes varies from computer to computer, memory sizes of...

See similar textbooks

Similar questions

Q_5 Suppose f:RZ where fx=2x-1.If A={x |1x 4}, find f(A).If B={3,4,5,6,7}, find f(B).If C={-9, -8}, find f^ - 1(C)
For the following code fragment.LOOP: LD R1, 0(R2) ;load R1 from address 0+(R2) DADDI R1, R1, #1 ;R1 <– R1 + 1 SD R1, 0, (R2) ;store (R1) at address 0(R2) DADDI R2, R2, #4 ;R2 <– R2 + 4 DSUB R4, R3, R2 ;R4 <– R3 - R2 BNEZ R4, LOOP ;branch to LOOP if (R4) != 0Assume that the initial value of R3 is (R2)+20. Show the timing of this code fragment
Given X = {1, 2, 5, 8, 9}, Y = {3, 4, 6, 7, 8}, Z = {1, 2, 4, 6, 8} and U = {1, 2, 3, 4, 5, 6, 7, 8, 9}. Findthe following: 1. (X -Z̅) ∪ Y2. (X̅ ∪ Z) ∩ Y3. (Y ∩̅Z) ∩ X4. (X ∩ Z) - (X ∪ Y)5. Z̅ – (Y ∩ X)
The Virtual Weight (VW) of an integer number (which consists of more than 1 digit) is the sumof the individual digits that are composing the number. For example, consider the followingtwo numbers; 5638 and 1145, then the VW of each is calculated as following:VW(5638) = 5+6+3+8 = 22VW(1145) = 1+1+4+5 = 11Then, the VW can be classified as L (mean Low) or H (means High) using a specific cut-offvalue. For example, if the cut-off value is 15, then the VW of the number 5638 is H (High),and the VW of the number 1145 is L because 22 > 15 and 11 ≤ 15 respectivelyWrite a C++ program that: reads a positive integer n (where 5≤n≤20) from the user. If the user enters invalidnumber, then the program should continue prompting until he/she enters a valid numberwithin the specified range. Then, the program should generate n random numbers using the built-in rand()function. Every time a random number is generated, the program will classify that number as Lor H using the above method. Use a…
Let us define a sequence parity function as a function that takes in a sequence of binary inputs and returns a sequence indicating the number of 1’s in the input so far; specifically, if at time t the 1’s in the input so far is even it returns 1, and 0 if it is odd. For example, given input sequence [0, 1, 0, 1, 1, 0], the parity sequence is [0, 0, 0, 1, 0, 0]. Implement the minimal vanilla recurrent neural network to learn the parity function. Explain your rationale using a state transition diagram and parameters of the network.
v = (3, 5)print(v)p, q = v[0], v[1]r = p + qif r % 2 == 0:p = p + r - 5q = q + r - pr = r + 1v = (p, q)print(v)else:p = p - 1q = q - 1if r % 3 != 0:v = (p, q)print(v)else:p, q = q, pv = (p, q)print(v)
A = [15, 12, 13, 19, 14, 10, 16, 20, 9, 18, 8, 7]B = [19, 14, 8, 16, 20, 9, 18, 15, 12, 13, 7, 10]vN = 0for i in range(len (A)):vN = A[i]for j in range(len (B)):if B[j] ==vN:print ('A[',i,'] with B[',j,']') implementation this code with JUST one for loop
Practice 3: Let’s compile following C sequence for MIPS and run on the emulator: int divide(int N, int M) { // map q and i to $s2 and $s3 int q = 0; int i = N; while(i > 0) { q += 1; i = i - M; } return q; } int multiply(int N, int M) { // map sum and i to $s0 and $s1 int sum = 0; for(int i = 0; i < N; ++i) { sum += M; } return sum; } int main() { // map a, b, c, k, and j to $s0, $s1, $s2, $s3, and $s4 int a = 4; int b = 5; int c = 120; int k = multiply(a, b); int j = divide(c, k); } Make sure multiply procedure properly gets backup of $s0 to $s4. Verify that after running this sequence: • value of S0 is (4)10 • value of S1 is (5)10 • value of S2 is (120)10 • value of S3 is (20)10 • value of S4 is (6)10 When ready, copy your MIPS assembly code from emulator and save as a text file.
For each of the following two code segments, decide whether it is suitable for parallel execution and response according to your justification: add OpenMP pragmas to make the loop parallel or briefly explain why the code segment is not suitable for parallel execution. (A): for ( i = 0; i < n; i++ ) { x [ i ] = 3 * i + 5; y [ i ] = log ( x [ i ] ); } (B): x [ 0 ] = 1; x [ 1 ] = 2; for ( i = 2; i < n; i++ ) x [ i ] = x [ i – 1 ] * x [ i – 2 ] ;
Q3) Let Σ = {a , b}. Find DFA's for: d) L = { wab: w€ {a,b}*}e) L = { abwab: w€ {a,b}*}f) L = { ab5wb4 : w € {a,b}* }
Consider the following intermediate code:r1 = 5vl1 = r1jmp Simple.f@0jmp Simple.f@1Simple.f@0:write vl1r2 = 7r3 = vl1 + r2vl1 = r3jmp Simple.f@0Simple.f@1:r0 = vl1return(i) Describe briefly what the optimisation dead code elimination involves.(ii) Show the result of applying dead code elimination to the intermediate code above.
% Define the function f(x) f = @(x) -1*(x < 0) + 1*(x >= 0 & x <= 2); % Set the maximum value of N Nmax = 512; % Initialize the x-axis values for plotting x = linspace(-1,3,1000); % Compute the Fejér sums for various values of N F = zeros(length(x), Nmax); for N = 1:Nmax % Compute the Nth Fejér sum Sn = @(x) 0; for n = 1:N bn = (-1)^(n+1) / (n*pi); Sn = @(x) Sn(x) + bn*sin(n*pi*x); end FN = @(x) (1/N) * Sn(x); % Evaluate the Fejér sum at each point on the x-axis I tried to submit this to MATLAB, but can't seem to get it right.

SEE MORE QUESTIONS

Recommended textbooks for you

C++ for Engineers and Scientists

Computer Science

ISBN:

9781133187844

Author:

Bronson, Gary J.

Publisher:

Course Technology Ptr

C++ for Engineers and Scientists

Computer Science

ISBN:

9781133187844

Author:

Bronson, Gary J.

Publisher:

Course Technology Ptr

SEE MORE TEXTBOOKS