HOME
PARTNERS
CONTACT

Computer Science and Engineering Data Structures – 1 Experiments

Aim

Overview

Recap

Pretest

Hash Tables

Aim Concept Operations Practice Exercise Quiz

Collision Resolution

Aim Concept Seperate Chaining Open Addressing Quiz

Linear Probing

Aim Concept Linear Probing Practice Exercise Quiz

Quadratic Probing

Aim Concept Practice Exercise Quiz

Double Hashing

Aim Concept Practice Exercise Quiz

Posttest

Hash Tables

Choose difficulty:

Beginner

Intermediate

Advanced

1. In a linear-probing hash table, which of the following circumstances results in linear running time for a random search hit?

a: All keys hash to same index Explanation

Explanation

b: All keys hash to different indices Explanation

Explanation

c: All keys hash to an even-numbered index Explanation

Explanation

d: All keys hash to different even-numbered indices Explanation

Explanation

2. In a hash table, what is the ideal definition of a collision?

a: Two entries are identical except for their keys Explanation

Explanation

b: Two entries with different data have the exact same key Explanation

Explanation

c: Two entries with different keys have the same exact hash value Explanation

Explanation

d: Two entries with the exact same key have different hash values Explanation

Explanation

3. Which of the following statement(s) is TRUE?

a: A hash function takes a message of arbitrary length and generates a fixed length code. Explanation

Explanation

b: A hash function takes a message of fixed length and generates a code of variable length. Explanation

Explanation

c: Both Explanation

Explanation

d: None of these Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)