The following deterministic finite automata recognizes: (A) Set of all strings containing ‘ab’ (B) Set of all strings containing ‘aab’ (C) Set of all strings ending in ‘abab’ (D) None of the above Answer: D Depth ion travels of the following directed graph is: (A) ABCDEF (B) ABDEFC (C) ACEBDF […]
Which of the following strings is in the language defined by grammar S→0A, A→1A/0A/1 (A) 01100 (B) 00101 (C) 10011 (D) 11111 Answer: B For a complete graph with N vertices, the total number of spanning trees is given by: (A) 2N-1 (B) NN-1 (C) NN-2 (D) 2N+1 Answer: C […]
T is a graph with n vertices. T is connected and has exactly n-1 edges, then: (A) T is a tree (B) T contains no cycles (C) Every pairs of vertices in T is connected by exactly one path (D) All of these Answer: D If the proposition 7P⇒Q is […]
Which of the following is not true? (A) Power of deterministic automata is equivalent to power of non-deterministic automata. (B) Power of deterministic pushdown automata is equivalent to power of non-deterministic pushdown automata. (C) Power of deterministic Turing machine is equivalent to power of non-deterministic Turing machine. (D) All the […]
PAGES: 1 2 3 4 5 AVA = A is called: (A) Identity law (B) De Morgan’s law (C) Idempotent law (D) Complement law Answer: C Explanation 1. Commutative Laws: For any two finite sets A and B; (i) A U B = B U A (ii) A ∩ B […]
1. Consider a sequence F00 defined as: Then what shall be the set of values of the sequence F00? (a) (1, 110, 1200) (b) (1, 110, 600, 1200) (c) (1, 2, 55, 110, 600, 1200) (d) (1, 55, 110, 600, 1200) F00(2) = (10*F00(1) + 100)/ F00(0) […]
