Algorithm Exercises on Conditional Structures
Uploaded by
Leila Cristina AlmeidaAlgorithm Exercises on Conditional Structures
Uploaded by
Leila Cristina AlmeidaCommon questions
Powered by AIStart by computing the total parking duration in whole hours, rounding up partial hours. The first two hours charge R$1.00 each, the next two hours R$1.40 each, and subsequent hours R$2.00 each. This tiered billing algorithm ensures charges align with defined temporal rules, accommodating any duration up to 24 hours .
The Body Mass Index (BMI) is calculated using the formula: BMI = weight (kg) / (height (m))^2. Once calculated, categorize the BMI as follows: Below 18.5 as Underweight, Between 18.5 and 25 as Normal weight, Between 25 and 30 as Overweight, and Over 30 as Obese. This classification helps in assessing an adult's body weight status .
For a quadratic equation ax^2 + bx + c = 0, where a ≠ 0, calculate the discriminant Δ = b^2 - 4ac. If Δ < 0, no real roots exist; if Δ = 0, one real root exists and should be output as "Single root." If Δ > 0, calculate the two real roots using the quadratic formula and print them. This method assesses the equation's structure to determine root characteristics .
The algorithm should use a greedy approach where it first determines the total change required. Then, it calculates the maximum number of the largest denomination notes (e.g., R$100), followed by R$50, R$10, R$5, and finally R$1 until the total is achieved. Subtract the equivalent of the notes used from the total change iteratively until none remains .
An algorithm should calculate 20% of the provided salary, and compare this value to the loan payment amount. If the loan payment exceeds 20% of the salary, the output should be "Loan not granted." Otherwise, the output should be "Loan granted." This comparison ensures that the loan is aligned with financial guidelines for affordability .
An algorithm to determine if an integer is divisible by 3 or 5, but not both, should use conditional statements to evaluate the integer. First, check if the integer is divisible by 3 and not by 5 by verifying if the modulo operation 'number % 3 == 0' and 'number % 5 != 0'. Second, check if the integer is divisible by 5 and not by 3 with 'number % 5 == 0' and 'number % 3 != 0'. The algorithm logically combines these checks using the OR operator to satisfy the condition .
To validate a date, ensure the month is between 1 and 12. Assess day constraints by month, with February having 29 days in leap years and 28 in others. Use a formula to check if the year is a leap year: it must be divisible by 4, except centuries (divisible by 100) unless divisible by 400. This ensures date components align with calendrical rules .
To sort three numbers, compare each pair and rearrange the numbers in descending order. Use conditional checks to swap values as necessary, ensuring the largest value is first, followed by the next largest, until the smallest. This comparative strategy efficiently orders the numbers as required .
When calculating a teacher's salary, the program should first determine the teacher's level (1, 2, or 3) corresponding to hourly payment rates of R$12.00, R$17.00, or R$25.00, respectively. Multiply the hourly rate by the number of hours taught to determine the salary. This requires defining a table or a conditional structure to match the teacher's level to their hourly rate .
To verify if side lengths can form a triangle, the sum of any two sides must be greater than the third side. Once verified, classify the triangle as follows: Equilateral if all three sides are equal, Isosceles if exactly two sides are equal, and Scalene if all sides are different .