Concept Simplifiers

Concept Simplifiers The Only Coaching Centre in India to Clear UGC-NET/ GATE in Computer Science in First Attempt.

21/07/2016

How many different equivalence relations with exactly three different equivalence classes are three on a set with five elements?
a) 10
b) 15
c) 25
d) 30

15/07/2016

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

09/07/2016

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?
n_1

01/07/2016

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

30/06/2016

Which of the following denotes Chomskianhiearchy?

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

30/06/2016

Which of the following statement is wrong?
A. Any regular language can be generated by a context-free grammar
B. Some non-regular languages cannot be generated by any CFG
C. the intersection of a CFL and regular set is a CFL
D. All non-regular languages can be generated by CFGs.

28/06/2016

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

24/06/2016

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

Limited Seats for UGC-NET (Computer Sc. & App.) Book your seat now for 17th July-2016 batch! Please drop your contact ...
23/06/2016

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

23/06/2016

Suppose the letter a, b, c, d, e has probabilities 1/2 ,1/4 ,1/8 ,1/16 ,1/32respectively, What is the Average length of the Huffman tree?
A. 3
B. 2.1875
C. 2.25
D. 1.781

21/06/2016

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

Address

Delhi
110035

Telephone

9540160477

Website

Alerts

Be the first to know and let us send you an email when Concept Simplifiers posts news and promotions. Your email address will not be used for any other purpose, and you can unsubscribe at any time.

Shortcuts

Share

Category