A Priority-Queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is given below: 10, 8, 5, 3, 2 Two new elements ”1‘ and ”7‘ are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the elements is:

A hash table contains 10 buckets and uses linear probing to resolve collisions. The key values are integers and the hash function used is key % 10. If the values 43, 165, 62, 123, 142 are inserted in the table, in what location would the key value 142 be inserted?

Let $${E_1}$$ and $${E_2}$$ be two entities in an E-R diagram with simple single-valued attributes, $${E_1}$$ and $${E_2}$$ are two relationships between $${E_1}$$ and $${E_2}$$, Where $${E_1}$$ is one-to-many and $${E_2}$$ is many-to-many. $${E_1}$$ and $${E_2}$$ do not have any attributes of their own. What is the minimum number of tables required represent this situation in the relation model?

The following table has two attributes $$A$$ and $$C$$ where $$A$$ is the primary key and $$C$$ is the foreign key referencing $$A$$ with on-delete cascade.

The set of all tuples that must be additionally deleted to preserve referential integrity. When the tuple $$(2,4)$$ is deleted is: