Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Which among the following statement(s) is (are) true? (A) A hash function takes a message of arbitrary length and generates a fixed length code. (B) A hash function takes a message of fixed length and generates a code of variable length. (C) A hash function may give same hash value for distinct messages. Choose the correct answer from the options given below:
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, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.
For an m bit hash value, if we pick data blocks at random we can expect to find two data blocks with the same hash value within ____ attempts.
In bit-plane slicing if an image is represented by 8 bits and is composed of eight 1-bit plane, with plane 0 showing least significant bit and plane 7 showing most significant bit. Then, which plane(s) contain the majority of visually significant data.
K produces 100 parts twice as fast as G does. G produces 100 parts in 40 minutes. If each produces parts at a constant rate, how many parts will K produces in 6 minutes.
On some day, manufacturing unit A produces 78,868 toys, manufacturing unit B produces 87,868 toys, manufacturing unit C produces 88,768 toys and manufacturing unit D produces 67,888 toys. Which manufacturing unit is doing the second least production?
The influence of shape of aggregate in strength and workability of concrete are given below in statements S1, S2, S3 and S4. Which of the statements are correct? S1: Rounded aggregate produces concrete with high workability and low strength. S2: Angular aggregate produces concrete with high workability and low strength. S3: Rounded aggregate produces concrete with low workability and high strength. S4: Angular aggregate produces concrete with low workability and high strength.
For a table having 4 columns, the number of columns to which hash function is applied when using hash indexes is __________
Suppose we are given n keys, m hash table slots, and two simple uniform hash functions h1 and h2. Further, suppose our hashing scheme uses h1 for the odd keys and h2 for the even keys. What is the expected number of keys in a slot? 
Consider a hash table of size 7, with hash function H (k) = k % 7, and pseudo random i = (i + 5) % 7. We want to insert the following keys one by one from left to right. 15, 11, 25, 16, 9, 8, 12 What will be the position of the key 25, if we use random probing?