Q.No.1

Which of the following is NOT a type of finite automaton?

Q.No.2

In a DFA, each state has exactly one transition for each input symbol.

Q.No.3

The pumping lemma for regular languages is used to:

Q.No.4

The regular expression (a|b)* represents:

Q.No.5

Which of the following is NOT a regular language?

Q.No.6

State minimization in DFA is done to:

Q.No.7

Which of the following is true about NFAs and DFAs?

Q.No.8

Which of the following can recognize the language {a^n b^n | n ≥ 1}?

Q.No.9

A context-free grammar is ambiguous if:

Q.No.10

Which parsing technique builds the parse tree from bottom to top?


About Simple Quiz

We're here to make learning fun and accessible. Whether you're a student, teacher, or just someone who loves quizzes, you can find something for you here. Test your knowledge across a wide range of subjects and see how much you know!


Get to know more

Quiz On

Quiz on Theory of Computation and Computer Graphics for NEC Registration Exam, covering fundamental computational models and graphics principles essential for computer engineers.

Category

Prepare for the Nepal Engineering Council License Exam with comprehensive quizzes on Computer Engineering.


Computer Engineering

Sector

Enhance your readiness for the Nepal Engineering Council License Exam with specialized preparation resources.


Nepal Engineering Council Registration Examination


Start A Quiz

Do you want to start quiz mode? In this mode, you’ll answer against a timer. When the timer runs out, answers auto-submit, and you get feedback.

Start A Quiz

Do you want to start quiz mode? You'll answer against a timer. When the timer runs out, answers auto-submit