M

Mr. Dubey • 52.30K Points
Coach 

Q. Any given transition graph has an equivalent:

(A) regular
(B) DFSM (Deterministic Finite State Machine)
(C) NDFSM
(D) All of them
Correct : Option (D)

Share

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. Brooks’ view of the essence of software included

Q. The hexadecimal number ‘A0’ has the decimal value equivalent to

Q. print(m(row), end = " ")

Q. A ___________refers to a single unit of values.

Q. Data scrubbing is___________.

Q. What are common feature selection methods in regression task?

Q. Is it fine to call delete twice for a pointer? #include<iostream> using namespace std; int main() { int *ptr = new int; delete ptr; delete ptr;

Q. Critical information for top management is provided by ....... information system.

Q. This type of testing method attempts to find incorrect or missing functions, errors in data structures or external database access, interface errors,

Q. For a conditional statement p===>q, which of the following is incorrect.