1
GATE CSE 1994
MCQ (Single Correct Answer)
+2
-0.6
The number of sub-strings (of all lengths inclusive) that can be formed from a character string of length $$n$$ is
2
GATE CSE 1994
Fill in the Blanks
+2
-0
The regular expression for the language recognized by the finite state automation of is _________.
3
GATE CSE 1992
MCQ (Single Correct Answer)
+2
-0.6
If $$G$$ is a context-free grammar and $$w$$ is a string of length $$n$$ in $$L(G),$$ how long is a derivation of $$w$$ in $$G,$$ if $$G$$ is Chomsky normal form?
4
GATE CSE 1992
MCQ (Single Correct Answer)
+2
-0.6
Which of the following regular expression identities are true?
GATE CSE Subjects
Browse all chapters by subject
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages