Answer:
A) True
Explanation:
While working with MS Access, the mail merge feature allows us to quickly pickup records from the database tables and insert them on Microsoft word documents such as letters/envelops and name tags before printing them. The main advantage of a mail merge is the time saved as the process of creating several mailings for different individual letters/envelops is made simple.
The first step in creating a mail merge is starting the Microsoft Word Mail Merge Wizard in MS Access which will guide you in the entire steps, some of these steps include:
1. Selecting the document you wish to work with
2. Switching to MS Word
3. Selecting the the size of the envelope .
4. Selecting the recipients records from the database table
5. Arranging and inserting records from the database (addresses on the envelope).
6. Review/Preview and Print
I guess depends on the language but for both java and C++ answer 3 is correct.
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.
Answer:
The answer is >
Explanation:
I did the assignment on edge this was the correct answer
