Computer Science Engineering (CSE)

Which of the following conversion is not possible (algorithmically)?

by
Question:

Which of the following conversion is not possible (algorithmically)?

A.

regular grammar to context-free grammar

B.

non-deterministic finite state automata to deterministic finite state automata

C.

non-deterministic pushdown automata to deterministic pushdown automata

D.

none deterministic turing machine to deterministic turing machine

Answer» b. non-deterministic finite state automata to deterministic finite state automata

Note: The above multiple-choice question is for all general and Competitive Exams in India. 

The transformed prefix paths of a node ‘a’ form a truncated database of pattern which co-occurwith a is called _______.

by
Question:

The transformed prefix paths of a node ‘a’ form a truncated database of pattern which co-occurwith a is called _______.

A.

suffix path.

B.

fp-tree.

C.

conditional pattern base.

D.

prefix path.

Answer» c. conditional pattern base.

Note: The above multiple-choice question is for all general and Competitive Exams in India. 

__________ clustering techniques starts with all records in one cluster and then try to split thatcluster into small pieces.

by
Question:

__________ clustering techniques starts with all records in one cluster and then try to split thatcluster into small pieces.

A.

agglomerative.

B.

divisive.

C.

partition.

D.

numeric.

Answer» b. divisive.

Note: The above multiple-choice question is for all general and Competitive Exams in India.