All categories

3 years ago

How should you schedule a meeting with someone in another time zone?

1 answer:

7 0

If you know what timezone they're in, try to work out what time in your own timezone your free, then tell the other person to do the same. Tell them what times in your timezone and the other can search up what the time is in their own timezone. If there is a specific time when you are both free, use that.

Ex:

You live in the U.S. but you have a meeting with someone in the U.K. You're only free at 4:00pm-6:00pm and they're only free from 10:00am-11:00am. 11:00am in England is 4:00pm in the U.S. so do at that time!

Hope this helps!

You might be interested in

What does mean I can’t turn on my computer and my computer won’t charge at all

Dmitrij [34]

Explanation:

well that happened to me to and what my dad did was to cut the cable and fix it,it worked.Ithink my situation is very different than yours but you cantiue to see what else it says and if you want to you can text me back.

5 0

3 years ago

Which are factors that go into a project plan?

BaLLatris [955]

Answer:

The four critical factors to planning a successful project

Explanation:

5 0

3 years ago

Effective feedback should focus on the behavior, not the person. True False

Aleonysh [2.5K]

Your answer is False my fellow samurai

5 0

3 years ago

Read 2 more answers

URGENT!

lutik1710 [3]

Explanation:

Hey there! you need not to panic about it ,your program didn't have Driver program i.e main program! the correct & working code is given below:

// C++ program to count even digits in a given number .

#include <iostream>

using namespace std;

// Function to count digits

int countEven(int n)

{

int even_count = 0;

while (n > 0)

{

int rem = n % 10;

if (rem % 2 == 0)

even_count++;

n = n / 10;

}

cout << "Even count : "

<< even_count;

if (even_count % 2 == 0 )

return 1;

else

return 0;

}

// Driver Code

int main()

{

int n;

std::cin >>n;

int t = countEven(n);

return 0;

}

6 0

3 years ago

Consider the following algorithms. Each algorithm operates on a list containing n elements, where n is a very large integer.

DochEvi [55]

We have that the appropriate statement will be

An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list. Which of the algorithms run in reasonable time

III only.

Option B

From the question we are told

Consider the following algorithms. Each algorithm operates on a list containing n elements, where n is a very large integer.

I. An algorithm that accesses each element in the list twice.

II. An algorithm that accesses each element in the list n times.

III. An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list. Which of the algorithms run in reasonable time?

<h3>Algorithm </h3>

Generally In order to get admission to every thing in the list twice, the algorithm has to traverse the listing twice,

which leads to 2*n entry to operations.

And if the every factor is accessed n times, the listing will be traversed n time, which leads to n^2 get right of entry to operations.

If n is a very giant integer, each 2*n and n^2 are plenty larger.

So, there will be solely ten entry to operations and this algorithm will have a sensible jogging time.

Therefore

An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list. Which of the algorithms run in reasonable time

III only.

Option B

For more information on algorithm visit

brainly.com/question/950632

4 0

2 years ago