List of practice Questions

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 addressing mode provides the fastest access?
The output of code generation is usually
Which technique replaces a sequence of instructions with a faster one?
The language \(L=\{0^n1^n2^n\mid n\ge0\}\) is a
The number of internal states of a Universal Turing Machine should be at least
Given a TM \(M\), a state \(q\), and input \(w\), determine whether computation of \(M\) on \(w\) ever visits state \(q\).
A compiler which runs on one machine and produces target code for another machine is called as
For the grammar \[ E\rightarrow E*F\;|\;F+E\;|\;F \] \[ F\rightarrow F-F\;|\;id \] Which statement is true?
Which of the following parser is most powerful?
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
Which of the following regular expressions denote a language comprising all possible strings of even length over the alphabet \(\{0,1\}\)?
The following CFG generates strings of terminals that have
Which language can be accepted by a PDA but not by an FA?
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 among the following cannot be accepted by a regular grammar?
The minimum number of productions required to produce a language consisting of palindrome strings over \(\Sigma=\{a,b\}\) is
What is the size of the set of all subsets of \(n\) elements in sum of subsets problem?
What is the cost of the minimum spanning tree of the below graph using Prim's algorithm?
Match the following algorithms with their worst-case time complexities.
Choose all design strategies to solve different types of knapsack problems?
Which sorting algorithm has the same time complexity for all the cases-best, average, worst?
The diagram given below refers to a non-deterministic finite state automaton that accepts the language having
Which data structure is used to find largest number in data streams?