Blog: CS402 Final term 2

Question No. 1
For a given input, it provides the compliment of Boolean AND output.
                NAND box (NOT AND)
                DELAY box
                OR box
                AND box


Question No. 2
It delays the transmission of signal along the wire by one step (clock pulse).
                NAND box (NOT AND)
                DELAY box
                OR box
                AND box


Question No. 3
For the given input, it provides the Boolean OR output
                NAND box (NOT AND)
                DELAY box
                OR box
                AND box


Question No. 4
For the given input, AND box provides the Boolean AND output.
                True
                False


Question No. 5
The current in the wire is indicated by 1 and 0 indicates the absence of the current.
                True
                False


Question No. 6
Any language that can not be expressed by a RE is said to be regular language.
                True
                False


Question No. 7
If L1 and L2 are regular languages is/are also regular language(s).
                L1 + L2
                L1L2
                L1*
                All of above


Question No. 8
Let L be a language defined over an alphabet Σ, then the language of strings, defined over Σ, not belonging to L, is called Complement of the language L, denoted by Lc or L’.
                True
                False


Question No. 9
To describe the complement of a language, it is very important to describe the ----------- of that language over which the language is defined.
                Alphabet
                Regular Expression
                String
                Word

Question No. 10
For a certain language L, the complement of Lc is the given language L i.e. (Lc)c = Lc
                True
                False


Question No. 11
If L is a regular language then, --------- is also a regular language.
                Lm
                Ls
                Lx
                Lc

Question No. 12
Converting each of the final states of F to non-final states and old non-final states of F to final states, FA thus obtained will reject every string belonging to L and will accept every string, defined over Σ, not belonging to L. is called
                Transition Graph of L
                Regular expression of L
                Complement of L
                Finite Automata of L


Question No. 13
If L1 and L2 are two regular languages, then L1 U L2 is not a regular.
                True
                False