For the following questions answer them individually
The real-time operating system, which of the following is the most suitable scheduling scheme?
Consider Join of a relation R with a relation S. If R has m tuples and S has n tuples, then maximum and minimum sizes of the Join respectively are
Let R(a, b,c)and S(d,e, f) be two relations in which d is the foreign key of S that refers to the primary key of R Consider the following four operations in R and S
I.Insert into R
II.Insert into S
III.Deletion from R
IV.Deletion from S
Which of the following can cause violation of the relational integrity constraint above?
The relation book (title, price) contains the titles and prices of different books. Assuming that no two books have the same price, what does the following SQL query list?
[select title from book as B where (select count(*) from book as T where T.price > B.price) < 5]
Given the relations employee (name, salary, deptno) and department (depino, deptname, address)
Which of the following queries cannot be expressed using the basic relational algebra operations $$(U,-,x,\pi,\sigma,p)$$
The orderofa leaf node in a B+ tree is the maximum numberof (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long andablock pointeris 6 bytes long, what is the orderofthe leaf node?