ENGLISH
Computation & Compilers: Theory
Practice Session on TOC - Language and Grammar through PYQs
In this Class We will Solve the PYQs of GATE and NET to identify Regular, Context Free, Context Sensitive and Recursively Enumerable languages and Grammar. This Class will be helpful for aspirants preparing for NTA UGC NET and GATE Computer Science. Learners at any stage of their preparation will be benefited by the class. The class will be covered in English and the notes will be provided in English.
Mar 15, 2020 • 1h 3m
Priyanka Chatterjee