0
What else can I help you with?
What is the algorithm and draw flow chart to find the sum and average of 3 numbers?
Algorithm to find the sum and average of 3 numbers: Start. Input three numbers (let's call them A, B, and C). Calculate the sum (Sum = A + B + C). Calculate the average (Average = Sum / 3). Output the sum and average. End. Flowchart: [Start] ↓ [Input A, B, C] ↓ [Sum = A + B + C] ↓ [Average = Sum / 3] ↓ [Output Sum, Average] ↓ [End]
How do you find common dinomanater in fractions?
Using the Euclidean algorithm
How do you draw an algorithm to find the simple interest?
The answer depends on what information you do have.
What is how much mean in math terms?
Mean is the average. To find the average, add up the group of numbers and divide by how many numbers there were.
Write a algorithm to find sum of n integers?
Yes, please do.
What is the runtime complexity of the Union Find algorithm?
The runtime complexity of the Union Find algorithm is O(log n) on average.
Why should the encryption algorithm be made public?
To help people find the weakness of the algorithm
Write an algorithm to find the root of quadratic equation?
Write an algorithm to find the root of quadratic equation
How do you find the average in a problem?
The average of a group of numbers is(the sum of all the numbers in the group)/(how many numbers there are in the group)
An algorithm to find whether a directed graph is connected or not?
You can use a The Depth-First Search algorithm.
Write algorithm and draw a flow chart to find the total and average of a student for six subjects?
write an algorithm to compute the weekly average rainfall given the daily rainfall for four weeks
When you choose iterative or recursive algorithm?
If you cannot find any iterative algorithm for the problem, you have to settle for a recursive one.
Using the Euclid's algorithm find the multiplicative inverse of 1234 mod4321?
Using the extended Euclidean algorithm, find the multiplicative inverse of a) 1234 mod 4321
Is the Ford-Fulkerson algorithm guaranteed to find the maximum flow in polynomial time?
No, the Ford-Fulkerson algorithm is not guaranteed to find the maximum flow in polynomial time.
When does Dijkstra's algorithm fail to find the shortest path in a graph?
Dijkstra's algorithm fails to find the shortest path in a graph when the graph has negative edge weights.
How would you find the average height of a group of people?
The most common type of average is the mean, which is found by adding up allof the numbers in a group, then count how many numbers you had, and divide by that count.say you had 4 people and their heights were 10cm, 12cm,11cm and 8cm. to find the adverage height of them you just add the heights together so 10+12+8+11=41then you divide your answer by the no. of people. so my answer would be 10.25
What is the average age of a group of 10 individuals?
To find the average age of a group of 10 individuals, you would add up all their ages and then divide by 10.
