Answered: 1 int computeArithmeticProgression(int… | bartleby

C++ Programming: From Problem Analysis to Program Design

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Related questions

Question

I need the answer as soon as possible

Consider the method provided in the image attached below. Provide the instruction count in the average case for this
method (lines 2, 3, 4, and 6). Answer with the following format:
line #: Instruction count
1
1 int computeArithmeticProgression(int num) {
int sum
for (int i = 1; i <= num; i++) {
4
sum += i;
}
6
return sum ;
7 }

Expert Solution

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Blurred answer

Similar questions

Implement two different versions of quicksort in a high level programming language. The first version will use the first element of the array as the pivot. The second version will use the median of the first element, middle element, and last element of the array as the pivot. For each version, compare the performance on random arrays of data of sizes 10n for n = 2, 3, and 4. Create three graphs (one for the random data, one for the increasing data, and one for the decreasing data) to illustrate your results. Discuss these results.
The language for coding must be in python Neural Network Units Implement a single sigmoid neural network unit with weights of [-1.2, -1.1, 3.3, -2.1] Calculate the outputs for two training examples:Example 1: [0.9, 10.0, 3.1, 1]Example 2: [0.9, 2.1, 3.7, 1] Note that you don't have to explicitly include a threshold or bias since the examples include a last element of 1 which means that the last weight effectively operates as a threshold. Assuming that a sigmoid unit response >0.5 denotes a positive class and <0.5 is negative class, is example 1 positive or negative? is example 2 positive or negative? Create a single ReLU unit and provide the outputs for those examples. Calculate the derivative of the sigmoid with respect to net input for both examples Calculate the derivative of the ReLU with respect to net input for both examples
What is the time complexity for the best and worst case of the "Main" applet listed below? What does the program do? def Main(array, n, elem): subProgram1(X,n) p = subProgram2(X,1,n,elem) def SubProgram1(array, n): for k in range(1,n): y = X[k] i = k - 1 while i >= 0 and X[i] > y: X[i+1] = X[i] i -= 1 X[i+1] = y def subProgram2(array, ini, n, elem): i = (ini+n)/2 if X[i] == elem: return i if ini == n: return -1 if X[i] < elem: subProgram2(X, i+1, n, elem) else: subProgram2(X, ini, i-1, elem)
Problem: The Eight Queens problem is to find a solution to place a queen in each row on a chessboard such that no two queens can attack each other. Code below package queenchees; import static java.lang.Byte.SIZE;import javafx.application.Application;import javafx.event.ActionEvent;import javafx.event.EventHandler;import javafx.scene.Scene;import javafx.scene.control.Button;import javafx.scene.layout.Pane;import javafx.stage.Stage;import javafx.scene.image.Image;import javafx.scene.image.ImageView;import javafx.scene.shape.Line; public class QueenChees extends Application { // Declare a variable private static final int SIZE = 8; // Declare an array private int[] queens = new int[SIZE]; // Override start method @Override // Start method public void start(Stage primaryStage) { // Call the function search(0); // Create a chess CB ChessBoard CB = new ChessBoard(); // Create a scene Scene scene = new Scene(CB,…
Generate a graph of performance improvement for code below. Tip: Figure 5.17 in the textbook provides an example of a graph depicting performance improvements associated with loop unrolling. code: //normal code int main() { int n, sum=0; n=50; int a[50]; { for(int i=0; i<n; i++) { sum= sum +a[i]; } printf("sum is %d", sum); return 0; } //with unrolling int main() { int n, sum=0; n=50; int a[50] for(int i=0; i<n; i+=10) { scanf("%d", &a[i]); } sum= sum + a[0]; sum= sum + a[1]; sum= sum + a[2]; sum= sum + a[3]; sum= sum + a[4]; sum= sum + a[5]; sum= sum + a[6]; sum= sum + a[7]; sum= sum + a[8]; sum= sum + a[9]; printf("sum is %d", sum); return 0; }
The language must be in python. Just do numbers 5-7 Neural Network Units Implement a single sigmoid neural network unit with weights of [-1.2, -1.1, 3.3, -2.1] Calculate the outputs for two training examples:Example 1: [0.9, 10.0, 3.1, 1]Example 2: [0.9, 2.1, 3.7, 1] Note that you don't have to explicitly include a threshold or bias since the examples include a last element of 1 which means that the last weight effectively operates as a threshold. Assuming that a sigmoid unit response >0.5 denotes a positive class and <0.5 is negative class, is example 1 positive or negative? is example 2 positive or negative? Create a single ReLU unit and provide the outputs for those examples. Calculate the derivative of the sigmoid with respect to net input for both examples Calculate the derivative of the ReLU with respect to net input for both examples
Design and implement a Turing Machine to perform the conversion of a binary number to Two's Complement, using the 'fast' method described in the class notes. Recall that the fast method starts at the LSB (to the right), leaves all 0's and the first 1 alone, then flips all the remaining bits. The tape will consist of a 'sign' bit (0 for positive, 1 for negative), a blank space, and then the number to convert. After conversion, the sign bit is removed. Here are some examples: INPUT : ... # 0 # 00100001 # ... OUTPUT: ... # # # 00100001 # ... INPUT : ... # 1 # 00101000 # ... OUTPUT: ... # # # 11011000 # ... Give the TM diagram, as well as the state transition table, using the notation described in the class notes and associated lab. You can find a sample in the picture. Thanks
write a assembly program to Filtering out odd and evens void filter(int* arr, int evn, int* odd, int size); int main() { int arr [10] = {3, 8, 7, 6, 4, 3, 2, 16, 13, 14}; int evn [10] = {0}; int odd[10] = {0}; return 0; }
Develop a brute-force algorithm that finds the longest common sequential elements of two given lists with the Java programming language. For example, the following two lists are given: S1 = [B,C,D,A,A,C,D] S2 = [A,C,D,B,A,C] Common lists are: [B,C], [C,D,A,C], [D,A,C], [A,A,C], [A,C], [C,D], … Note that although both lists have a common [C,D,A,C] (sub)list, both list items are skipped and the left-to-right order is intact. Apply the brute force algorithm. Explain Time Complexity?
write a c++ program for the following Take a Boolean 2D array of 10X 10, where each row is sorted from the user, Find the row with themaximum number of 1s.Example:Input matrix0 1 1 10 0 1 11 1 1 1 // this row has maximum 1s0 0 0 0Output: 2
There are two algorithms called alg1 and alg2 for a problem of size n. alg1 runs in n2 microseconds and alg2 runs in 100n log n microseconds. alg1 can be implemented using 4 hours of programmer time and needs 2 minutes of cpu time. on the other hand, alg2 requires 15 hours of programmer time and 6 minutes of cpu time. if programmers are paid 20 dollars per hour and cpu time costs 50 dollars per minute, how many times must a problem instance of size 500 be solved using alg2 in order to justify its development cost?
This is a MATLAB Coding problem: Implement a recursive function, called count, that takes two inputs, an array of integers and target integer. count should search the array for the target integer and return the number of occurrences of the target integer in the array. For example: disp(count([1, 2, 4, 1, 2, 1], 1)) % Generates 3disp(count([1, 2, 4, 1, 2, 1], 2)) % Generates 2disp(count([1, 2, 4, 1, 2, 1], 4)) % Generates 1disp(count([1, 2, 4, 1, 2, 1], 9000)) % Generates 0

SEE MORE QUESTIONS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

C++ Programming: From Problem Analysis to Program…

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS