Recent questions tagged goclasses-cs-dpp-day-382

Consider$\mathrm{STUDENT}(\mathrm{name},\mathrm{regno},\mathrm{gpa},\mathrm{level},\mathrm{dept})$$\mathrm{COURSE}(\mathrm{cno},\mathrm{cname},\mathrm{dept})$$\mathrm{TAK...

Consider$\mathrm{Product}(\mathrm{pid},\mathrm{name},\mathrm{brand},\mathrm{price},\mathrm{color})$.The SQL query is:SELECT DISTINCT name FROM Product p WHERE color = 'gr...

Consider$\mathrm{Store}(\mathrm{sid},\mathrm{store\_name},\mathrm{parent\_company})$$\mathrm{Branch}(\mathrm{sid},\mathrm{city},\mathrm{open24})$$\mathrm{Has\_Fruit}(\mat...

Consider$\mathrm{Breeders}(\mathrm{brdr\_id},\mathrm{brdr\_name},\mathrm{age})$$\mathrm{Breeds}(\mathrm{br\_id},\mathrm{br\_name},\mathrm{friendliness})$$\mathrm{Pedigree...

Consider $\mathrm{Pets}(\mathrm{pid},\mathrm{pname},\mathrm{weight})$.Which TRC expression returns only the weights of all pets whose name is $\mathrm{Tiny}$?$\{t\mid \ex...

Let $M$ be a deterministic Turing machine. During a computation on input $w$, suppose $M$ enters exactly the same complete configuration at two different times before rea...

A deterministic Turing machine starts on a blank tape.Which of the following gives an example of a computation that runs forever without ever repeating exactly the same c...

Suppose $M$ recognizes a Turing-recognizable language $A$.Which statement is necessarily true?There must exist some $w\notin A$ on which $M$ loops forever. $M$ must loop ...

Let $L$ be any Turing-recognizable language.Which of the following is always possible?Construct a TM that accepts every $w\in L$ and loops forever on every $w\notin L$, n...

Consider the following deterministic Turing machine $M$ with input alphabet $\Sigma=\{a,b\}$What is $L(M)$?$\{w\in\{a,b\}^*\mid w\text{ ends in }a\}$ $\{w\in\{a,b\}^*\mid...