PGECET CSE Question Paper

Will you please provide the Computer Science Engineering Question Paper of PGECET exam ?

[Kiran Chandar]

Here I am providing the list of few questions of Computer Science Engineering Question Paper of PGECET exam which you are looking for .

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)*

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.

Which of the following is / are regular language(s) ?
I. { ambn | m , n ≥0}
II. {w є {a, b}*| has equal number of a’ s and b’ s}
III. {ambn | m>n}
IV. {w є {a , b}* w has even number of a’ s}
A. Only
B. And only
C. And only
D. Only

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.

Which of the following is NOT POSSIBLE?
A. Finding out a minimal DFA for any arbitrary regular language.
B. Constructing a deterministic TM for any arbitrary CFL.
C. Determining whether two CFGs generate the same language.
D. Given an arbitrary TM M (which halts on all inputs) whether the
complement of the language accepted by M is recursive.

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
intersection.
2:34:34 AM 5/16/2009 DRDO CS PAPER 2008
FOR DRDO SET 2009 ORKUT COMMUNITY

Which of the following is FALSE?
A. Regular expressions and DFAs are equivalent.
B. A DPDA cannot accept by any arbitrary CFL.
C. The language accept by any TMs is a CFL.
D. Complement of every regular language is CFL.

Let A and B be languages corresponding to two decision problems πA and πB
respectively. Let A be NP – complete problem, then hat would not B NP.
Which of the following is true?
A. B is NP- complete
B. A proportional p B
C. B proportional p A
D. None of the above.

Consider the languages L1 and L2 given below.
L1= {<M1, M2>| M1 and M2 are NFAs and L (M1 )= L (M2)}
L2= {<M1, M2>| M1 and M2 are TMs and L (M1 )= L (M2)}
Which of the following is true?
A. L1 is undecidable but L2 is decidable.
B. L2 is undecidable but L1 is decidable.
C. Both L1 and L2 are undecidable.
D. Both L1 and L2 are decidable.