Quiz [ MCQ ]
Finite Automata | Regular Languages
The number of substrings (of all lengths inclusive) that can be formed from a character string of length n is
The total size of address space in a virtual memory system is limited by
The following sequence of operations is performed on a stack: PUSH(10), PUSH(20), POP, PUSH(10), PUSH(20), POP, POP, POP, PUSH (20), POP The sequende of values popped out 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?
Indicate which of the following well-formed formula are valid:
Which scheduling policy is most suitable for a time-shared operating systems?
©2020 Gate2iit. All rights reserved