Gate
2
iit
Quiz [ MCQ ]
Questions List
.
.
.
.
Finite Automata | Regular Languages
Question
The number of substrings (of all lengths inclusive) that can be formed from a character string of length n is
Answer
n(n+1)/2 +1
The number of substrings (of all lengths inclusive) that can be formed from a character string of length n is
In which of the following case(s) is it possible to obtain different results for call-by-reference and call-by-name parameterpassing?
The proposition p ^ (~ p v q) is
Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-many and R2 is many-to-many. R1 and R2 do not have any attributes of tables required to represent this situation in the relational model?
The total size of address space in a virtual memory system is limited by