Home / Engineering / Discrete Mathematics / Question

M

Mr. Dubey • 51.43K Points
Coach 

Q.) A state from which a deterministic finite state automata can never come out is called a ____________.

(A) trape state
(B) starting symbol
(C) transition table
(D) transition diagram
Correct answer : Option (A) - trape state

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Discrete Mathematics

Q. Suppose you are building a SVM model on data X. The data X can be error prone which means that you should not trust any specific data point too much. Now think that you want to build a SVM model which has quadratic kernel function of polynomial degree 2 that uses Slack variable C as one of it’s hyper parameter.What would happen when you use very small C (C~0)?

Q. Describing some characteristics of a set of data by a general model is viewed as ____________

Q. Complete the following analogy:- Registers are to RAM’s as Cache’s are to

Q. The carry propagation can be expressed as .

Q. Which command is used to terminate all processes in your own system except the login shell?

Q. In rate monotonic scheduling algorithm Select one:

Q. ________________ is a special type of aggregation where parts are destroyed when the whole is destroyed.

Q. Commitments to unrealistic time and resource estimates may result in

Q. Which register is connected to the MUX?

Q. GRUB stands for ………