‘Viva Questions 1. Whatis SQL? Structured Query Lenguage 2. What is database? ‘A database isa logically coherent collection of data with some inherent meaning, representing some aspect of eal world ard which is designed, built and populated with data for a specific purpose. 3. What is DBMS? Ris a collection of programs that enables user to create and maintain a database. In other ‘words it s general-purpose software that provides the users with the processes of defining, _ constructing end manipulating the éatabase for various applications. 4, What is a Database system? ‘The database and DBMS software together is called as Database system. 5. Advantages of DBMS? ‘Redundancy is controlled. Unauthorized access is restricted. Providing multiple user interfaces. Enforcing integrity constraints, Providing backup and recovery. 6. Disadvantage in File Processing System? Data redundancy & inconsistency. Difficult in accessing data. Data isolation. Data integrity. ‘Concurrent access is not possible. Security Problems. Describe the three levels of data abstraction? ‘There are three levels of abstraction: Physical level: The lowest level of abstraction describes how data are stored. Logical level: The next higher level of abstraction, describes what data are stored in database and what relationship among those data.‘View level:The highest level of abstraction describes only part of entire database. 8, Define the "integrity runes" ‘There are two Integrity rules. Enlity Integrity:States that —Primary key cannot have NULL value! Referential Integrity:States that —Foreign Key can be either a NULL value or should be Primary Key value of other relation, 9. What is extension and intension? Extension - It is the number of tuples present in a table at any instance. ‘This is time dependent Intension -It is a constant value that gives the name, structure of table and the constraints laid on it. 10, What is Data Independence? Data independence means that —the application is independent of the storage structure and access strategy of datal. In other words, The ability to modify the schema definition in one level should not affect the schema definition in the next higher level. ‘Two types of Data Independence: U Physical Data Independence: Modification in physical level should not affect the logical level. 1 Logical Data Independence: Modification in logical level should affect the view level. NOTE: Logical Data Independence is more difficult to achieve 11. What is a view? How it is related to data independence? A view may be thought of as a virtual table, that is, a table that does not really exist in its own right but is instead derived from one or more underlying base table. In other words, there is no stored file that direct represents the view instead a definition of view is stored in data dictionary. Growth and restructuring of base tables is not reflected in views. Thus the view can insulate users from the effects of restructuring and growth in the database. Hence accounts for logical data independence. 12, What is Data Model?A collection of conceptual tools for describing data, data relationships data semantics and constraints. 13. What is E-R model? ‘This data model is based on real world that consists of basic objects calfed entities and of relationship among these objects. Entities are described in a database by a set of attributes, 14, What is Object Oriented model? ‘This model is based on collection of objects. An object contains values stored in instance variables within the object. An object also contains bodies of code that operate on the object ‘These bodies of code are called methods. Objects that contain same types of values and the same methods are grouped together into classes. 45. What is an Entity? It isan ‘object’ in the real world with an independent existence. 16, What is an Entity type? It isa collection (set) of entities that have same attributes, 17, What is an Entity set? It isa collection of all entities of particular entity type in the database. 18, What is an Extension of entity type? ‘The collections of entities of a particular entity type are grouped together into an entity set. 19, What is an attribute? It isa particular property, which describes the entity. 20, What is a Relation Schema and a Relation? A relation Schema denoted by R(AI, A2, ..., An) is made up of the relation name R and the lst of attributes Ai that it contains. A relation is defined as a set of tuples. Let r be the relation which contains set tuples (t1, 2,3, tn). Each tuple is an ordered list of n-values t=(V2,2, wu. Vt). 21, What is degree of a Relation? It is the number of attribute of its relation schema. 22. What is Relationship? It isan association among two or more entities. 23. What is Relationship se ‘The collection (or set) of similar relationships. 2A, What is Relationship type? Relationship type defines a set of associations or a relationship set among a given set of entity pes. 25, What is degree of Relationship type?tis the number of entity type participating 26. What is DDL (Data Definition Language)? A data base schema is specified by a set of definitions expressed by a special language called DDL. 27. What is VDL (View Definition Language)? Ik specifies user views and their mappings to the conceptual schema. 28. What is SDL (Storage Definition Language)? This language is to specify the internal schema. This language may specify the mapping between two schemas. 29. What is Data Storage - Definition Language? ‘The storage structures and access methods used by database system are specified by a set of definition in a special type of DDL called data storage- definition language. 30. What is DML (Data Manipulation Language)? ‘This language that enable user to access or manipulate data as organized by appropriate data ‘model. © Procedural DML, or Low level: DML requires a user to specify what data exe needed and how to get those data. 0 Non-Procedural DML or High level: DML requires a user to specify what data are needed without specifying how to get those data. ‘31. What is DMI Compiler? It translates DML statements in 2 query language into low-level instruction that the query evaluation engine can understand. 32. What is Relational Algebra? At isa procedural query language. It consists of a set of operations that take one or two relations as input and produce a new relation. 33. What is Relational Calculus?It's an applied predicate calculus specifically tailored for relational databases proposed by EF. Codd. Eg. of languages based on it are DSL, ALPHA, QUEL ‘34. What is normalization? Its a process of analyzing the given relation schemas based on their Functional Dependencies (EDs) and primary key to achieve the properties. (0 Minimizing redundancy Minimizing insertion, deletion and update anomalies. 35. What is Functional Dependency? A Functional dependency is denoted by X Y between two sets of attributes X and Y that are subsets of R specifies a constraint on the possible tuple that can form a relation state r of R. The ‘constraint is for any two tuples tI and t2 in rif t1[X] = t2{X] then they have t1[Y] =t2[Y]. This means the value of X component of a tuple uniquely determines the value of component Y. 36. When is a functional dependency F said to be minimal? (0 Every dependency in Fas a single attribute for its right hand side U We cannot replace any dependency X A in F with a dependency Y A where ¥ isa proper subset of X and still have a set of dependency that is equivalent to F. I We cannot remove any dependency from F and still have set of dependency that is equivalent oF. 37. What is Multivalued dependency? Multivained dependency denoted by X Y specitied on relation schema R, where X and Y are both subsets of R, specifies the following constraint on any relation r of R: if two tuples tI and (2 ‘exist in r such that t1[X] = t2[X] then 3 and ¢4 should also exist in r with the following properties 0 Gis] = 41x] =u) +20) 1 SPY] = e1(Y and c4[¥] = 2[Y] U1 B(Z] = 212] and e4{zZ) = e112] where [2 = (R(X U Y)) | 38. What is Lossless join property? It guarantees that the spurious tuple generation does not occur with respect to relation schemas, after decomposition.39, What is 1 NF (Normal Form)? ‘The domain of atribute must include only atomic (simple, indivisible) values. 40, What is Fully Functional dependency? Its based on concept of full functional dependency. A functional dependeney X Y is fully functional dependency if emoval of any attribute A from X means thatthe dependency does not hold any more. 41. What is 2NF? A relation schema R is in 2NF if it is in INF and every non-prime attribute A in R is fully functionally dependent on primary key. 42. What is 3NF? Arrelation schema R is in 3NF if it is in 2NF and for every FD X A either of the following is true 11 X isa Super-key of R (1 A isa prime attribute of R. In other words, ifevery non prime attribute is non- transitively dependent on primary key. 43. What is BCNF (Boyce-Codd Normal Form)? A relation schema R is in BCNF if it is in 3NF and satisfies additional constraint that for every FD X A, X must be a candidate key. 44, What is 4NF? A.relation schema R is said to be in 4NF if for every Multivalued dependency XY that holds over R, one of following is true X is subset or equal to (or) XY =R, X isa super key, 48. What is SNF? ‘ARelation schema R is said to be SNF if for every join dependency (R1, R2, ...Rn} that holds Rone the following is tue TRI=R for some i, | The join dependency is implied by the set of FD, over R in which the left side is key of R