Explore topic-wise MCQs in Computer Science Engineering (CSE).

This section includes 55 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.

51.

If a Turing machine halts for each and every world of a language L and rejects other, then L is said to be

A. recursive enumerable
B. recursive
C. context free language
D. none of these
Answer» D. none of these
Discussion
52.

If Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be

A. recursive enumerable
B. recursive
C. context free language (cfl)
D. none of them
Answer» B. recursive
Discussion
53.

The language L = {anbnan n≥ 1} is recognized by

A. turing machine
B. 2 pushdown automata
C. post machine
D. all are correct
Answer» E.
Discussion
54.

A pushdown automata behaves like a Turing machine, when it has number of auxiliary/ memory.

A. 0
B. exectly 2
C. 2 or more
D. both exectly 2 or more are correct
Answer» D. both exectly 2 or more are correct
Discussion
55.

What is the reason behind a Turing machine is more powerful than finite state machine FSM?

A. turing machine head movement is continued to one direction.
B. turing machine head moment is in both directions i.e. left moment and right moment as well.
C. turing machine has capability remember arbitrary long sequence of input string.
D. all are correct.
Answer» D. all are correct.
Discussion