GATE CSE 2001
Q22.
A CPU has two modes-privileged and non-privileged. In order to change the mode from privileged to non-privilegedQ23.
R,(A,B,C,D) is a relation. Which of the following does not have a lossless join, dependency preserving BCNF decomposition ?Q26.
What is the minimum number of stacks of size n required to implement a queue to size n ?Q27.
Consider the following two statements : S1: {0^{2n}|n\geq 1|} is a regular language S2 : {0^{m}1^{n}0^{m+n}|m\geq 1 and n\geq 1|} is a regular language Which of the following statements is correct?Q28.
Consider the following languages : L1 = {ww| w\in {a,b}*} L2 = {ww^{R}| w\in {a,b} *, w^{R} is the reverse of w} L3 = {0^{2i}| i is an integer} L4 ={0^{{i}^{2}} | i is an integer} Which of the languages are regular ?Q29.
Suppose the adjacency relation of vertices in a graph is represented in a table Adj(X,Y). Which of the following queries cannot be expressed by a relational algebra expression of constant length ?Q30.
Let r and s be two relations over the relation schemes R and S respectively, and let A be an attribute in R. Then the relational algebra expression \sigma _{A=a}(r\Join s) is always equal to :