1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
olganol [36]
2 years ago
14

How can you quickly locate emails with large attachments.

Computers and Technology
1 answer:
IgorC [24]2 years ago
4 0

To locate emails with large attachments, go to your email and then choose the option of Choose File > Cleanup Tools > Mailbox Cleanup.

Here , one has to Log into their email account and open their inbox and then use the Search Mail bar and type Size to locate or they Set the Find items that are larger than to 9999 and then one has to click Find.

<h3>How do I find emails by attachment size?</h3>

This can also be done for messages that has a size equal to or bigger than 25.

One has to open their message and then they have to right-click on the attachment. You can choose Save As and save to the location of the choice you want.

Learn more about attachments from

brainly.com/question/978078

You might be interested in
Characteristics of the printer​
sveticcg [70]
Important printer characteristics include resolution, speed, color, and cache memory.
4 0
3 years ago
Does a call go through on the first ring when hanging up on a house phone
Alinara [238K]
I don't think so, it doesn't on my home phone.
6 0
3 years ago
Technological developments over the past two decades, such as the rise of the internet and email, have
enyata [817]
Change our live because....
7 0
3 years ago
Read 2 more answers
Consider the following JavaScript program:
dem82 [27]

Answer:

Variable       Where Declared

In Sub1 :

        A        Sub1

        Y        Sub1

        Z        Sub1

        X        Main

In Sub2:

        A        Sub2

        B        Sub2

        Z        Sub2

        Y        Sub1

        X        Main

In Sub3 :

        A        Sub3

        X        Sub3

        W       Sub3

        Y        Main

        Z        Main

Explanation:

In static-scoped languages with nested subprograms, the declaration of a variable is checked with the subprogram, if it is not found, it check within the parent method that called it, it continue until it find a declaration, if no declaration is found, it display an error.

In Sub1, a, y, z is declared there while the declaration of x is found in main.

In Sub2, a, b, z is declared, declaration of y is found in sub1 and declaration of x is found in main.

In Sub3, a, x, w is declared while the declaration of y, z is from the main.

7 0
3 years ago
Write the routines with the following declarations: void permute( const string &amp; str ); void permute( const string &amp; str
fomenos

Answer:

Here is the first routine:

void permute( const string &str ) {  // function with one parameter

 int low = 0;

 int high = str.length();

 permute(str, low, high);

}    

Or you can directly call it as:

 permute(str, 0, str.length());

Explanation:

The second routine:

void permute( const string &str, int low, int high)  

//function with three parameters

{ string str1 = str;

 if ( low == high ) {  //base case when last index is reached

   for (int i = 0; i <= high; ++i)

     cout << str1[i]; }  //print the strings  

 else {

   for (int i=low; i<high; ++i) {  // if base case is not reached

     string temp = str1;   //fix a character

     swap( str1[i], str1[low] ); //swap the values

     permute( str1, low + 1, high );  //calling recursive function (recursion case)

     swap( str1[i], str1[low] );     }  } } //swap again to go to previous position

In this function the following steps are implemented:

A character is fixed in the first position.

Rest of the characters are swapped with first character.

Now call the function which recursively repeats this for the rest of the characters.

Swap again to go to previous position, call the recursive function again and continue this process to get all permutations and stop when base condition is reached i.e. last index is reached such that high==low which means both the high and low indices are equal.

You can write a main() function to execute these functions.

int main() {

 string str;

 cout << "Enter a string: ";

 cin >> str;

 permute(str);  }

5 0
3 years ago
Other questions:
  • What is the name of a computer or application program that intercepts user requests from the internal secure network and then pr
    11·1 answer
  • Driving is expensive. Write a program with a car's miles/gallon and gas dollars/gallon (both doubles) as input, and output the g
    7·2 answers
  • For what type of document would you use the landscape page orientation
    11·1 answer
  • Whats the answer to this question?
    7·1 answer
  • How can you tell if your car is overheating?
    12·2 answers
  • All of the following are advantages of database-stored information, except ______________. Multiple Choice
    7·1 answer
  • Adam is an Engineering student but has decided that he does not want to work in that field, but in the Manufacturing career clus
    11·2 answers
  • Can you be my friend plz
    9·1 answer
  • A(n) ________ cloud does not free an organization from the issues associated with managing the cloud infrastructure, but it does
    7·1 answer
  • What would the range(3, 9) function generate?
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!