Best Information for Learners

      DBMS LAQ FOR MBA SYSTEM 1.      With a neat diagram, explain the structure of a DBMS. 2.      What is data integrity? Explain the types of integrity constraints. 3.      Explain 1NF, 2NF, 3NF and BCNF with suitable example. 4.      What are the pitfalls in relational database design? With a suitable example, explain the role of functional dependency in the process of normalization. 5.      Construct an E-R diagram for a car-insurance company whose customers own one or more cars each. Each car has associated with it zero to any number of recorded accidents. State any assumptions you make. 6.      Discuss Join Dependencies and Fifth Normal Form, and explain why 5NF? 7.      What is a view? How can it be created? Explain with an example. 8.      Write short notes on the following:...

  Introduction Automata Theory is a branch of computer science that deals with designing abstract self propelled computing devices that follow a predetermined sequence of operations automatically.  An automaton with a finite number of states is called a Finite Automaton.  The term "Automata" is derived from the Greek word "αὐτόματα" which means "self-acting". An automaton (Automata in plural) is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically. An automaton with a finite number of states is called a Finite Automaton (FA) or Finite State Machine (FSM). Formal definition of a Finite Automaton: An automaton can be represented by a 5-tuple (Q, ∑, δ, q0, F), where − Q is a finite set of states. ∑ is a finite set of symbols, called the alphabet of the automaton. δ is the transition function. q0 is the initial state from where any input is processed (q0 ∈ Q). F is a set of final state/states of Q (F ⊆ ...