# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

## Min Hash Multiple choice Questions and Answers (MCQs)

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which technique is used for finding similarity between two sets?

MinHash | |

Stack | |

Priority Queue | |

PAT Tree |

Question 1 Explanation:

In computer science as well as data mining, to find the similarity between two given sets, a technique called MinHash or min-wise independent permutation scheme is used. It helps in the quick estimation of the similarity between two sets.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Who invented the MinHash technique?

Weiner | |

Samuel F. B. Morse | |

Friedrich Clemens Gerke | |

Andrei Broder |

Question 2 Explanation:

In computer science as well as data mining, to find the similarity between two given sets, a technique called MinHash or min-wise independent permutation scheme is used. It helps in the quick estimation of the similarity between two sets. It was invented by Andrei Broder in 1997.

Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which technique was firstly used to remove duplicate web pages from search results in AltaVista search engine?

MinHash | |

Stack | |

Priority Queue | |

PAT Tree |

Question 3 Explanation:

In computer science as well as data mining, to find the similarity between two given sets, a technique called MinHash or min-wise independent permutation scheme is used. It helps in the quick estimation of the similarity between two sets. It is used in removing duplicate web pages from search results in AltaVista search engine.

Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which technique was firstly used clustering documents using the similarity of two words or strings?

MinHash | |

Stack | |

Priority Queue | |

PAT Tree |

Question 4 Explanation:

In computer science as well as data mining, to find the similarity between two given sets, a technique called MinHash or min-wise independent permutation scheme is used. It helps in the quick estimation of similarity between two sets. It is used in clustering documents using the similarity of two words or strings.

Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which indicator is used for similarity between two sets?

Rope Tree | |

Jaccard Coefficient | |

Tango Tree | |

MinHash Coefficient |

Question 5 Explanation:

In computer science as well as data mining, to find the similarity between two given sets, a technique called MinHash or min-wise independent permutation scheme is used. It helps in the quick estimation of similarity between two sets. Jaccard Coefficient is used for similarity between two sets.

There are 5 questions to complete.