Put these functions in order so that if f(n) = O(g(n)) (i. e. f(n) is Big-Oh of g(n)), then f(n)appears before g(n)in the list. Group together functions that have the same asymptotic order of growth (i. e. f(n)= Θ(g(n))).

n², nlog n, n³ + log n, √n, n² +2n log n, log log n, 17 log n, 10n³/², n⁵ - n⁴ + 2n,
5 n² log log n, 3n² + n³ log n, n +6 logn

Selective incapacitation is a strategy to reduce prison population

Answer the following questions regarding your system by using the commands listed in this chapter. for each question, write the command you used to obtain the answer. a. what are the total number of inodes in the root filesystem? how many are currently utilized? how many are available for use? b. what filesystems are currently mounted on your system? c. what filesystems are available to be mounted on your system? d. what filesystems will be automatically mounted at boot time?

Acomputer has a two-level cache. suppose that 60% of the memory references hit on the first level cache, 35% hit on the second level, and 5% miss. the access times are 5 nsec, 15 nsec, and 60 nsec, respectively, where the times for the level 2 cache and memory start counting at the moment it is known that they are needed (e.g., a level 2 cache access does not even start until the level 1 cache miss occurs). what is the average access time?