ALL GATE QUESTIONS SUBJECTWISE
×

Regular Language and Finite Automata

1 Mark Questions 2 Marks Questions 5 Marks Questions

Context Free Language and Pushdown Automata

1 Mark Questions 2 Marks Questions 5 Marks Questions

Contextsensitive Language And Turing Machine

1 Mark Questions 2 Marks Questions 5 Marks Questions

Undecidability

1 Mark Questions 2 Marks Questions




GATE 1989 Question - Marks 2

How many substring (of all length inclusive ) can be formed from a character string of length n? Assume all characters to be distinct. Prove your answer


Total 39 Questions



Share: