As you have asked for the Defence Research and Development Organization (DRDO) Computer Science (CS) paper, I am providing you with it, check below for the details
Which of the following regular expressions describes the language- the set of all strings over {0, 1} containing at least two 1’s?

A. (0+1)*11(0+1)*
B. 0*110*
C. 0*10*10*
D. (0+1)*1(0+1)*1(0+1)*

2. Which of the following is / are regular language(s) ?

I. { am
II. {w {a, b}*| has equal number of a’ s and b’ s}
III. {am
IV. {w {a , b}* w has even number of a’ s}

A. Only
B. And only
C. And only
D. Only

3. Which of the following is true?

A. For every NFA there is an equivalent PDA.
B. Nondeterministic TMs are more powerful than deterministic TMs.
C. DPDAs and NPDAs are equivalent in power.
D. NFAs accept the class of CFLs.

DRDO CS Paper






For more details, you can refer to the attached file;

Attached Files

DRDO CS Paper.pdf (88.2 KB, 58 views)