TOC PRACTICE QUESTIONS CFG AND PDA

TOC PRACTICE QUESTIONS CFG AND PDA

University

21 Qs

quiz-placeholder

Similar activities

FIRST QUIZ - INTRO TO COMPUTER TROUBLESHOOTING

FIRST QUIZ - INTRO TO COMPUTER TROUBLESHOOTING

University

20 Qs

Intoduccion a Excel

Intoduccion a Excel

University

20 Qs

Kiểm tra Chương I + II + III

Kiểm tra Chương I + II + III

6th Grade - University

20 Qs

Gerência do Processador

Gerência do Processador

University

16 Qs

Primera parcial QoS

Primera parcial QoS

University

20 Qs

tableur

tableur

University

18 Qs

ITMajor1 & IntroSoftEng- Prelim Examination

ITMajor1 & IntroSoftEng- Prelim Examination

University

20 Qs

TOC PRACTICE QUESTIONS CFG AND PDA

TOC PRACTICE QUESTIONS CFG AND PDA

Assessment

Quiz

Computers

University

Hard

Created by

Shital Gupta

Used 9+ times

FREE Resource

21 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The transition a Push down automaton makes is additionally dependent upon the:

a) stack


b) input tape

c) terminals

d) none of the mentioned

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

 A PDA machine configuration (p, w, y) can be correctly represented as:



a) (current state, unprocessed input, stack content)

b) (unprocessed input, stack content, current state)

c) (current state, stack content, unprocessed input)

d) none of the mentioned

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

With reference of a DPDA, which among the following do we perform from the start state with an empty stack?



a) process the whole string

b) end in final state

c) end with an empty stack

d) all of the mentioned

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In a DPDA, which of the following statements is true?


a) Each state can have at most one transition for each input symbol

b) A state can have multiple transitions for the same input symbol

c) There can be multiple states with no outgoing transitions


d) None of the mentioned

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is a simulator for non deterministic automata?




a) JFLAP

b) Gedit

c) FAUTO

d) None of the mentioned

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The production of the form A->B , where A and B are non terminals is called


c


a) Null production

b) Unit production

) Greibach Normal Form

d) Chomsky Normal Form

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Inorder to simplify a context free grammar, we can skip the following operation:

Removal of null production

Removal of useless symbols

Removal of unit productions

None of the mentioned

Create a free account and access millions of resources

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?