# GATE 1989 Question - Marks 2

Total 39 Questions

GateQuestions

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

Total 39 Questions

×
## Correct Option is :

## Explanation

No of substrings=(n(n+1)/2)+1

Example:

Let w = GAT be a string then |w|= 3

The substrings possible are = { ε,G,A,T,GA,AT,GAT}

So,the substring of length 0 = 1 { the string is = ε }

the substring of length 1 = 3 { the strings are = G,A,T }

the substring of length 2 = 2 { the strings are = GA,AT }

the substring of length 3 = 1 { the strings are = GAT }

So total substrings for string length 3 are = (1 + 2 + 3) + 1

Similarly total substrings for string length n are = (1 + 2 + 3 + ................. n times) + 1 = (n(n+1)/2) + 1

×
## Send Error Report:

Divide & Conquer

Greedy Method

Dynamic Programming

P & NP Concepts

GateQuestions.Com is For Serve The Gate Questions For GATE Students at Free Of Cost..
While using this site, you agree to have read and accepted our terms of use,
cookie and privacy policy.
Copyright 2015 - 2019 by GATEQuestions.Com All Rights Reserved.

## Connect with Us: