All categories

2 years ago

To have the most impact when using email, you should structure your messages so that

1 answer:

6 0

Hello Ashley, so basically we all know what email is, but a brief explanation is messages distributed by electronic means from one computer user to one or more recipients via a network. So to use email efficiently (BTW I don't know if this is select all that apply or multiple choice, so I'll do both) you need to have the most important info coming in first. Then, to top that and be an email master, so to speak, you have to bullet and highlight important issues and topics so A, if its multiple choice and A+B if it is select all that apply.

Hope this helped!

You might be interested in

The running time of Algorithm A is (1/4) n2+ 1300, and the running time of another Algorithm B for solving the same problem is 1

Mnenie [13.5K]

Answer:

Answer is explained below

Explanation:

The running time is measured in terms of complexity classes generally expressed in an upper bound notation called the big-Oh ( "O" ) notation. We need to find the upper bound to the running time of both the algorithms and then we may compare the worst case complexities, it is also important to note that the complexity analysis holds true (and valid) for large input sizes, so, for inputs with smaller sizes, an algorithm with higher complexity class may outperform the one with lower complexity class i.e, efficiency of an algorithm may vary in cases where input sizes are smaller & more efficient algorithm might be outperformed by the lesser efficient algorithms in those cases.

That's the reason why we consider inputs of larger sizes when comparing the complexity classes of the respective algorithms under consideration.

Now coming to our question for algorithm A, we have,

let F(n) = 1/4x² + 1300

So, we can tell the upper bound to the function O(F(x)) = g(x) = x2

Also for algorithm B, we have,

let F(x) = 112x - 8

So, we can tell the upper bound to the function O(F(x)) = g(x) = x

Clearly, algorithmic complexity of algorithm A > algorithmic complexity of algorithm B

Hence we can say that for sufficiently large inputs , algorithm B will be a better choice.

Now to find the exact location of the graph in which algorithmic complexity for algorithm B becomes lesser than

algorithm A.

We need to find the intersection point of the given two equations by solving them:

We have the 2 equations as follows:

y = F(x) = 1/4x² + 1300 __(1)

y = F(X) = 112x - 8 __(2)

Let's put the value of from (2) in (1)

=> 112x - 8 = 1/4x² + 1300

=> 112x - 0.25x² = 1308

=> 0.25x² - 112x + 1308 = 0

Solving, we have

=> x = (112 ± 106) / 0.5

=> x = 436, 12

We can obtain the value for y by putting x in any of the equation:

At x=12 , y= 1336

At x = 436 , y = 48824

So we have two intersections at point (12,1336) & (436, 48824)

So before first intersection, the

Function F(x) = 112x - 8 takes lower value before x=12

& F(x) = 1/4x² + 1300 takes lower value between (12, 436)

& F(x) = 112x - 8 again takes lower value after (436,∞)

Hence,

We should choose Algorithm B for input sizes lesser than 12

& Algorithm A for input sizes between (12,436)

& Algorithm B for input sizes greater than (436,∞)

8 0

2 years ago

Create a Python script that takes two parameters to do the following:-

tekilochka [14]

Answer:

import sys, time

from os import walk, remove

from os.path import exists, join, getsize, getctime

file_counter = [ ]

folder_name, file_size = argv

isExist = exists( folder_name )

if folder_name == True:

for root, folder, files in walk( folder_name ):

for file in files:

if getsize( join ( root, file ) ) >= file_size:

file_log = [ ]

file_log.append( file )

file_log.append( join ( root, file) )

file_log.append( time.ctime( getctime( file ) ) )

file_counter.append( file_log )

else:

remove ( join ( root, file ) )

Explanation:

The python script above output the filename, size and file creation date of any folder passed to it.

6 0

2 years ago

Which of these statements about cell references is NOT true?

Ganezh [65]

Are there answers you can choose from?

4 0

2 years ago

Read 2 more answers

Which computers were the first PCs with a GUI<br> MS-DOS <br> Linux<br> Windows<br> Mac

sergeinik [125]

Answer:

The first computer with a GUI were linux, microsoft and apple.

Explanation:

I think this is right. Hope it helped <3

8 0

3 years ago

Read 2 more answers

Think Critically 5-1 Creating Flexible Storage.

Brrunno [24]

Answer:

The Storage Spaces feature in Windows

Explanation:

The Storage Spaces feature can be used here. This feature was initiated in Windows server 2012 and allows the user store his files on the cloud or virtual storage. This makes it possible to have a flexible storage as there is a storage pool which is updated with more storage capacity as it decreases. The feature also offers storage security, backing up files to other disks to protect against total loss of data on a failed disk.

7 0

2 years ago