Consider a hash table of size 11 that uses open addressing with linear probing. Let h(k) = k mod 11 be the hash function used. A sequence of records with keys

43 36 92 87 11 4 71 13 14 is inserted into an initially empty hash table, the bins of which are indexed from zero to ten. What is the index of the bin into which the last record is inserted?

Consider the following $$ER$$ diagram

The minimum number of table needed to represent $$M,$$ $$N,$$ $$P, R1, R2$$ is

Consider the following $$ER$$ diagram

Which of the following is a correct attribute set for one of the tables for the correct answer to the above question?

Consider the following relational schemes for a library database. Book ( Title, Author, Catalog_ no, Publisher, Year, Pr ice ) Collection ( Title, Author, Catalog no )
With in the following functional dependencies:
$${\rm I}.\,\,\,\,\,\,$$ Title Author $$ \to $$ Catalog_no
$${\rm II}.\,\,\,\,$$ Catalog_no $$ \to $$ Title Author Publisher Year
$${\rm III}.\,\,\,\,$$ Publisher Title Year $$ \to $$ Price

Assume { Author, Title } is the key for both schemes. Which of the following statements is true?