Complete code with compilation. Q3) 1293)) Q223) sillollowingcircle, siperele circrae etc using sw#include void main(){int fig_code;float side, base, length, breadth, height, area, radius;printf("--\n");printf(" 1-> Circle\n");printf(" 2 --> Rectangle\n");printf(" 3-> Triangle\n");printf(" 4-> Square\n");printf("--\n");printf("Enter the Figure code\n");"-", &);scanf(".switch(............){ case ........: printf("Enter the radius\n");..("%...........", &radius);.............. 3.142 radius radius;printf("Area of a circle = %.........\n",.%----); break;case: printf("Enter the breadth and length\n");scanf(".&breadth, &length);am= breadth * length;("Area of a Reactangle = %f\n", area); break;case: printf("Enter the base and height\n");(".", &base, &......-);area=0.5 base height;printf("Area of a Triangle = %f\n",-----; break;case.............: printf("Enter the side\n");..);**********("%f", &area = side * side;printf("Area of a Square=\n",break;break; }: printf(".e areas of different geometrical shapes suc

Answered: e code with compilation.

Engineering

Computer Science

e code with compilation.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section: Chapter Questions

Problem 4PP: (Numerical) Write and test a function that returns the position of the largest and smallest values...

See similar textbooks

Similar questions

Find errors / syntax error. Write line number
None
C language programming .
C++ help please my function: bool palindrome(const int a[], int start, int end){ bool flag = true; for (int i = start; i <= end / 2 && a[i]!= 0; i++) { if (a[i] != a[end - i - 1]) { flag = false; cout << "Array Is Not Palindrome\n"; return false; } } if (flag == true) cout << "Palindrome"; return true;} the main: int a[]= {1,2,1,2,1};cout << "Array = [1,2,1,2,1}\n";cout << "Testing array palindrome using 3 parameters:\n";palindrome(a, 2, 3); please help my function is not doing what it is supposed to :( it returns true when its not supposed to
C Program - Array Positive and Negative Rotations Make a program that creates two arrays by asking the size n of the arrays (the two arrays have the same size) and their corresponding n integer inputs. Example: Input size of the arrays: 5 Array 1 elements: 1 2 3 4 5 Array 2 elements: 3 4 5 1 2 You are tasked to determine the minimum # of positive and negative rotations of Array 2 to become Array 1. A positive rotation is a rotation to the right while a negative rotation is a rotation to the left. Given the example elements of Array 1 and Array 2 above, here's a sample computation: Right Rotations 3 4 5 1 2 -> 2 3 4 5 1 -> 1 2 3 4 5 = 2 rotations Left Rotations 3 4 5 1 2 -> 4 5 1 2 3 -> 5 1 2 3 4 -> 1 2 3 4 5 = -3 rotations Output the number with the highest absolute value (but still display the negative sign, if the selected value is the value of the left rotations which is negative). If the two values are equal, output the negative value and if it's impossible…
java programming three questions 1) while statement that prints out (39, 36, 33, 30,27, 24, 21, 18,15,12, 9, 6 2) method called percentEven that accepts 2 dimensional arrays of interger example if array store [6,2,9,11,3] should return 40.0 3) public static void if EkseMystery (int a, int b) if(a*2<b){ a=a*3; } else if (a>b){ b=b+3 } if (b<a){ b++; }else{ a--: system.out.println(a+"\\" +b); i need the out put
C Programming Language (Code With C Programming Language) Problem Title : Visible Trees There is a legend about a magical park with N × N trees. The trees are positioned in a square grid with N rows (numbered from 1 to N from north to south) and N columns (numbered from 1 to N from west to east). The height (in metres) of each tree is an integer between 1 and N × N, inclusive. Magically, the height of all trees is unique. Bunga is standing on the northmost point of the park and wants to count the number of visible trees for each Column. Similarly, Lestari is standing on the westmost point of the park and wants to count the number of visible trees for each Row. A tree X is visible if all other trees in front of the tree X are shorter than the tree X. For example, let N = 3 and the height (in metres) of the trees are as follows6 1 87 5 32 9 4 On the first column, Bunga can see two trees, as the tree on the third row is obstructed by the other trees. On the second column, Bunga can see…
C programming: I want to turn this code without the use of arrays... void myFunction(int myNumbers[5]) { for (int i = 0; i < 5; i++) { printf("%d\n", myNumbers[i]); }}int main() { int myNumbers[5] = {10, 20, 30, 40, 50}; myFunction(myNumbers); return 0;}
Task - Using pointers to process arrays (C Language) Example #5 below expected output is 45, but from the program below its coming out to 46. Please help make it come out to 45 as expected In a TV show, each minute can be either interesting or boring. Assume that if 7 consecutive minutes are boring, then an average viewer will stop watching the show. Write a C program that calculates how many minutes that an average viewer will watch a TV show, given the interesting minutes. Assume the TV shows are 45 minutes long. Requirements Name your program project4_minutes.c. Follow the format of the examples below. The program will read in the number of interesting minutes, then read in the interesting minutes. The program should include the following function. Do not modify the function prototype. int find_minute(int *minutes, int n); minutes represents the input array for interesting minutes, n is the length of the array (the number of interesting minutes). The function returns the how…
please solve it, C++
C programming language question
(-465)10 + (325)10 = ?