Suppose a binary search tree with 1000 distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with 0, the 3^rd largest element of the tree is stored at index ___________.

Consider the queues Q₁ containing four elements and Q₂ containing none (shown as the Initial State in the figure). The only operations allowed on these two queues are Enqueue (Q, element) and Dequeue (Q). The minimum number of Enqueue operations on Q₁ required to place the elements of Q₁ in Q₂ in reverse order (shown as the Final State in the figure) without using any additional storage is ______________.

In a relational data model, which one of the following statements is TRUE?

Consider the following three relations in a relational database.

Employee ( $$\underline {eld} $$ , Name), Brand ( $$\underline {bld} $$ , bName), Own ( $$\underline {eld} $$ , $$\underline {bld} $$)

Which of the following relational algebra expressions return the set of elds who own all the brands?