Answer:
authentication
Explanation:
At the authentication process, there is a way of identifying a user, this is typically done by having the user enter a valid user name and valid password before access is granted. Here at authentication the process is based on each user having a unique set of criteria for gaining access.
The AAA server have to ascertain by comparing a user's authentication credentials with other user credentials stored in a database. In the event the credentials match, the user is granted access to the network. But on the other hand, If the credentials varies, and authentication fails then network access will be denied.
The code below is written in javascript which gives us the integer,
<h3>The function code is</h3>
function solution (num){
//Javascript function
var x=0,sum=0,a,b;
var d=""; //variable declaration
var digits = num.toString().split('');
var Individual = digits.map(Number);
//console.log(Individual);
for (var i=0;i<Individual.length;i++)
{//For loop
x=x+Individual[i];
}
var y=x*2;
for(var i=0;i<Individual.length;i++)
{
sum=sum+Individual[i];
d=""+d+Individual[i];
if(sum==y)
break;
if(i==Individual.length-1)
{
i=-1;
continue;
}
}
console.log("the value is "+d);
}
var number = prompt("enter the number");
//Asking user for value...
console.log("the number is");
console.log(number);
solution(num
For more information on javascript, visit
brainly.com/question/16698901?referrer=searchResults
Answer:
The time in which the alarm clock will sound
Explanation: Hope this helped please give me brainliest
Answer:
360/number of sides
Explanation:
all the exterior angles add up to 360°
so to find each angle mesure, divide the 360 by the number of sides the figure has.
Answer:
See explaination
Explanation:
The reasons why indexed sequential search structure is better are:
1. In index sequential search any field of the records can be used as the key. This key field can be numerical or alphanumerical.
2. Since each record has its data block address, searching for a record in larger database is easy and quick. There is no extra effort to search records. But proper primary key has to be selected to make efficient.
3. This method gives flexibility of using any column as key field and index will be generated based on that. In addition to the primary key and its index, we can have index generated for other fields too. Hence searching becomes more efficient, if there is search based on columns other than primary key.
The reasons why 5 B-tree is better:
1.The B-tree Provides support for range of queries in an efficient manner and You can iterate over an ordered list of elements.
2. B-Tree algorithms are good for accessing pages (or blocks) of stored information which are then copied into main memory for processing. In the worst case, they are designed to do dynamic set operations in O(lg n) time because of their high "branching factor" (think hundreds or thousands of keys off of any node). It is this branching factor that makes B-Trees so efficient for block storage/retrieval, since a large branching factor greatly reduces the height of the tree and thus the number of disk accesses needed to find any key.
3. It is a generalization of a BST in that a node can have more than two children. These are self-balancing and hence the average and worst complexities is logarithmic. We opt for these when the data is too huge to fit in main memory. These structures are used in database indexing and help in faster operations on disk
the additional informations is we should first decide to choose which structure is suiatable for which algoritm in terms of space and time and then use the appropriate search algorithm.
