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
Alina [70]
3 years ago
9

You are running an application in Google App Engine that is serving production traffic. You want to deploy a risky but necessary

change to the application. It could take down your service if not properly coded. During development of the application, you realized that it can only be properly tested by live user traffic. How should you test the feature?
Computers and Technology
1 answer:
ziro4ka [17]3 years ago
6 0

Answer:

You need to split the traffic to your test version.

Explanation:

Google app engine has a built-in feature that allows you to split a small fraction of your traffic to your test version.

You can split traffic using an IP address, so when the app receives a request, it can hash the Ip to a value between 0 to 999, and use it to re-route the request.

This way you don't need to stop your service during your tests and also avoid any risk involved with it.

You might be interested in
When data can flow across a cable in both directions, this is known as___Communicating?
Ede4ka [16]

Answer:

full duplex communication.

Explanation:

In a duplex type of topology or communication, data or information can be transferred in both directions.

There are two different types of these communications

3 0
2 years ago
What technology has a function of using trusted third-party protocols to issue credentials that are accepted as an authoritative
jarptica [38.1K]

Answer: PKI certificates

Explanation: PKI is known as the public key infrastructure which is commonly used for the encryption of the data and also for the data signing. They have the ability to assign the keys pair.

PKI certificates are in the form of strings of alpha-numeric running for a mathematical functions. They use the third party protocols for the execution and they are widely accepted by the authoritative identity.

5 0
2 years ago
25% of 60 min<br> 20% of 60 min<br> 33%% of 60 min
Alexxx [7]
15
12
19.8 cool cool cool
7 0
2 years ago
Please help me, I honestly dont know what happened to my laptop.
Alex787 [66]
Restart the whole computer??
7 0
3 years ago
Read 2 more answers
Recall that within the ArrayBoundedQueue the front variable and the rear variable hold the indices of the elements array where t
Citrus2011 [14]

Answer:

int n = elements.length;

if(rear < n) {

rear = (rear + 1) % n;

elements[rear] = element;

rear = rear + 1;

}

Explanation:

Options are not made available; However, I'll answer the question base on the following assumptions.

Assumptions

Array name = elements

The front and the rear variable hold the current indices elements

Element to enqueue is "element" without the quotes

To enqueue means to add an element to an already existing queue or to a new queue.

But first, the queue needs to be checked if it can accept a new element or not; in other words, if it's full or not

To do this, we check: if rear < the length of the queue

If this statement is true then it means the array can accept a new element; the new element will be stored at elements[rear] and the rear will be icremented by 1 rear by 1

Else if the statement is false, then an overflow is said to have occurred and the element will not be added.

Going by the above explanation, we have

int n = elements.length;

if(rear < n) {

rear = (rear + 1) % n;

elements[rear] = element;

rear = rear + 1;

}

Additional explanation:

The first line calculates the length of the queue

The if condition on line 2 tests if the array can still accept an element or not

Let's assume this statement is true, then we move to liine 3

Line 3 determines the new position of rear.

Let's assume that n = 6 and current rear is 4.

Line 3 will produce the following result;

rear = (rear + 1) % n;

rear = (4 + 1)% 6

rear = 5%6

rear = 5.

So, the new element will be added at the 5th index

Then line 4 will be equivalent to:

elements[rear] = element;

elements[5] = element;

Meaning that the new element will be enqueued at the 5th index.

Lastly, rear is incremented by 1 to denote the new position where new element can be added.

6 0
3 years ago
Other questions:
  • Which of the following is the best example of a manager with a delegator leadership style
    10·2 answers
  • The page orientation in which the page width is greater than the page height is called
    8·1 answer
  • A school at which you are likely to be accepted because you meet graduation requirements is called a:
    5·1 answer
  • A(n) ____ consists of a series of related instructions, organized for a common purpose, that tells the computer what tasks to pe
    6·1 answer
  • 2. A well designed high-volume system will minimize _________ inventory and reduce _____________for the product or service. a) w
    7·1 answer
  • NAT is able to stop ________. Group of answer choices a) scanning probes sniffers from learning anything about the internal IP a
    8·2 answers
  • What is the principal goal of data science?<br>​
    5·1 answer
  • How to make a website
    15·2 answers
  • Comment if u wanna text me on behance
    6·1 answer
  • If a computer uses 500 characters, how many bits this system requires to give different code to all characters?
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!