My Courses

1. Which of the following are basic complexity classes for a function f:N->N? a) Ntime(f) b) Nspace(f) c) Space(f) d) All of the mentioned 2. In order to reduce the run time of a turing machine: a) we can reduce the number of tapes b) we can increase the number of tapes c) use infinite…

1. The minimum number of states required to recognize an octal number divisible by 3 are/is a) 1 b) 3 c) 5 d) 7 2. Statement 1: Null string is accepted in Moore Machine. Statement 2: There are more than 5-Tuples in the definition of Moore Machine. Choose the correct option: a) Statement 1 is…

1. What kind of expressions do we used for pattern matching? a) Regular Expression b) Rational Expression c) Regular & Rational Expression d) None of the mentioned 2. Which of the following is true? a) (01)*0 = 0(10)* b) (0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)* c) (0+1)*01(0+1)*+1*0* = (0+1)* d) All of the mentioned 3. Generate the regular…

1. Which of the following conversion is not feasible? a) Regular expression to automaton conversion b) Automaton to Regular Expression Conversion c) NFA to DFA d) None of the mentioned 2. Which of the following are decision properties? a) Emptiness b) Infiniteness c) Membership d) All of the mentioned 3. If L1 and L2 are…

1. Which of the following options is correct? Statement 1: Initial State of NFA is Initial State of DFA. Statement 2: The final state of DFA will be every combination of final state of NFA. a) Statement 1 is true and Statement 2 is true b) Statement 1 is true and Statement 2 is false…

1. XML is a _________ markup language. a) meta b) beta c) octa d) peta 2. Which of the following are always unambiguous? a) Deterministic Context free grammars b) Non-Deterministic Regular grammars c) Context sensitive grammar d) None of the mentioned 3. Which of the following allows stacked values to be sub-stacks rather than just…

1. If L1, L2 are regular and op(L1, L2) is also regular, then L1 and L2 are said to be ____________ under an operation op. a) open b) closed c) decidable d) none of the mentioned 2. Suppose a regular language L is closed under the operation halving, then the result would be: a) 1/4…

1. Which of the following is not a notion of Context free grammars? a) Recursive Inference b) Derivations c) Sentential forms d) All of the mentioned 2. State true or false: Statement: The recursive inference procedure determines that string w is in the language of the variable A, A being the starting variable. a) true…

1. Under which of the following operation, NFA is not closed? a) Negation b) Kleene c) Concatenation d) None of the mentioned 2. The space complexity of a turing machine is undefined if: a) It is a multitape turing machine b) If no string of length n causes T to use infinite number of tape…