Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Tests  >  Test: Theory of Computation - 2 - Computer Science Engineering (CSE) MCQ

Test: Theory of Computation - 2 - Computer Science Engineering (CSE) MCQ


Test Description

15 Questions MCQ Test - Test: Theory of Computation - 2

Test: Theory of Computation - 2 for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Test: Theory of Computation - 2 questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Theory of Computation - 2 MCQs are made for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Theory of Computation - 2 below.
Solutions of Test: Theory of Computation - 2 questions in English are available as part of our course for Computer Science Engineering (CSE) & Test: Theory of Computation - 2 solutions in Hindi for Computer Science Engineering (CSE) course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Theory of Computation - 2 | 15 questions in 45 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
Test: Theory of Computation - 2 - Question 1

The minimum number of states required to recognize an octal number divisible by 3 are/is

Detailed Solution for Test: Theory of Computation - 2 - Question 1

According to the question, minimum of 3 states are required to recognize an octal number divisible by 3.

Test: Theory of Computation - 2 - Question 2

If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is ______________

Detailed Solution for Test: Theory of Computation - 2 - Question 2

A Compiler is used to give a finite solution to an infinite phenomenon. An example of an infinite phenomenon is Language C, etc.

1 Crore+ students have signed up on EduRev. Have you? Download the App
Test: Theory of Computation - 2 - Question 3

Given: ∑= {a, b}
L= {xϵ∑*|x is a string combination}
∑4 represents which among the following?

Detailed Solution for Test: Theory of Computation - 2 - Question 3

∑* represents any combination of the given set while ∑x represents the set of combinations with length x where x ϵ I.

Test: Theory of Computation - 2 - Question 4

Moore Machine is an application of:

Detailed Solution for Test: Theory of Computation - 2 - Question 4

Finite automaton with output is categorized din two parts: Moore M/C and Mealy M/C.

Test: Theory of Computation - 2 - Question 5

For a give Moore Machine, Given Input=’101010’, thus the output would be of length:

Detailed Solution for Test: Theory of Computation - 2 - Question 5

Initial state, from which the operations begin is also initialized with a value.

Test: Theory of Computation - 2 - Question 6

The output alphabet can be represented as:

Detailed Solution for Test: Theory of Computation - 2 - Question 6

The tuple definition of Moore and mealy machine comprises one new member i.e. output alphabet as these are finite machines with output.

Test: Theory of Computation - 2 - Question 7

Which of the following is a correct statement?

Detailed Solution for Test: Theory of Computation - 2 - Question 7

Statement a and b is correct while c is false. Finite machines with output have no accepting states and can be converted within each other.

Test: Theory of Computation - 2 - Question 8

Which of the given are correct?

Detailed Solution for Test: Theory of Computation - 2 - Question 8

Finite Automaton with Output has a common definition for both the categories.

Test: Theory of Computation - 2 - Question 9

The ratio of number of input to the number of output in a mealy machine can be given as:

Detailed Solution for Test: Theory of Computation - 2 - Question 9

The number of output here follows the transitions in place of states as in Moore machine.

Test: Theory of Computation - 2 - Question 10

The major difference between Mealy and Moore machine is about:

Detailed Solution for Test: Theory of Computation - 2 - Question 10

Mealy and Moore machine vary over how the outputs depends on prior one (transitions) and on the latter one(states).

Test: Theory of Computation - 2 - Question 11

Which of the following not an example Bounded Information?

Detailed Solution for Test: Theory of Computation - 2 - Question 11

Bounded information refers to one whose output is limited and it cannot be said what were the recorded outputs previously until memorized.

Test: Theory of Computation - 2 - Question 12

A DFA cannot be represented in the following format

Detailed Solution for Test: Theory of Computation - 2 - Question 12

A DFA can be represented in the following formats: Transition Graph, Transition Table, Transition tree/forest/Any programming Language.

Test: Theory of Computation - 2 - Question 13

When are 2 finite states equivalent?

Detailed Solution for Test: Theory of Computation - 2 - Question 13

Two states are said to be equivalent if and only if they have same number of states as well as transitions.

Test: Theory of Computation - 2 - Question 14

Which of the following is not an example of finite state machine system?

Detailed Solution for Test: Theory of Computation - 2 - Question 14

Proper and sequential combination of events leads the machines to work in hand which includes The elevator, Combinational Locks, Traffic Lights, vending machine, etc. Other applications of Finite machine state system are Communication Protocol Design, Artificial Intelligence Research, A Turnstile, etc.

Test: Theory of Computation - 2 - Question 15

The complement of a language will only be defined when and only when the __________ over the language is defined.

Detailed Solution for Test: Theory of Computation - 2 - Question 15

It is not possible to define the complement of a language without defining the input alphabets. Example: A language which does not consist of substring ‘ab’ while the complement would be the language which does contain a substring ‘ab’.

Information about Test: Theory of Computation - 2 Page
In this test you can find the Exam questions for Test: Theory of Computation - 2 solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Theory of Computation - 2, EduRev gives you an ample number of Online tests for practice

Top Courses for Computer Science Engineering (CSE)

Download as PDF

Top Courses for Computer Science Engineering (CSE)