UGC-NET | UGC NET CS 2018 July – II | Question 35
To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:
(A) 2n – 1
(B) 2n
(C) n + 1
(D) n 2
Answer: (A)
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post
Recommended Posts:
- UGC-NET | UGC NET CS 2018 July - II | Question 98
- UGC-NET | UGC NET CS 2018 July - II | Question 87
- UGC-NET | UGC NET CS 2018 July - II | Question 50
- UGC-NET | UGC NET CS 2018 July - II | Question 7
- UGC-NET | UGC NET CS 2018 July - II | Question 11
- UGC-NET | UGC NET CS 2018 July - II | Question 12
- UGC-NET | UGC NET CS 2018 July - II | Question 13
- UGC-NET | UGC NET CS 2018 July - II | Question 14
- UGC-NET | UGC NET CS 2018 July - II | Question 15
- UGC-NET | UGC NET CS 2018 July - II | Question 6
- UGC-NET | UGC NET CS 2018 July - II | Question 5
- UGC-NET | UGC NET CS 2018 July - II | Question 82
- UGC-NET | UGC NET CS 2018 July - II | Question 1
- UGC-NET | UGC NET CS 2018 July - II | Question 2
- UGC-NET | UGC NET CS 2018 July - II | Question 3
