List of top Computer Science & Information Technology Questions

What is the solution for the problem of external fragmentation?

A solution to the critical section problem should satisfy three requirements. Choose the correct set from the following: \[ \text{I. Mutual Exclusion} \] \[ \text{II. Progress} \] \[ \text{III. Hold and Wait} \] \[ \text{IV. Circular Wait} \] \[ \text{V. Bounded Waiting} \]

Which among the following is a light weight process?

In which one of the following modes, the hardware allows privileged instruction to be executed?

Which page replacement algorithm suffers with Belady's anomaly?

Choose the correct statements about fork and vfork system calls. Statement-I: vfork is faster than fork. Statement-II: fork is safer than vfork. Statement-III: vfork shares parent's memory, fork copies memory.

Which CPU scheduling algorithm uses time quantum for processes?

The output of code generation is usually

The control link in an activation record points to

Which one of the following is prefix representation of the infix expression \(P*(Q+R)/S\)?

Which technique replaces a sequence of instructions with a faster one?

If the value of an attribute is obtained from its children, then it is called

Which addressing mode provides the fastest access?

The language \(L=\{0^n1^n2^n\mid n\ge0\}\) is a

Which of the following parser is most powerful?

Given a TM \(M\), a state \(q\), and input \(w\), determine whether computation of \(M\) on \(w\) ever visits state \(q\).

Consider the following Syntax Directed Translation Scheme, with non-terminals \(\{S,A\}\) and terminals \(\{a,b\}\):

The output printed by a bottom-up parser for the input \(aab\) is

A compiler which runs on one machine and produces target code for another machine is called as

The number of internal states of a Universal Turing Machine should be at least

For the grammar \[ E\rightarrow E*F\;|\;F+E\;|\;F \] \[ F\rightarrow F-F\;|\;id \] Which statement is true?

Which among the following cannot be accepted by a regular grammar?

Which of the following regular expressions denote a language comprising all possible strings of even length over the alphabet \(\{0,1\}\)?

The minimum number of productions required to produce a language consisting of palindrome strings over \(\Sigma=\{a,b\}\) is

Suppose a language \(L_1\) has 2 states and \(L_2\) has 2 states. After using the cross product construction method, we have a machine \(M\). The total number of states in \(M\) are

Which language can be accepted by a PDA but not by an FA?