Compute: z = y/Va 1 include 2 #include 3 #include 4 #include 5 using namespace std; 7 int main() ( double x; double y; double z; 10 11 cin >> x; cin >> y; 12 13 14 15 pa Your code goes here */ 16 cout <« fixed <« setprecision(2); // This will output onLy 2 decimal places. cout « z « endl; 17 18 19 20 return e; 21 }

Compute: z = y/Va 1 include 2 #include 3 #include 4 #include 5 using namespace std; 7 int main() ( double x; double y; double z; 10 11 cin >> x; cin >> y; 12 13 14 15 pa Your code goes here */ 16 cout <« fixed <« setprecision(2); // This will output onLy 2 decimal places. cout « z « endl; 17 18 19 20 return e; 21 }

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 3PE

See similar textbooks

Similar questions

#include<bits/stdc++.h>#include<math.h>using namespace std; class TotalResistance{double series_res,parallel_res,sp_res;public:TotalResistance(){series_res=parallel_res=sp_res=0;}void seriesResistance(double resistance[],int n);void parallelResistance(double resistance[],int n);void spResistance(double resistance[],int n);};void TotalResistance::seriesResistance(double resistance[],int n){for(int i=0;i<n;i++)series_res += resistance[i];cout<<"Total Resistance in series is: "<<series_res<<endl;}void TotalResistance::parallelResistance(double resistance[],int n){double temp=0;for(int i=0;i<n;i++)temp += (1/resistance[i]);parallel_res = 1/temp;cout<<"Total Resistance in parallel is: "<<parallel_res<<endl;}void TotalResistance::spResistance(double resistance[],int n){for(int i=0;i<n;i++)series_res += resistance[i];double temp=0;for(int i=0;i<n;i++)temp += (1/resistance[i]);parallel_res = 1/temp;cout<<"Total Resistance in…
* CENGAGE MINDTAP Q Search this course • Jar Programming Exercise 1-8 Instructions TableAndChairs.java + >- Terminal 1 class TableAndChairs { sandbox $ | public static void main(String[] args) { // Write your code here } 2 Write, compile, and test the TableAndChairs class that displays the pattern shown in Figure 1-25. 4 5 } XXXXXXXXXX X XXXXX X X XXXXX X X X X X X X X Figure 1-25 Output of TableAndChairs program Open image in a new tab The exact pattern is displayed below: X X X X XXXXXXXXXХ X XXXXX X XXXXX X X X X X X X X X Grading Write your Java code in the area on the right. Use the Run button to compile and run the code. Clicking the Run Checks button will run pre-configured tests against your code to calculate a grade. Once you are happy with your results, click the Submit button to record your score. https://storage.googleapis.com/codevolve-assets/cengage/cengage-java-programming-9e/Figure_1-25.png
Main program file: public class BankAccountMainProgram{ public static void main(String[] arguments) { // create three bank accounts BankAccount accountNum1 = new BankAccount(); BankAccount accountNum2 = new BankAccount(1233203, 105.51, "Betty"); BankAccount accountNum3 = new BankAccount(6542345, 33.11, "Veronica"); // Test the two String Method System.out.println("*** Does the toStringMethod work?"); System.out.println("First account : " + accountNum1); System.out.println("Second account : " + accountNum2); System.out.println("Third account : " + accountNum3); System.out.println(); // Do the get() method work? System.out.println("*** Does the get() methods work?"); System.out.println(accountNum2.getName() + " has $" + accountNum2.getBalance() + " in account number " + accountNum2.getID() + "."); System.out.println(); // Can we change the account name System.out.println("*** Does the set() methods work?");…
#include<iostream>#include<math.h>using namespace std;class TotalResistance{double series_res,parallel_res,sp_res;public:TotalResistance(){series_res=parallel_res=sp_res=0;}void seriesResistance(double resistance[],int n);void parallelResistance(double resistance[],int n);void spResistance(double resistance[],int n);};void TotalResistance::seriesResistance(double resistance[],int n){for(int i=0;i<n;i++)series_res += resistance[i];cout<<"Total Resistance in series is: "<<series_res<<endl;}void TotalResistance::parallelResistance(double resistance[],int n){double temp=0;for(int i=0;i<n;i++)temp += (1/resistance[i]);parallel_res = 1/temp;cout<<"Total Resistance in parallel is: "<<parallel_res<<endl;}void TotalResistance::spResistance(double resistance[],int n){for(int i=0;i<n;i++)series_res += resistance[i];double temp=0;for(int i=0;i<n;i++)temp += (1/resistance[i]);parallel_res = 1/temp;cout<<"Total Resistance in series…
12.14 Zylab 3 - Single Procedure Call Given an array of at least one integer, write a program to create a new array with elements equal to the power of each element in the original array raised to the index, i.e., P[i] = A[i]^i. For this, write two functions that will be called in main function independently. ● power inputs: element (A[i]) and index (1) • task: returns the value of element raised to index (A[i]^i). } O • newElement inputs: base address of new array P (*P), current size of P (variable k) and the new element (A[i]^i) o task: add the new element at the end. o This function does not return any value (void). O Following is a sample C code to perform the required task. You may modify the code for the functions, but the task performed should not be changed. int main() { // Variable Declaration int *A, *P; int n, k; int pow; // Task of main function P[0] 1; for (int j = k = j; pow // Base addresses of A and P // Lengths of arrays A and B // Return value from power function }…
Load the picture named fname into memory and print its width, height, and bytes-per-pixel. graphics.cpp 1 #define ... 2 #define 3 #include 4 #include 5 #include 6 #include 7 using namespace std; 8 9 int main() 10 { 11 12 string fname = "pete.png"; int width, height, bpp, channels = 4; unsigned char * const if (...) 13 14 15 16 17 18 cout « "Cannot load " <« fname <« endl; else { cout « fname <« " was loaded in memory" <« endl; cout « "width: " « endl; cout « "height: cout « "byte-per-pixel: } 19 20 21 « endl; " « endl; 22 23 }
SumDouble.java [1 13 14 14 27 28 * Logic problem for CS 170. @author * @version */ public class SumDouble /** * Complete the function sumDouble(). * Given two int values, return their sum. * Unless the two values are the same; * then return double their sum. * Some examples sumDouble (1, 2) returns 3 sumDouble (3, 2) returns 5 sumDouble (2, 2) returns 8 @param a is the first int value. * @param b is the second int value. * @return their sum or double their sum if equal. */ public int sumDouble(int a, int b) { // Complete the sumDouble method here.
main.cpp 1 @include 2 using namespace std; int maxResult() 4-( int maxVal = 0; 6. for (int i = 0; i <= n; i += a) { for (int j = e; j <= n i;j += b) !! 10 (float)(n - (i + j)) / (float)(c); 11 float z = 12 if (floor (z) { int x = i / a; int y 13 ceil(z)) 14 15 16 j/ b; max (maxVal, x + y + (int)z); 17 maxVal = 18 19 20 21 22 return maxVal; 23 } 24 int main() 26 { 25 27 28 cout << maxResult( ); 29 30 return 0; 31 } Input Compilation failed due to following erors) main.cpp:7:23: error: 'n was not declared in this scope 7 for (int i = 0; i <= n; i t a) main.cpp:7:31: error: 'a' was not declared in this scope 7 for (int i 0; i <= n; i t a) main.cpp:9:36: error: 'b' was not declared in this scope for (int j = 0; j <- n i; j b) %3D main.cpp:11:45: error: was not declared in this scope
void fact(int num) { int k,f=1; for (k=1;k<=num; k++) f=f*k; cout<< f; int main() { int arri[3]={3,2,1} ; for(int i=0;i<3;i++) fact(arri[i]); } 261 O 621 O 7 462
Find logic errors: #include <Adafruit_NeoPixel.h>#include <string.h> #define NEOS 8#define NPX 10#define AVGS 100 int runsamps[AVGS];double curavg;int count; Adafruit_NeoPixel pixels(NPX, NEOS, NEO_GRB+NEO_KHZ800); void setup() {// put your setup code here, to run once:pixels.begin();memset(runsamps, 0, AVGS*sizeof(int));count = 0;curavg = 50;} void loop() {// put your main code here, to run repeatedly:int newdata;int scaleavg;pixels.clear();newdata = analogRead(8);curavg += (double)runsamps[count]/AVGS;runsamps[count] = newdata;curavg -= (double)newdata/AVGS;scaleavg = round(map(curavg, 0, 1023, 0, 10));for (int n = 0; n < scaleavg; n++){pixels.setPixelColor(n, pixels.Color(82, 35, 152));pixels.show();}delay(10);count++;}
C. Using the starter code please modify in Java public class L08 { public static void main(String[] args) { // TO DO: // Test your radix sort implementation here } // TO DO: // Implement // NOTE: You can assume that all strings in the array have the same length public static void radixSort(String[] array) { } //////* HELPER METHODS *////// private static String[] generateStringArray(int wordLen, int arrLen) { String[] array = new String[arrLen]; for(int i = 0; i < arrLen; i++) { StringBuilder sb = new StringBuilder(); for(int j = 0; j < wordLen; j++) { sb.append((char)('a' + Math.random() * ('z' - 'a' + 1))); } array[i] = sb.toString(); } return array; } private static void displayStringArray (String[] array) { for(String s : array) { System.out.println(s); } } private static boolean isSortedInNondescendingOrder(String[] array) { for(int i = 1; i < array.length; i++) { if (array[i].compareTo(array[i-1]) < 0) { return false; } } return true; } } Implement radix sort for…
3 6. 9 12 15 ListB 1 2 3 Based on above memory illustrations. Complete these following fragment code: (i), (ii), (iii) Hint : Array ListB is the manipulation of array ListA. int ListA[5] = // (i) initialization of array ListA int ListB[5]; for( int i = 0; i++){ //(ii) control expression for maximum index ListB[i] = ;//(ii) manipulate elements ListA to save in ListB cost }