All categories

2 years ago

An Open Authorization (OAuth) access token would have a _____ that tells what the third party app has access to

Computers and Technology

1 answer:

qaws [65]2 years ago

3 0

Answer:

scope

Explanation:

An Open Authorization refers to a method that helps to share data using third party services without giving your credentials and there is a mechanism in an Open Authorization that allows to limit the access that the third party app has to an account that is called scope. Because of that, the answer is that an Open Authorization (OAuth) access token would have a scope that tells what the third party app has access to because it is what limits the access the app has to an account and it shows the access given in a consent screen.

You might be interested in

You are given an array x of string elements along with an int variable n that contains the number of elements in the array. You

Slav-nsk [51]

Answer:

The code to this question can be given as:

Code:

int i,j,count_previous=0,count_next=0; //define variable

for (j=0; j<n; j++) //loop for array

{

if (x[0]==x[j]) //check condition

{

count_previous++; //increment value by 1.

}

for (i=0; i<n; i++) //loop

{

for (j=0; j<n; j++)

{

if (x[i]==x[j]) //check condition

{

count_next++; //increment value by 1.

}

if (count_previous>count_next) //check condition

{

mode=x[i-1];

}

else

{

mode=x[i];

count_previous=count_next; //change value.

count_next= 0 ; //assign value.

}

Explanation:

In the question it is define that x is array of the string elements that is already define in the question so the code for perform operation in the array is given above. In the code firstly we define the variable that is i, j, count_previous, count_next. The variable i,j is used in the loop and variable count_previous and count_next we assign value 0 that is used for check the values of array. Then we define the for loop in this loop we use conditional statement in the if block we check that array of zero element is equal to array of j value then the count_previous is increase by 1. Then we use nested loop It is also known as loop in a loop. In this first loop is used for array and the second loop is used for check array element.In this we use the condition that if array x of i value is equal to array x of j then count_next will increment by 1.Then we use another condition that is if count_previous is greater then count_next then mode of x is decrement by 1. else mode equal to array and count_previous holds the value of count_next and count_next is equal to 0.

8 0

2 years ago

The word “computer” has become associated with anything related to screens and keyboard. However, these are not the only parts t

Digiron [165]

Explanation: The CPU is the main control chip which calculates what has to be done in order for your computer to function.

(Very interesting question you had. Hope this answer helps)

4 0

2 years ago

#Write a function called string_finder. string_finder should #take two parameters: a target string and a search string. #The fun

adoni [48]

Answer:

I am writing a Python program:

def string_finder(target,search): #function that takes two parameters i.e. target string and a search string

position=(target.find(search))# returns lowest index of search if it is found in target string

if position==0: # if value of position is 0 means lowers index

return "Beginning" #the search string in the beginning of target string

elif position== len(target) - len(search): #if position is equal to the difference between lengths of the target and search strings

return "End" # returns end

elif position > 0 and position < len(target) -1: #if value of position is greater than 0 and it is less than length of target -1

return "Middle" #returns middle

else: #if none of above conditions is true return not found

return "not found"

#you can add an elif condition instead of else for not found condition as:

#elif position==-1

#returns "not found"

#tests the data for the following cases

print(string_finder("Georgia Tech", "Georgia"))

print(string_finder("Georgia Tech", "gia"))

print(string_finder("Georgia Tech", "Tech"))

print(string_finder("Georgia Tech", "Idaho"))

Explanation:

The program can also be written in by using string methods.

def string_finder(target,search): #method definition that takes target string and string to be searched

if target.startswith(search): #startswith() method scans the target string and checks if the (substring) search is present at the start of target string

return "Beginning" #if above condition it true return Beginning

elif target.endswith(search): #endswith() method scans the target string and checks if the (substring) search is present at the end of target string

return "End" #if above elif condition it true return End

elif target.find(search) != -1: #find method returns -1 if the search string is not in target string so if find method does not return -1 then it means that the search string is within the target string and two above conditions evaluated to false so search string must be in the middle of target string

return "Middle" #if above elif condition it true return End

else: #if none of the above conditions is true then returns Not Found

return "Not Found"

6 0

1 year ago

A computer has 4 GB of RAM of which the operating system occupies 512 MB. The processes are all 256 MB (for simplicity) and have

Afina-wow [57]

Answer:

$1-p^{14} = 0.99$

$p^{14}= 0.01$

$p =(0.01)^{1/14}= 0.720$

So then the value of the maximum I/O wait that can be tolerated is 0.720 or 72 %

Explanation:

Previous concepts

Input/output operations per second (IOPS, pronounced eye-ops) "is an input/output performance measurement used to characterize computer storage devices like hard disk drives (HDD)"

Solution to the problem

For this case since we have 4GB, but 512 MB are destinated to the operating system, we can begin finding the available RAM like this:

Available = 4096 MB - 512 MB = 3584 MB

Now we can find the maximum simultaneous process than can use with this:

$\frac{3584 MB}{256 MB/proc}= 14 processes$

And then we can find the maximum wait I/O that can be tolerated with the following formula:

$1- p^{14}= rate$

The expeonent for p = 14 since we got 14 simultaneous processes, and the rate for this case would be 99% or 0.99, if we solve for p we got:

$1-p^{14} = 0.99$

$p^{14}= 0.01$

$p =(0.01)^{1/14}= 0.720$

So then the value of the maximum I/O wait that can be tolerated is 0.720 or 72 %

3 0

2 years ago

Choose the person responsible for each innovation.

shepuryov [24]

Answer:

John Blankenbaker

Explanation:

5 0

2 years ago