Currently, AOU has 3 British programs: BA, EL and ITC. Assume that students will be admitted to a specific program according to their percentage in the high school as follows: - "ITC" if percentage 2 90 - "EL" if 80 s percentage < 90 - "BA" if 60 s percentage < 80 - If percentage < 60, the student will not be admitted to any program Write an algorithm that prompts the user to enter a real number represents the percentage of a student in the high school and prints on the screen a message explains to which program he/she will be admitted. At the end, you should print "Thank you" message. Your program should follow (exactly) the format of the following sample: Sample Input: Enter your percentage in the high school: 91.3 Enter your percentage in the high school: 55.7 Sample Input: Sample Output: You will be admitted to ITC program Thank you Sample Output: You will not be admitted to any program Thank you

Currently, AOU has 3 British programs: BA, EL and ITC. Assume that students will be admitted to a specific program according to their percentage in the high school as follows: - "ITC" if percentage 2 90 - "EL" if 80 s percentage < 90 - "BA" if 60 s percentage < 80 - If percentage < 60, the student will not be admitted to any program Write an algorithm that prompts the user to enter a real number represents the percentage of a student in the high school and prints on the screen a message explains to which program he/she will be admitted. At the end, you should print "Thank you" message. Your program should follow (exactly) the format of the following sample: Sample Input: Enter your percentage in the high school: 91.3 Enter your percentage in the high school: 55.7 Sample Input: Sample Output: You will be admitted to ITC program Thank you Sample Output: You will not be admitted to any program Thank you

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

A problem is NP-Complete. Any algorithm to solve this problem is likely to run in time. O (n) O (n lg n) ㅇ(2") o (n3 O (lg n)
Asap
What happens if the least remainders algorithm is applied to a pair of consecutive Fibonacci numbers?
Algorithm
Please solve it using substitution method.
2
Find the complexity of the following blocks of code or algorithm’s description. your answer must show the steps that lead to your final answer
Code in python please
Do 2-iterations of the Secant method for finding a root of the equation f(x)=cos(x)-x*e^x=O start with the interval [1,2]. The root is ... * O 0.85778 O 0.8320 None of them 0.83853 O 0.855555