Explanation:
Mid-Square Method:-In this method some it takes some digits from the square of a number.This number is a random number.This number can be used as a key for hashing.
This technique is mostly used in hashing so decrease the collision in hash maps.
This method has a limitation that when we square a large number it may go out of range of integer so we have handle those cases.
Answer:
Data backup is probably the most important part of any IT system. Backing up your data means periodically saving a copy of your computer’s information to an offsite location for safe keeping. Having a copy of your computer’s data protects it from being lost in the event of a hard drive failure
Explanation:
1- On a Hard Drive (Onsite Backup)
2- Online Backup Services (Offsite Backup)
3- Cloud Backup Services (Offsite Backup)
<span>The DFS replication engine uses a form of replication called </span>multiple master replication
Answer:
The answer is "Pages Crawl Depth and 4".
Explanation:
The Crawl depth is the level, in which pages inside a site are indexed by a search engine. Page within the same website, which is directly linked with the web page has either a raster depths of 1 links.
- These pages are linked back, within the raster range of 1 site have a raster depths of 2 and many more.
- It is a site or subsites, where getting increasingly closely similar to a broader optical disks. It is best to ensure, that neither sites greater then 4 click is open.
Answer:
import java.util.Scanner;
public class DashLine {
public static void main(String[] args) {
// Declaring variables
int n;
/*
* Creating an Scanner class object which is used to get the inputs
* entered by the user
*/
Scanner sc = new Scanner(System.in);
// Getting the input entered by the user
System.out.print("Enter a number :");
n = sc.nextInt();
// calling the method by passing the user entered input as argument
dashedLine(n);
}
//This method will print the dashed line for number greater than zer
private static void dashedLine(int n) {
if (n > 0) {
for (int i = 1; i <= n; i++) {
System.out.print("-");
}
System.out.println();
}
}
}
Explanation:
