To delete only the selected contents of the table, but not the table itself, ____.

1 answer:

Volgvan3 years ago

6 0

To delete only the selected contents of the table, but not the table itself, you need to click on this cell in the table.

You might be interested in

The actual database of Active Directory shared resources is stored on one or more computers designated as:

RideAnS [48]

Answer:

2. domain controllers.

Explanation:

A domain is defined as a collection of users, computers, database servers, etc that are grouped together for some common purpose.
The database of these shared groups and resources is stored on one or more computers known as domain controllers.
It is a server that manages these groups that work together on the same network.
It is also responsible for administrating security and managing permissions in order to control access to the resources which are shared between multiple computers and users in one or more domains.
These permissions involve user authentication and authorization. Domain controllers is used to acknowledge authentication requests of users by verifying their username and password.
Domain controllers simplify security management in larger networks.
However domain controller serves need more hardware and resources for the purpose of securing shared information.

5 0

3 years ago

Help me with this please, it is for tech

Sonbull [250]

I believe it’s dsl.

5 0

4 years ago

6.25 (Prime Numbers) A positive integer is prime if it’s divisible by only 1 and itself. For example, 2, 3, 5 and 7 are prime, b

faltersainse [42]

Answer:

public class Main {
public static void main (String [] args) {
for(int i = 2; i < 10000; i++){
if(isPrime1(i)){
System.out.print(i + " ");
}
}
System.out.println();
for(int i = 2; i < 10000; i++){
if(isPrime2(i)){
System.out.print(i + " ");
}
}
}
public static boolean isPrime1(int n){
for(int i=2; i <= n/2; i++){
if(n % i == 0){
return false;
}
}
return true;
}
public static boolean isPrime2(int n){
for(int i=2; i <= Math.sqrt(n); i++){
if(n % i == 0){
return false;
}
}
return true;
}
}

<u></u>

Explanation:

Firstly, create the first version of method to identify a prime number, isPrime1. This version set the limit of the for loop as n/2. The for loop will iterate through the number from 2 till input n / 2 and check if n is divisible by current value of i. If so, return false to show this is not a prime number (Line 22 - 26). Otherwise it return true to indicate this is a prime number.

In the main program, we call the isPrime1 method by passing the i-index value as an argument within a for-loop that will iterate through the number 2 - 10000 (exclusive). If the method return true, print the current i value). (Line 5 - 9)

The most direct way to ensure all the prime numbers below 10000 are found, is to check the prime status from number 2 - 9999 which is amount to 9998 of numbers.

Next we create a second version of method to check prime, isPrime2 (Line 31 - 40). This version differs from the first version by only changing the for loop condition to i <= square root of n (Line 33). In the main program, we create another for loop and repeatedly call the second version of method (Line 13 - 17). We also get the same output as in the previous version.

8 0

3 years ago

Aurelia is designing a user interface for a new game app. Which of the following should she taken into consideration for the use

serious [3.7K]

Answer:

Explanation:

what types of loop will be used.

4 0

3 years ago

HELP 100 points

natima [27]

Answer:

i do not know what to do there.

Explanation:

there's no pictures

5 0

2 years ago