write a program to calculate the radius for a quadratic
equation use modular programming(function abitraction)hint
use quadratic function
Answer / sureshzzz
#include <stdio.h>
#include <math.h>
int main(){
float r,h;
float volume;
printf( "Enter size
of radius and height of
a cylinder : " );
scanf( "%f
%f" ,&r,&h);
volume = M_PI * r
* r * h;
printf( "\nVolume of
cylinder is :
%.3f" ,volume);
return 0;
}
| Is This Answer Correct ? | 0 Yes | 0 No |
Teta-Omeg-Big-Oh Show that f(n) = n2 + 3n3 is ;(n3).
write a program that calculate the volume of cylinder after user enters radius and height and show the algorithm used
1 Answers Jomo Kenyatta University,
Min-Max Write an algorithm that finds both the smallest and largest numbers in a list of n numbers and calculate its complexity T(n).
1 Answers Infosys, Qatar University,
what is the diffrence between ++x , x++ pleaaaaase ???
. Remove all the blank spaces between character.Matrix is of 10* 10. eg: INPUT ------------------------------------ | N | A | | V | |T ------------------------------------- | |G | U | |P | -------------------------------------- |T | | | A | | ------------------------------------ OUTPUT: ------------------------------------ | N | A | V | T | | ------------------------------------- |G |U | P | | | -------------------------------------- |T | A | | | | ------------------------------------
Write a program using two-dimensional arrays that determines the highest and lowest of the 12 input values. Example: Enter 12 numbers: 13 15 20 13 35 40 16 18 20 18 20 14 highest: 40 lowest: 13
Algorithm in O(2n) Presently we can solve in our hypothetical machine problem instances of size 100 in 1 minute using algorithm A, which is a O(2n). We would like to solve instances of size 200 in 1 minute using algorithm A on a new machine. What is the speed of the new machine should be?
2 Answers ABC, Qatar University,
Write a simple encryption program using string function which apply the substitution method.
program to find the magic square using array
How to swap two ASCII numbers?
Find the maximum product of three numbers in an array? Eg. 9,5,1,2,3 Max product= 9*5*3= 135 The array can hav negative numbers also..
Write a program that takes a 3 digit number n and finds out whether the number 2^n + 1 is prime, or if it is not prime find out its factors.