Consider a binary tree $$T$$ that has $$200$$ leaf nodes. Then, the number of nodes in $$T$$ that have exactly two children are ________.

The result evaluating the postfix expression $$10\,\,5\, + 60$$ $$\,\,6/\, * \,8\, - $$ is

Consider the following relation
$$\,\,\,\,\,\,\,\,$$ Cinema(theater, address, capacity)
Which of the following options will be needed at the end of the $$SQL$$ query

$$\,\,\,\,\,\,\,\,$$ SELECT $$P1.$$address
$$\,\,\,\,\,\,\,\,$$ FROM Cinema $$P1$$

such that it always finds the addresses of theaters with maximum capacity?

Consider a B⁺ tree in which the search key is 12 bytes long, block size is 1024 bytes, record pointer is 10 bytes long and block pointer is 8 bytes long. The maximum number of keys that can be accommodated in each non-leaf node of the tree is ____.