Concept Simplifiers

Which of the following is a sequential circuit?
a). Multiplexer
b). Demultiplexer
c). Counter
d). Full Adder

Consider the grammar S→(S)/a , Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n_1,n_2,and n_3respectively, Which of the following relationship holds?
A. n_1

Which of the following denotes Chomskianhiearchy?

REG ⊂ CFL ⊂ CSL ⊂ type0
CFL ⊂ REG ⊂ type0 ⊂ CSL
CSL ⊂ type0 ⊂ REG ⊂ CFL
CSL ⊂ CFL ⊂ REG ⊂ type0

Limited Seats for UGC-NET (Computer Sc. & App.) Book your seat now for 17th July-2016 batch! Please drop your contact number or mail id, http://www.conceptsimplifiers.com/ will contact to assist you. For more info: +919540160477/+919205024025

Concept Simplifiers - Home

Recursively enumerable languages are not closed under complementation
Q.4: Suppose the letter a, b, c, d, e has probabilities 1/2 ,1/4 ,1/8 ,1/16 ,1/32respectively, which of the following is the Huffman code for the letters a, b, c, d, e?
A. 0, 10, 110, 1110, 11110
B. 11, 10, 011, 010, 001
C. 11, 10, 01, 001, 0001
D. 110, 100, 010, 000, 001