Jammu & Kashmir and Ladakh SET (JKSET/LASET) Theory of Computation and Compilers Previous Year Questions
Try the preview and open any solution for a worked explanation.
Jammu & Kashmir and Ladakh SET (JKSET/LASET) practice pack
The practice pack for Jammu & Kashmir and Ladakh SET (JKSET/LASET) is coming soon to LawMint.
Question 1
Given below are two statements, one labelled as Assertion (a) and the other labelled as Reason (r). Read the statements and choose the correct answer from the code given below:
Assertion (a): Turing machine is more powerful than PDA.
Reason (r): The Turing Machine has a more flexible form of memory than does the PDA.
Question 2
Given below are two statements :
Statement-I: Top down parsing is an attempt to find a leftmost derivation for an input string.
Statement-II: Top down parsing methods handle left recursive grammar efficiently.
Choose the most appropriate answer from the options given below:
Question 3
Which of the following is/are correct?
I. A language is context-free if and only if it is accepted by the PDA.
II. PDA is a finite automaton with push-down stack.
Question 4
Which two of the following four regular expressions are equivalent?
(i) (00)*( + 0)
(ii) (00)*
(iii) 0*
(iv) 0(00)*
Question 5
If strings of a language L can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true?
Question 6
The following diagram represents a finite state machine which takes as input a binary number from the least significant bit:

Which one of the following is True?
Question 7
S -> AC|CB, C ->aCb|, A ->aA|a, B ->Bb|b
In the correct grammar above, what is the length of the derivation (number of steps starting from S) to generate the string albm with l m?
Question 8
The regular expression (+0)(+1) refers to the set of strings/characters:
Question 9
Consider the following statements about the context-free grammar :
I. G is ambiguous.
II. G produces all strings with equal number of a’s and b’s.
III. G can be accepted by a deterministic PDA
Which combination below expresses all the true statements about G?
Question 10
In the two lists given below, List-I provides the list of peephole optimization techniques and List-II provides description/example of those techniques. Match the two lists and choose the correct answer from the code given below:
| List-I (Peephole Optimization Technique) | List-II (Description) |
|---|---|
| P Unreachable Code | 1. Y=Y*1 or Y=Y+0 |
| Q Reduction in Strength | 2. Jumps to conditional Jumps |
| R Algebraic simplification | 3. Replacing expensive operations by equivalent cheaper ones |
| S Flow of Control Optimization | 4. An unlabeled instruction immediately following an unconditional Jump |
| 5. Hardware instructions to implement certain specific operations |
Previous papers with Theory of Computation and Compilers questions
Jammu & Kashmir and Ladakh SET (JKSET/LASET) practice pack
The practice pack for Jammu & Kashmir and Ladakh SET (JKSET/LASET) is coming soon to LawMint.