All categories

3 years ago

The Active Directory Users and Computers tool can be used to:______.

Computers and Technology

1 answer:

Kay [80]3 years ago

8 0

Answer:

add users, reset passwords, enable dial-In access, and manage computersin the domain.

Explanation:

Active Directory Users and Computers is an administrative tool, that is used to perform or carry out various tasks relating to administration processes. It can be utilized in the administration of an organization memberships and company server.

Hence, the Active Directory Users and Computers tool can be used to add users, reset passwords, enable dial-In access, and manage computers in the domain.

You might be interested in

The picture that graphically represents the items you use in windows is called a/an

rodikova [14]

The picture that graphically represents the times you use in windows is called an icon ( this is true for windows 7, assuming that was what you were referring to. I am not familiar with windows 8)

3 0

3 years ago

Use the syntax SELECT ________ (expression) [Column Name] to limit the result set to the number of rows defined by the expressio

KIM [24]

Answer:

Use the syntax SELECT _LIMIT_ (expression) [Column Name] to limit the result set to the number of rows defined by the expression.

Explanation:

The LIMIT keyword is often used to limit the number of rows returned in a result. Usually, the Limit expression is combined with the "SELECT column_name(s) FROM table_name...WHERE condition" can be used to limit the result set to the number of rows defined by the expression, LIMIT. The WHERE condition is optional, meaning it can be omitted.

4 0

3 years ago

How each programming language differs in terms of constructs, techniques, use and requirements?

Anuta_ua [19.1K]

Programming languages are (designed to be) easily used by machines, but not people.

Natural languages (like English) are easily used by humans, but not machines.

Programming languages are unambiguous, while natural languages are often multiply ambiguous and require interpretation in context to be fully understood (also why it’s so hard to get machines to understand them). Natural languages are also creative and allow poetry, metaphor and other interpretations. Programming does allow some variation in style, but the meaning is not flexible.

Lojban (Wikipedia) is an artificial language designed to try to bridge the gap between these two types of languages. It is specifically unambiguous yet something that a human can pronounce and even speak meaningfully. It can be considered a somewhat successful experiment yet limited in functionality in some ways in both domains (and not a real substitute for a normal programming language, but perhaps useful as an interface).

Natural languages consist of sentences, usually declarative sentences expressing information in a sequence. Programming languages typically are not declarative but procedural, giving instructions to the machine to do something (like commands in natural languages). Rarely, programming languages are declarative, such as Prolog, where statements are given to the computer, then the evaluation consists of finding possible solutions that match those statements (generate a list of words based on possible combinations of letters as defined just by letter-combining rules, for example).

The vocabulary of natural languages is filled with conceptual terms. The vocabulary of programming languages is generally only ‘grammatical’/functional ‘words’ like basic comments, plus various custom-named things like variables and functions. There are no words like you’d look up in a dictionary to express something like ‘love’ or ‘happy’ or ‘sing’.

The grammatical structures vary in more ways than are easy to list here. But some of the most obvious factors are that words don’t have separable parts in programming languages (like English cat-s to form a plural) [=no morphology], and that via brackets, line breaks or other markers, embedding tends to be overtly and clearly marked on both sides for the parser in programming languages, whereas spoken languages usually only have one word (like “that”) linking embedded sentences, and sometimes no word at all. This is another reason that parsing human languages is so hard on a computer.

You could also look at Hockett’s design features and see which apply to programming languages: What is the difference between human and animal language?

In a very general sense, programming languages aren’t used for bidirectional communication and may not properly be considered “languages” in the same sense as natural languages. Just looking at Hockett’s features, they’re completely distinct in being written only, do not involve interchangeability between the speaker and hearer, do not have ‘duality of patterning’ meaning multiple layers of structure as sounds vs. phrases (phonology vs. syntax), and are not transmitted culturally (well, maybe). It’s just very hard to even try to make the comparison.

Most fundamentally, it is worth asking if programming languages even have meaning, or if they are just instructions. This is similar to the Chinese room thought experiment— given a book of instructions for how to translate Chinese, but without actually understanding it, would a human (or computer) with that book be considered to “know” Chinese? Probably not. A computer doesn’t “know” anything, it just does what the instructions tell it to. Therefore, programming languages have no semantics/meaning. They just are instructions, which translate into electronic signals, nothing more.

6 0

2 years ago

ASSIGNMENT FORM 2 1. Evaluate the following without using mathematical tables 0.36 x 6(142 +58) 21.44 - 10.64

liq [111]

9251.44 or 231286/25 or 9251(11/25)

0.36*6*200*21.44-10.64
becomes
9262.08-10.64
gives you the result

8 0

2 years ago

Weak Induction

slega [8]

Answer:

Following are the answer to this question:

Explanation:

In option 1:

The value of n is= 7, which is (base case)

$\to 3^7$

when n=k for the true condition:

$\to 3^k$

when n=k+1 it tests the value:

$\to 3^{(k+1)}= 3^k,3\\\to < (k!) 3 \ substituting \ equation \\\to$

since k>6 hence the value is KH>3 hence proved.

In option 2:

when:

for n=1:(base case)

$\log(1!)$

0<=0 \\ condition is true

when the above statement holds value n=1

when n=k

$\log(k!)$

when n=k+1

$\log(k+1)!=\log(k!)+\log(k+1)\\$

$\because k \log k$ $[\therefore KH>K \Rightarrow \log(KH>\loK)]$

In option 3:

when n=1:

$A_1 \cup B=A_1 \cup B\\\\$

when n=k

$\to (A_1\cap A_2 \cap.....A_k) \cup B\\=(A_1\cup B) \cap(A_2\cup B_2)....(A_k \capB).....(a)\\\to n= k+1\\ \to (A_1\cap A_2 \cap.....A_{kH}) \cup B= (A_1\cup B)\\\\\to [(A_1\cap A_2 \cap.....A_{k}) \cup B]\cap (A_{KH}\cup B)\\\\\to [(A_1\cup B) \cap (A_2 \cup B) \cap (A_3\cup B).....(A_k\cup B)\cap (A_{k+1} \cup B)\\\\ \ \ \ \ \ \ substituting \ equation \ a \\\\$

hence n=k+1 is true.

7 0

3 years ago