All categories

2 years ago

Which local folder temporarily stores all outgoing emails until the email program successfully sends them to a recipient?

Computers and Technology

2 answers:

Leya [2.2K]2 years ago

8 0

Answer:

Outbox

(Plato/Edmentum Approved)

jolli1 [7]2 years ago

5 0

Answer:

The answer o this question is given below in the explanation section.

Explanation:

When you will create or compose an email, it will automatically get saved in the local draft folder.

Some email providers, for example, g-mail, when you will compose e-mail it gets saved in a local folder called draft and stores all outgoing emails until the progress successfully sends to the recipient.

However, it is noted that some email providers stores all outgoing email until the email program successfully sends them to the recipient in a local folder called "outbox". When an e-mail sent successfully to the recipient, then the e-mail will be shown in the sent folder.

You might be interested in

The cafeteria offers a discount card for sale that entitles you, during a certain period, to a free meal whenever you have bough

melomori [17]

Answer:

Explanation:

The algorithm can be described as follows

The first process is to ensure that the constraints for the time at which the offers begin is well defined.

TIME1 = 14:00

TIME2 = 16:00

TIME3 = 18:00

Then, decide the final number of meal following the free meal that has been offered.

NUMBER_OF_MEALS=4;

Then; decide the prices attached to the meal at regular times.

PRICE = 200;

At regular mode, decide the prices attached to the meal and as well as when the offer time commences.

PRICE_OFFER = 160;

Then ask the client(i.e the user) to put in the value required for the number of meals they desire to order.

Input values in n

Suppose (the value exceeds 8)

Then proceed to enquire from the client if they wish to go for the offer.

If not, use the regular price for the order.

Assume the client asks if the offer is a good one to bid for.

You are to show then the analysis of the calculation.

regular = 8 × PRICE

offer = 8 × PRICE_OFFER

profit = regular - offer

Finally, show the profit to the client which will let them know if it is good to bid for it or not.

8 0

3 years ago

If a hypothesis is strongly supported by the scientific community based on compelling experiment results, it becomes a————

SOVA2 [1]

I'm pretty sure it becomes a fact.

6 0

3 years ago

Read 2 more answers

Keith has to carry out a photo shoot to capture images of the ocean during the monsoons. What is a recommended practice when sho

Semmy [17]

Answer:

Answer is A: place absorbent chemical packets in the camera cover

Explanation:

Keith is required to carry adequate gear while going for a shoot. And in this case, he should carry anything that will protect his camera from the ocean and rainwater. By anything, I mean anything that Keith will use to stay dry. Using an air conditioner would be the worst idea. An air conditioner might blow the air towards your camera. Placing the camera in its case will ensure that it is dry and Keith will keep on shooting. Placing absorbent chemical packets in the camera cover will ensure that any water droplets that might fall on the cover of the camera will be absorbed. The point here is to keep dry.

6 0

3 years ago

In cell E14, enter a date function that calculates the number of days between the Initial Deadline (cell E10) and the Date Recei

tatuchka [14]

Answer:

The formula to enter in E14 is as follows:

=DAYS(D14,$E$10)

Explanation:

Required

Formula to calculate the number of days between E10 and D14

The syntax to do this is:

=DAYS(end_date,start_date)

So, we have:

=DAYS(D14,E10)

The question requires a mix of relative and mixed references because cell E10 will be constant in calculating the difference for dates in other cells.

In other words, the initial date is constant for all

So, the update formula is:

=DAYS(D14,$E$10)

Notice the $ between in E10; this represents mixed referencing

When dragged to E15 till E68, the formulas in the respective cells will be:

=DAYS(D15,$E$10) .............................. =DAYS(D68,$E$10)

7 0

3 years ago

What are the major differences between searching and sorting in Java? What are some of the differences in the techniques used in

Studentka2010 [4]

Answer:

Searching is a technique to look for an item or target value in a data structure like searching for a phone number in a directory.Data structure can be an array,List etc. Searching algorithms are used for searching. Most common examples are Linear Search and Binary Search. Lets take the example Linear Search in order to explain it using JAVA. Its the simplest searching algorithm. To search for a specific element, look at each element in the data structure sequentially and check if it matches with the element being searched for.

Sorting is a technique of arranging the elements in a specific order e.g. numerical sorting, ordering students according to their exam score. This order can be ascending or descending or alphabetical order. Contrary to search it returns the data structure e.g. an array in which the elements of array are sorted in a particular order. Sorting algorithms are used to sort elements in a data structure. Some common examples of sorting algorithms are Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, Heap Sort etc. JAVA uses Array.Sort() built-in function for sorting an array. By default it sorts the input array in ascending order.

Selection Sort: It is a sorting technique which divides an array into two subarrays. One subarray in the left is sorted and the other one at right is unsorted. This is an in-place algorithm. It is not a good option for large data. Initially the sorted part is empty and all elements are placed in unsorted array. First the element which is the smallest in the unsorted array is selected and swapped with the leftmost array element and becomes part of the sorted array. In each iteration the smallest element from the unsorted array is selected and moved to sorted part of the array.The worst case time complexity of this algorithm is O(n)^2 as we have to find the smallest for every element in the array.

Merge Sort: It is a comparison based algorithm. It works on divide and conquer technique. It uses recursion approach for sorting. This means it breaks the problem(lets say array list to be sorted) into sub problems (smaller parts) and then solves (in this case sorts) each sub problem in a recursive manner. At the end it merges the solutions (hence the merged sorted array). Although selection sort works faster when data set is small merge sort outperforms it for larger data sets. Merge sort is a stable algorithm and works best for linked lists. Its not an in place algorithm. Time complexity of merge sort is O(n*log n) for best, average and worst cases because it always divides the array in two parts and takes linear time to merge these part. O(n(logn)) time complexity makes it better,more efficient and faster to sort large data sets.

Big Oh O notation is an asymptotic annotation written as O(n) which is a mathematical way to represent the upper bound of the running time of algorithm (sorting algorithm in this case). It computes the worst case time complexity. Worst case time complexity means that the longest amount of time or maximum number of operations that will be required for a sorting algorithm to complete. The time complexity mostly gets affected as the size of the input varies.
For example lets find out the worst-case time complexity of Bubble Sort for a list of n elements. Worst case is when the array is reversed sorted. At first iteration it would make n-1 comparisons. At iteration 1, for n-2 times and so total comparison will be O(n^)2. So the time to run program is proportional to the square of the input size.

Searching algorithms are used when there is a need to find a specific data item from bulk of data item. Searching algorithms make this hectic process easier. For example you want to find phone number of person from directory. without searching algorithm looking for each phone number in the directory manually can be very time consuming. For example you have to find address of a customer number 254 from database to deliver a product. Instead of manually looking for customer numbers you can simply use linear search algorithm that will start from customer 1 and sequentially searches for specific customer 254 number and provides the address in a shorter time.
Sorting reduces complexity of problems e.g reducing the searching complexity. It is easier to locate data elements in a sorted list than unsorted. For example comparing two large data sets containing millions of records. If both the data sets are ordered, the comparison gets easier. Moreover every sorting algorithm has certain usage. Like merge sort is useful for linked lists,heap sort is good with arrays and uses less memory. If data is small with large values, selections sort is better for this. It doesn’t require any additional space. Databases use merge sort to arrange data that is too large to be loaded completely into memory. Heap sort is used in reading bar codes on plastic cards. Quick sort is used to maintain sports score on the basis of win-loss ratio.

5 0

3 years ago