April 20, 2024

GATE 1991

Question 14 If the longest chain in a partial order is of length n then the partial order can be written as a ______ of n antichains. […]
April 20, 2024

Question 7918 – Theory-of-Computation

Consider the language L given by the regular expression (a+b)*b(a+b) over the alphabet {a,b}. The smallest number of states needed in deterministic finite-state automation (DFA) accepting […]
April 20, 2024

Question 8118 – Theory-of-Computation

The number of states in the minimum sized DFA that accepts the language defined by the regular expression (0+1)*(0+1)(0+1)*is_________. Correct Answer: A Question 15 Explanation:  The […]
April 21, 2024

Binary-Trees

Question 1 Prove by the principal of mathematical induction that for any binary tree, in which every non-leaf node has 2 descendants, the number of leaves […]
error: <b>Alert: </b>Content selection is disabled!!