Consider the NFA M shown below:

Let the language accepted by M be L. Let L₁ be the language accepted by NFA M₁, obtained by changing the accepting state of M to a non - accepting state and by changing the non - accepting state of M to accepting states. Which of the following statements is true?

Which of the following scenarios may lead to an irrecoverable error in a database system?

What happens when a primary key is combined with a foreign key?

The first element in T [5, 4] is

Consider the set of relations shown below and the SQL query that follows: Students: (Roll_ number, Name, Date_ of_ birth) Courses: (Course_ number, Course_ name, instructor) Grades: (Roll_ number, Course_number, grade) Select distinct name from students, courses, Grades where students. Roll_number = Grades. Roll_number and Courses. Instructor = Korth Courses. Courses_ number = Grades Courses_ number and Grades. grade = A

Which of the following sets is computed by the above query?

Which of the following does the database administrator coordinate?

A relational database, which is in 3NF, may have undesirable data redundancy because there may exist

Consider two languages $L_1$ and $L_2$ each on the alphabet $\Sigma$. Let $f : \Sigma^* → \Sigma^*$ be a polynomial time computable bijection such that $(\forall x) [ x\in L_1$ iff $f(x) \in L_2]$. Further, let $f^{-1}$ be also polynomial time computable.

Which of the following CANNOT be true?

Bit rate for transmitting compressed VGA colour, with 7 bits/pixel at 40 frames/sec, is

The following resolution rule is used in logic programming. Derive clause (P ∨ Q) from clauses (P ∨ R), (Q ∨ ¬R) Which of the following statements related to this rule is FALSE?

Which of the following definitions does not generate the same language as L? L = {XnYn, n $\ge$ 1} I. E $\rightarrow$ XEY | XY II. XY | X + XYY+ III. X + Y +

Which of the following relationship calculus-expressions is not safe?

Consider a relation geq, which represents “greater than or equal to”, i.e. (x, y)$\in$ geq only if y > = x. Create table geq: ( lb integer not null ub integer not null primary key lb foreign key (ub) references geq on delete cascade )

If a tuple (x, y) is deleted, which of the following is possible?

These are five records in a data base:

There is an index file associated with this and it contains the values: 1, 3, 2, 4. Which of the following fields is the index built form?

Given relations: $\gamma$ (w, x) and S (y, z), the result of select distinct w, x. From r, S is guaranteed to be the same as $\gamma$, empty. Which among the following is correct?