Computers and Technology

​The activity is meant to test your understanding on how to implement decision making in
your programs using the if-else, if-else-if ladder and the switch statement.
If you do not have Java installed on your laptop, you can use an internet based/online Java
compiler to do your work. Once done, copy the source code, paste it into MS word
document which you then upload to the system. You can also save and upload screen shots
with your code. You should only email your work if you are really not able to upload it to the
system. You have enough time to complete the activity hence late work will not be
marked and excuses will not be accepted.
Create one program that will do the following:
a) Receive input of three decimal numbers from the user (use scanner class for input),
compare them and display which one is the greatest number and which one is the
smallest number.
E. g.
Input:
45, 30, 90
Output:
90 is the greatest number
30 is the smallest number (10 marks)
b) Receive an integer number between 1 and 12 (use scanner class for input), compare
it with a list of cases given representing the 12 months of the year, then display
which month of the year it is depending on the number entered by the user.
E. g. Case 1: January
Case 2: February
Case 3: March
Case 4: April …………
If the user enters 3, the system will display that the month is March

answer
Answers: 2

Other questions on the subject: Computers and Technology

image
Computers and Technology, 21.06.2019 18:00, kimmosley80
Which if the following allows you to view and access important information about your documents all in one location
Answers: 3
image
Computers and Technology, 22.06.2019 23:30, lexirandall19
Define a function printfeetinchshort, with int parameters numfeet and numinches, that prints using ' and " shorthand. ex: printfeetinchshort(5, 8) prints: 5' 8"
Answers: 1
image
Computers and Technology, 23.06.2019 10:20, chonawilson4
Suppose there is a relation r(a, b, c) with a b+-tree index with search keys (a, b).1. what is the worst-case cost of finding records satisfying 10 < a < 50 using this index, in terms of the number of records n1, retrieved and the height h of the tree? 2. what is the worst-case cost of finding records satisfying 10 < a < 50 and 5 < b < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above? 3. under what conditions on n1 and n2, would the index be an efficient way of finding records satisfying the condition from part (2)?
Answers: 1
image
Computers and Technology, 23.06.2019 16:00, AM28
Does read theory have answers keys ?
Answers: 1
Do you know the correct answer?
​The activity is meant to test your understanding on how to implement decision making in
your...

Questions in other subjects:

Konu
Mathematics, 27.01.2021 20:00
Konu
Mathematics, 27.01.2021 20:00