Question 1
Consider the following three relations in a relational database. Employee (eId, Name ), Brand (bId, bName), Own (eId, bId ) Which of the following relational algebra expressions return the set of eIds who own all the brands?
Question 4
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 3rd largest element of the tree is stored at index_____________.
Question 5
Consider the augmented grammar with { + , *, (, ), id } as the set of terminals.
S [Tex]\to[/Tex] SS [Tex]\to[/Tex] S + R | RR [Tex]\to[/Tex] R* P| PP [Tex]\to[/Tex] (S) | id
If I0 is the set of two LR(0) items {[S` ⇢ S.], [S ⇢ S. +R]}, then goto(closure(I0), +) contains exactly __________ items.
Question 6
Consider a simple undirected graph of 10 vertices. If the graph is disconnected, then the maximum number of edges it can have is ____________.
Question 7
Consider a relation R(A, B, C, D, E,) with the following three functional dependencies.
Question 8
The number of arrangements of six identical balls in three identical bins is______.
Question 9
A cache memory that has a hit rate of 0.8 has an access latency 10 ns and miss penalty 100 ns. Optimization is done on the cache to reduce the miss rate. However, the optimization results in an increase of cache access latency to 15 ns, whereas the miss penalty is not affected. The minimum hit rate (rounded off to two decimal places) needed after the optimization such that it should not increase the average memory access time is _____________.
There are 65 questions to complete.