Search & Filtering
Recreate the pokemon table using All rows at once on the documentation:
All rows at once
When you have a list of rows, you can add them in one go with add-row:
x.field_names = [ "City name", "Area", "Population", "Annual Rainfall"]
x.add_row(
[
["Adelaide", 1295, 1158259, 600.5],
["Brisbane'', 5905, 1857594, 1146, 4],
[ "Darwin", 112, 120900, 1714, 7],
["Hobart", 135, 20556, 619.5],
["Sydney", 2058, 4336374, 1214.8],
["Melbourne", 1566, 3806092, 646.9],
["Penth", 5386, 1554769, 869.4],
]
)
Have the user input 5 numbers and outputs witch numbers are prime
Use the functions char toUpper(char) to check if a char is a lowercase alphabetic value. If it is, return the uppercase equivalent. If it isn’t, return the original char.
Assignment: Functions
void printBanner() – This function should open the file “banner.txt” in the same directory as the program, and print it’s contents to the terminal. It does not depend on any other functions.
Consider a system with 13 dedicated devices of the same type and all jobs currently running on this system require a maximum of three devices to complete their execution but they each run for long periods of time with just two devices and request the remaining one only at the very end of the run. Assume that the job stream is endless and that your operating system’s device allocation policy is a very conservative one: No job will be started unless all the required drives have been allocated to it for the entire duration of its run. Explain what are the minimum and maximum numbers of devices that may be idle as a result of this policy.
#339914 on Dec 2023