Skip to content

Tag Archives: Data Structures-Hash

Joining two different tables on their matching columns can be done using nested loops, but a more efficient and scalable way is to use multimaps.… Read More
Given an array arr[] of N integers, the task is to find the maximum absolute difference between distinct elements of the array.Examples:  Input: arr[] =… Read More
Prerequisite: Symbol Table A Symbol table is a data structure used by the compiler, where each identifier in program’s source code is stored along with… Read More
Given a binary search tree of n nodes with distinct values. Also given are Q queries. Each query consists of a node value that has… Read More
Given Q queries of type 1, 2, 3 and 4 as described below. Type-1: Insert a number to the list. Type-2: Delete only one occurrence… Read More
Given the following input (4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199) and the hash function x mod 10, which of the following statements are… Read More
Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty,… Read More
The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using open addressing… Read More
How many different insertion sequences of the key values using the hash function h(k) = k mod 10 and linear probing will result in the… Read More
A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values into an empty… Read More