Recent questions tagged goclasses

Consider,CREATE TABLE zoomers ( lecture_id INTEGER PRIMARY KEY, week INTEGER NOT NULL, topic VARCHAR(30) NOT NULL, num_thanks INTEGER, poppin_chat BOOLEAN );Assume,intege...

Consider the following statement:In fixed-length records, a character field of type $\mathrm{CHAR}$ is not allowed.Enter $1$ if the statement is true and $0$ if it is fal...

Consider,Universities( name TEXT, abbrev CHAR(3), addr TEXT, zip CHAR(5), phone TEXT, enrolled INTEGER )Assume,record header = $4$ bytes, integer = $4$ bytes, a $\mathrm{...

Which of the following are benefits of using a record header for variable-length records?Delimiter characters between fields are not required. It always uses equal or les...

Consider:CREATE TABLE products ( id INTEGER PRIMARY KEY, stock INTEGER NOT NULL, price INTEGER NOT NULL, name VARCHAR(10) NOT NULL, category CHAR(6) NOT NULL, serial_numb...

Suppose, $L=L_1\cap L_2$where $L_1$ is regular and $L_2$ is an arbitrary language.Using the same original classification categories, choose the strongest guaranteed class...

Let, $L=L_1-L_2$where $L_1$ is context-free and $L_2$ is regular.Choose the strongest language classification guaranteed by the information given.$L$ must be regular. $L$...

Consider the language:$$A_{TM}=\{\langle M,w\rangle\mid M\mathrm{\ is\ a\ TM\ that\ accepts\ }w\}$$Classify its complement, $\overline{A_{TM}}$, using one of the followin...

Which of the following statements is INCORRECT?The union of two recursive languages is recursive. According to the Church-Turing Thesis, Turing machines capture the compu...

Consider the following statements about automata and formal languages.Deterministic and nondeterministic finite automata accept the same class of languages. For every con...

Select all statements that are TRUE.The class of recursively enumerable languages is:Closed under union. Closed under intersection. Closed under complement. Closed under ...

Which of the following languages are Turing-recognizable? Select all that apply.$L=\{\langle M\rangle\mid M\mathrm{\ is\ a\ TM\ and\ }L(M)\mathrm{\ is\ finite}\}$ $L=\{\l...

Select all the true statements.Recognizable languages are closed under complement. Decidable languages are closed under complement. Recognizable languages are closed unde...

Let $TR(L)$ mean that language $L$ is Turing-recognizable.Consider the following statements about languages $L_1,L_2\subseteq\Sigma^*$.If $TR(L_1)$ and $TR(L_2)$, then $T...

Which of the following classes of languages is closed under union?Regular languages Context-free languages Recursive languages Recursively enumerable languages

A disk has cylinders $:0\mathrm{\ to\ }999$The current head position is $:253$Pending requests are:$$98,\ 120,\ 283,\ 137,\ 352,\ 414,\ 29,\ 665,\ 867,\ 919,\ 534,\ 737$$...

The designer of an operating system noticed, after performance measurements, that the system presented disk access problems, with a very high average waiting time. Select...

A disk contains $\mathbf{400}$ tracks, numbered : $0\mathrm{\ to\ }399$A request at track $200$ has just been completed. The head is now moving toward smaller track numbe...

The disk head is currently at track : $105$ and is moving toward larger track numbers.Pending requests are:$$35,\ 45,\ 12,\ 68,\ 110,\ 180,\ 170,\ 195$$If SCAN scheduling...

A magnetic-disk head is currently at cylinder : $100$Pending requests are:$120,\ 90,\ 70,\ 80,\ 140,\ 110,\ 60$The scheduling method follows these rules:requests may be r...

Which of the following statements about magnetic-disk arm scheduling is incorrect?FCFS handles requests according to arrival order and is considered fair, although it gen...

Consider the following statement:If disk requests are scheduled using SSTF, the seek time will increase compared with FCFS. Furthermore, the elevator algorithm is not rec...

A disk has $200$ tracks numbered $0$ through $199$.The disk head is currently at track $:184$Disk requests arrive for:$184,\ 187,\ 176,\ 182,\ 199$If SSTF scheduling is u...

Suppose a disk repeatedly services requests for one particular track while requests for other tracks remain unserved. This phenomenon is called disk-arm sticking.Which of...

Which disk scheduling algorithm selects the pending request requiring the smallest movement of the disk arm from its current position, thereby choosing the minimum seek t...

Below is a Venn diagram showing the overlap of different classes of languages. For the language given below, tell where in the Venn diagram that language belongs.$$FIN_{T...

Consider the following problems. Which of the following is decidable?Given two Turing machines $M$ and $N$, determine whether the encoded descriptions of $M$ and $N$ are ...

Consider the following statements:Every nondeterministic finite automaton can be simulated by a deterministic finite automaton. Every deterministic finite automaton can b...

Determine whether the following assertion is correct:"If a language $L$ and its complement $\overline{L}$ are both Turing-recognizable, then $L$ is decidable. "Enter $1$ ...

Let $TR(L)$ mean that $L$ is Turing-recognizable. For languages $L_1,L_2\subseteq\Sigma^*$, consider:If $TR(L_1)$ and $TR(L_2)$, then $TR(L_1\cup L_2)$. If $TR(L_1)$, the...