An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let $$k$$ be the number of keys, $$m$$ be the number of slots in the hash table, and $$k > m$$. Which one of the following is the best hashing strategy to counteract the adversary?
Which one of the options given below refers to the degree (or arity) of a relation in relational database systems?
A particular number is written as 132 in radix-4 representation. The same number in radix-5 representation is ____________.
Consider the IEEE-754 single precision floating point numbers P=0xC1800000 and Q=0x3F5C2EF4.
Which one of the following corresponds to the product of these numbers (i.e., P $$\times$$ Q), represented in the IEEE-754 single precision format?