Match each item with a statement below.
A. Command option used to remove a specified member from the group account.
B. Command option used to specify the user's default login shell.
C. Command option used to allow assignment of a duplicate GID.
D. Command option used to change the user's login name.
E. Command option used to force the GID to what's entered at the command line.
F. Command option used to unlock specific user accounts.
G. Command option used to add a home directory for a new user.
H. Command option used to display all password expiration information for the specified user account.
I. Command option used to change the number of days the password is valid for the specified user account.
A. groupmod -R
B. useradd -s
C. groupadd -o
D. usermod -l _name_
E. groupadd -g
F. usermod -U
G. useradd -m
H. chage -l
I. chage -m
You might also like to view...
An app that performs synchronous tasks on a single-core computer often takes longer to execute than on a multi-core computer, because ________.
a) it’s too costly to convert them to asynchronous tasks b) the processor is shared between the app and all the others that happen to be executing on the computer at the same time c) multi-core computers have no overhead d) single-core compters generally have slower processors
A classmate of yours has coded the following version of selectionSort().Will it work? Explain.
``` /** * Sort the array elements in ascending order * using selection sort. * @param a the array of Objects to sort * @throws NullPointerException if a is null */ static void selectionSort( Object[] a ) { if ( a == null ) throw new NullPointerException(); // while the size of the unsorted part is > 1 for ( int unsortedSize = a.length; unsortedSize > 1; unsortedSize-- ) { // find the position of the largest // element in the unsorted section int maxPos = 0; for ( int pos = 1; pos < unsortedSize; pos++ ) if ( a[pos] > a[maxPos] ) maxPos = pos; // postcondition: maxPos is the position // of the largest element in the unsorted // part of the array // Swap largest value with the last value // in the unsorted part Object temp = a[unsortedSize – 1]; a[unsortedSize – 1] = a[maxPos]; a[maxPos] = temp; } } ```