The listing of a directory shows certain files with permissions set to rwsr-xr-x. what does this indicate?

1 answer:

5 0

<span>"rws" means that the user has permissions to read, write and setuid. "r" means the user can read the file and "w" means that the user can write to the file. "s" stands for "setuid" (set user id) is a permission bit that allows the users to execute a program with the permissions of its owner. The "s" can also mean "setgid" (set group id) is a bit that allows the user to execute a program with the permissions of the group owner.</span>

You might be interested in

What are the steps for inserting an internal link?

julia-pushkina [17]

Answer:

Worksheet

Ctrl + Enter

Explanation:

4 0

2 years ago

Read 2 more answers

((Excel)) please help, 100 points, and brain crown thingy, not only that, i will make several of these so you can get several hu

cupoosta [38]

Answer:

First you read the question and numbers, then you use the numbers in the correct way and you try reallllyyy hard, you will find your answer! Hope this helps! :D

4 0

2 years ago

A series of drawn pictures (like a comic) of key visual shots of planned production for video is a/an

Ne4ueva [31]

Answer:

The correct answer is <u>D) Storyboard</u>

Explanation:

A storyboard is used during the initial planning stage of filmmaking. You draw pictures to demonstrate the general idea of what shots you want to get before actually going out and filming on a set/studio.

4 0

2 years ago

Let's consider a long, quiet country road with houses scattered very sparsely along it. (We can picture the road as a long line

Rus_ich [418]

Answer:

Follows are the solution to these question:

Explanation:

A simple gullible algorithm is present. Let h mark the house to the left. Then we put a base station about 4 kilometers to the right. Now delete and repeat all the houses protected by this base station. In this algorithm, they can simply be seen to position baselines at b1, . . , bk as well as other algorithms (which may be an optimum algorithm) at $b'_{1}, \ . . . . . . ,b'_{k'}$ and so on. (from left to right) $b_1 \geq b'_{1},\ \ b_2 \geq b'_{2}$ That's why $k \leq k'$ .