CS402 Quiz 4

Q1. The length of output string in case of _________ is one more than the length of corresponding input string.

1. Adding Machine
2. Moore machine
3. Incremental machine
4. Mealy machine

Correct answer: Moore machine

Q2. The language L defined over Σ, not belonging to L, is called _______ of the language L.

1. intersection
2. closure
3. union
4. complement

Correct answer: complement

Q3. For a given Moore Machine, the input string is '101010', thus the output string would be of length:

1. Length of input string - 2
2. Length of input string + 2
3. Length of input string + 1
4. Length of input string - 1

Correct answer: Length of input string + 1

Q4. Which of the following is a non-regular language?

1. Prime
2. Even-Even
3. Language of strings ending in abba
4. Odd-Odd

Correct answer: Prime

Q5. If a language generates finite number of distinct classes then it must be _____________.

1. both regular and context free
2. non-regular
3. context free
4. regular

Correct answer: regular

Q6. In pref(Q in R), Q is _______ to/than R.

1. Greater
2. Smaller
3. Equal
4. Not equal

Correct answer: Greater

Q7. If new A =1 NAND ( 1 AND 1), then what will be the value of new A?

1. 1
2. 0
3. 10
4. 01

Correct answer: 0

Q8. In Moore machine, output is produced over the change of:

1. None of the mentioned
2. Transitions and states
3. States
4. Transitions

Correct answer: States

Q9. The operators like (* , +) in the parse tree are considered as ________.

1. terminals
2. productions
3. non-terminals
4. intermediates

Correct answer: non-terminals

Q10. In polish notation, (o-o-o) is the abbreviation of _________.

1. Operator - Operand – Operand
2. Operand - Operator – Operand
3. Operand - Operand - Operator
4. Operand - Operand – Operand

Correct answer: Operator - Operand – Operand