DFA ending with 00 start with 0 no epsilon | RGPV TOC PYQ
RGPV 2015Q. Design DFA accepting the following languages over the alphabet {0, 1} The set of all words ending in 00. The set of all … Read more
Team EasyExamNotes
DBMS definition and major components | RGPV PYQ
RGPV 2018Define database management systems (DBMS). What are the major components of this system ? Explain each component. Ans. A DBMS is used for storing, … Read more
Concept of primary, foreign key, integrity constraints | RGPV DBMS PYQ
RGPV 2019Q. Explain the concepts of Primary key, Foreign key and Integrity constraints ? Ans. If there is relation between table than it must have … Read more
DFA ending with 101 | RGPV TOC PYQ
RGPV 2006Q. Give DFA accepting the language over alphabet {0,1} such that all strings of 0 and 1 ending in 101. Ans. Some example strings … Read more
Construct DFA for a power n, n>=0 || RGPV TOC
RGPV 2009Q. Construct DFA for anb | n>=0. Ans. Some example strings = {ab, aab, aaab, aaaab} Minimum number of states required = 2.
Construct FA divisible by 3 | RGPV TOC PYQ
RGPV 2010Construct a finite automta that will accept those strings of a binary number that are divisible ny three.or RGPV 2009construct DFA for binary integer … Read more
Construct DFA equivalent to NFA | RGPV TOC PYQ
RGPV 2014Q. Construct DFA equivalent to the NFAM = ({p, q, r, s}, {0, 1}, δ, p, {q, s})Where δ is defined in the following table. δ … Read more
Define Mealy and Moore Machine
RGPV 2010 Q. Formally define the following (with example)- 1. Mealy machine 2. Moore machine 1. Mealy machine: Mealy machine is a six tuple machine.M = … Read more
Data modelling, compare Data models | RGPV DBMS PYQ
RGPV 2019Q. What do you mean by data modelling ? Compare different data models ? Ans. Data modeling is a way to create data model for … Read more
RGPV TOC design finite automata problems
RGPV 2008Prob 01: Designa FA which accepts set of strings containing four 1’s in every string over alphabet ∑ = {0, 1}. Ans. Some example strings … Read more