Linear probing
It does a linear search for an empty slot when a collision is identified
Advantages
Easy to implement
It always finds a location if there is one
Disadvantages
When clusters and keys fill most of the array after forming in adjacent slots of the table, the performance deteriorates
Double probing/hashing
The idea here is to make the offset to the next position probed depending on the key value. This is so it can be different for different keys.
Advantages
Good for double number generation
Smaller hash tables can be used.
Disadvantages
As the table fills up, the performance degrades.
Quadratic probing
It is used to resolve collisions in hash tables. It is an open addressing scheme in computer programming.
Advantage
It is more efficient for a closed hash table.
Disadvantage
Has secondary clustering. Two keys have same probe sequence when they hash to the same location.
Which of the following is a productivity strategy for collaboration?
-
A. Saving focused work for a time of day when you feel most creative.
- B. Employing the 80/20 rule to prioritize tasks.
- C. Posting files to a web-based shared site.
- D. Using white noise to block distractions in the office.
<u>Answer:</u>
Posting files to a web-based shared site is a productivity strategy for collaboration.
- C. Posting files to a web-based shared site.
<u>Explanation:</u>
Collaborative software or groupware is application programming intended to help individuals taking a shot at a typical errand to achieve their objectives. This permits individual to impart thoughts and their abilities to different individuals with the goal that the assignment can be done both proficiently and adequately.
Joint effort stages ordinarily incorporate an email customer, Web conferencing, internet based life sharing, video capacities, report sharing abilities, texting and that's just the beginning. Endeavor joint effort stages are intended to be introduced on-premises or conveyed by means of the Web as cloud-based administrations.
Answer:
A. To uniquely identify each record in the table
brainliest pls?
Answer:
int sumAll(int n)//function definition.
{
if(n==1)//if condition.
return 1;
else//else condition.
{
return n+sumAll(n-1);//return the value and call the function in recursive manner.
}
}
Explanation:
- The above-defined function is a recursive type function that is written in the c language, which holds the if and else condition.
- When the user passes the largest value from 1, then the else condition will be executed which adds the largest value and pass the value after the decrement of the value as an argument.
- When the value will become 1, then the function if-block will be executed which returns the value and ends the calling function recursively.
Answer:
Algorithm:
1. Declare an integer variable N.
2. Read the value N from user.
3.While(N):
3.1 find r=N%10;
3.2 print r in new line.
3.3 Update N as N=N/10.
4.end program.
Implementation in C++.
// header
#include <bits/stdc++.h>
using namespace std;
// main function
int main()
{
// variable
int N;
cout<<"Enter an Integer:";
cin>>N;
// find the digits of number
while(N)
{
// last digit
int r=N%10;
// print last digit
cout<<r<<endl;
// update the number
N=N/10;
}
return 0;
}
Output:
Enter an Integer:329
9
2
3
