A(n) ____________________ lists jobs and when they are to be run by the cron daemon.

Fill in the blank(s) with the appropriate word(s).


crontab file

Computer Science & Information Technology

You might also like to view...

Which of the following statements is false?

a) Prior to C# 6, you could use a fully braced collection initializer to initialize a Dictionary’s key–value pairs. For example, if you had a Dictionary named toolInventory, you could create and initialize it as follows: ``` var toolInventory = new Dictionary{ {"Hammer", 13}, {"Saw", 17}, {"Screwdriver", 7} }; ``` b) The code in a) is shorthand for creating the Dictionary then using its Add method to add each key–value pair. c) C# 6’s index initializers enable you to clearly indicate the key and the value in each key–value pair as follows: ``` var toolInventory = new Dictionary{ ["Hammer"] = 13, ["Saw"] = 17, ["Screwdriver"] = 7 }; ``` d) Prior to C# 6, any collection that defined an Add extension method could be initialized with a collection initializer. As of C# 6, the compiler also supports collection initializers for any collection that has an Add instance method.

Computer Science & Information Technology

What is a red black tree?

a. It is a self-balancing binary search tree with an additional space in each node for the node color b. A tree that requires itself to be balanced every time a node is added c. A tree that requires itself to be balanced every time a node is removed d. None of the above

Computer Science & Information Technology

The binary search algorithm in the text makes recursive calls on subarrays of the array passed to the algorithm. The range passed to the search function is first to last. The search algorithm makes recursive calls on the left or right subarray that target will be in, if the target is present. What are the left and right ends of the right subarray?

a) Last , mid – 1 b) last , mid + 1 c) mid – 1, last d) mid + 1, last e) last, mid

Computer Science & Information Technology

What is the number of iterations in the following loop?

``` for (int i = 1; i < n; i++) { // iteration } ``` a. 2*n b. n c. n - 1 d. n + 1

Computer Science & Information Technology