DRDO Exam Papers For Computer Science PDF

Hello sir, I am Lokesh kumar. I am form Bhopal. I want you to help me by providing me with the Defence Research Development Organization (DRDO) exam paper for Computer Science. Can you help me?

[Pathak]

As you have asked for the Defence Research Development Organization (DRDO) exam paper for Computer Science, I am providing you with it, check below for the details
1. 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.

4. Let L be a CFL. Then L’ must be
A. CFL but not regular.
B. Recursive.
C. Recursively Enumerable but not Recursive.
D. Regular but not CFL.

5. Which of the following is FALSE?
A. CFLs are closed under union but not closed under complement.
B. Regular sets are closed under intersection and Kleene Closure.
C. Recursive languages are closed under intersection but not closed under complement.
D. Recursively enumerable languages are closed under union and
DRDO CS exam paper



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