1-1.

A Database Management database
System (DBMS) is D. All of the above
A. Collection of interrelated data
B. Collection of programs to access 1-7. Which of the following is not
data an Schema?
C. Collection of data describing one A. Database Schema
particular enterprise B. Physical Schema
D. All of the above C. Critical Schema
D. Logical Schema
1-2. Which of the following is not
a level of data abstraction? 1-8. Which of the following is
A. Physical Level Database Language?
B. Critical Level A. Data Definition Language
C. Logical Level B. Data Manipulation Language
D. View Level C. Query Language
D. All of the above
1-3. Disadvantages
of File systems to store data is: 1-9. Which of the following in not
A. Data redundancy and inconsistency a function of DBA?
B. Difficulty in accessing data A. Network Maintenance
C. Data isolation B. Routine Maintenance
D. All of the above C. Schema Definition
D. Authorization for data access
1-4. In an Entity-
Relationship Diagram Rectangles 1-10. Which of the following is a
represents Data Model?
A. Entity sets A. Entity-Relationship model
B. Attributes B. Relational data model
C. Database C. Object-Based data model
D. Tables D. All of the above

1-5. Which of the following is not 1–D/2–B/3–D/4–A/5–B/6–D/7–
a Storage Manager Component? C / 8 – D / 9 – A / 10 – D
A. Transaction Manager
B. Logical Manager
C. Buffer Manager
D. File Manager

1-6. Data Manipulation Language
enables users to
A. Retrieval of information stored in
database
B. Insertion of new information into
the database
C. Deletion of information from the

A Field D. Subset of a Cartesian product of a A. Deletion A. A Column 2-8. Sorting C. Updating D. Column header is refer as A. In mathematical term Table is C. Tuple D. Relation B. _______ allow us to identify uniquely a tuple in the relation. Domain 2-6. Rename list of domains D. Relation B. Subset of a Cartesian product of a Outer join? list of relations A. Attribute C. Candidate keys A. Tuple A / 7 – B / 8 – C / 9 – D / 10 – D D. A Table D. Attribute D. Schema . Schema keys set of values. Relation C. Superkey B. Right outer join 2-4. Select list of attributes B. Which of the following in not D. Attributes D. A Relation is a Relation-algebra Operation A.2-1. Table B. Minimal Superkeys are called represents a relationship among a A. Full outer join referred as D. In mathematical term Row is referred as A. Subset of a Cartesian product of a C. A. Which of the following is not Modification of the Database 2-2. Insertion B. Left outer join B. Domain 2-5. B. Which of the following is 2-3. Union B. Domain C. Subset of a Cartesian product of a list of tuple 2-10. All of the above A. All of the above C. Domain 2-9. Attribute keys C. Attribute 1–A/2–C/3–B/4–A/5–C/6– C. Domain keys B. Which of the following 2-7. A Row C.

Option A and B C. Set Difference D. Null = 0 D. it takes a list of values and return a C.F.3-1. Charles Babbage D. Which of the following in true C. Null > 0 single value as result D. Erase table <table name> A. All of the above 3-10. Database Snapshot D. Union . All of the above B / 8 – A / 9 – D / 10 – B 3-6. Union B. E. Relation single values as result D. Tuple A. Which of the following is each attribute is called correct regarding Aggregate A. it takes a list of values and return a list of values as result 3-3. Codd B. Which of the following is not model? binary operation? A. Option A or B B. Project C. Project C. Who proposed the relational 3-7. Database Schema D. it takes a single value and returns a B. Which of the following is not Unary operation? A. The Primary key must be 3-4. Schema B. Set of premitted values of 3-8. A command to remove a relation from an SQL database 3-5. it takes a single value and returns a regarding Null Value? list of values as result A. Unique A. Logical design of database is A. Bill Gates A. Alter table <table name> B. Domain functions? B. Database Instance C. Rename D. Database Snapshot 1–B/2–A/3–D/4–C/5–B/6–D/7– D. Non Null called B. Cartesian Product 3-2. Database Schema D. Database Instance C. Select B. Snapshot of the dta in the A. Drop table <table name> time is called C. Delete table <table name> database at a given instant of B. Herman Hollerith C. Null <> 0 3-9. Null < 0 C.

Weak entity set C. Data Manipulation Language D. Automatically. Concurrency. Relationship sets the Database 4-5. Durability match a foreign-key value in an D. In an Entity. Atomicity. Multi-valued attributes (DML) is not to A. Deletion of information in B. Attributes D. Isolation. which of the following is not primary key. Durability C. First Normal Form B. the Database Relationship Diagram “Diamonds” B. Atomicity. Create information table in 4-4. Simple Attribute B. Max B. the relation will be an Aggregate function? in A. Weak entity set D. Third Normal Form D. Every foreign-key value must match a primary-key value in an associated table . Uncommitted Dependency B. Inconsistent Data C. Multi-valued Attribute D. Consistency. Database locking concept is divided into other attributes is used to solve the problem of called A. UML is stands for 4-3. Attributes C. 4-6. Database A. Universal Modeling Language Relationship Diagram “Ellipses” B. A. Min A. Every primary-key value must Inconsistent. What is ACID properties of 4-10. Second Normal Form C. associated table Isolation. Avg D. Relationship sets 4-9. Lost Update A. Uni Modeling Language B. Derived Attribute 4-8. The attribute that can be 4-7. Composite Attribute C. United Modeling Language A. If every non-key attribute is functionally dependent on the 4-1. match a primary-key value in an Durability associated table C. Fourth Formal Form 4-2. In an Entity. Every primary-key value must B. Which of the following in Transactions? true regarding Referential A. Modification of information in D. Unified Modeling Language represents C. Consistency. Multi-valued attributes the Database C. B. Atomicity. Integrity? Isolation. Consistency. All of the above D. Insertion of new information into represents the Database A. Select C.

None of these remove a table and all its data from the database? . Functional data c. Candidate key c. Primary key d. Every foreign-key value must match a. Open database connection b. Fourth unary operation? a. Query d. Second c. In DBMS FD stands for a. Arithmetic algebra Dependency? c. Right to Left 5-1. Primitive operation a. Linked list c. Third 5-4. Facilitate data b. Relational algebra based on Multi Valued b. Left to Left b. None of above c. Generalized selection structure of the Database? c. Oriented database connection a. Right to Right d. Which of the following is a. Facilitate dependency d. Projection operation b. Which of the following is an d. Drop Table d. Stack a. How many types of keys in a. Foreign key d. Both a. Which of the following option is use to retrieval of data? 5-7.D. Table d. First d. Left to Right c. None of these 1–C/2–B/3–A/4–D/5–B/6– C / 7 – D / 8 – B / 9 – A / 10 – C 5-6. Alter Table table c. Schema c. Which SQL Query is use to d. Functional dependency 5-2. In precedence of set operators the expression is evaluated from: a. Relation 5-5. None b. Selection operation 5-10. Which of the following is the b. ODBC stands for ______ 5-8. Create Table a foreign-key value in an associated b. Which algebra is widely used in DBMS? 5-9. Data Structure b. All of these 5-3. Offline database connection Database Design? b.

A relation that has no partial A. Super query required by a user to perform task B. A lock that allows concurrent D. Transitive dependency C. A functional dependency as a between two or more non-key A. Data View Answers 6-5. Candidate key 6-7. User View . Left – Right approach B. Partial transitive dependency D. Data independence A. Deletion form C. Secondary key C. Top – Down approach D. Logical View D. Data integrity 6-1. Data constraint is called D. All of the above B. Multi-query B. Master query A. A logical description of some of another query is called portion of database that is A. Partial functional dependency 6-9. Database-level lock C. Sub query is called as C. _____________ refers to the correctness and completeness of the data in a database? A. BCNF transactions to access different rows of the same table is known 6-3. A type of query that is placed within a WHERE or HAVING clause 6-4. Bottom – Up approach 6-6. First D. Second C. Insertion dependencies is in which normal B. Table-level lock B. ______________ is a classical 1–d/2–c/3–a/4–b/5–c/6– approach to database design? b / 7 – d / 8 – d / 9 – d / 10 – b A. Right – Left approach C. Primary key B. A table that displays data D. The minimal set of super key C. System View D. Row-level lock A. Field-level lock attributes is called B. Functional dependency D. Update A. Foreign key redundancies yields ____________ anomalies 6-2. Data security B. Third 6-8. C.

Attribute domain B / 7 – D / 8 – A / 9 – B / 10 – D D. data is organized into 7-3. An attribute that is not part C. A key that consists of more C. Which of the follow is not the A. n-ary 7-8. Every attribute has some predefined value scope that is called Answers A. sub-prime attribute A.6-10. The key selected from the D. Rolled B. Ternary D. The degree of the A. Third normal form (3NF) of any candidate key is known as D. Saved of database systems? B. Relation schema 7-6. Fourth normal form (4NF) B. sub-candidate key 7-7. In hierarchical model. Primary key B. number of entities in a relationship D. logical structure relationship is B. 14 7-5. physical structure A. A transaction completes its 7-4. 11 C. 12 D. How many rules in “CODD’S execution is said to be RULES” of Relational Model A. An attribute of a table cannot hold multiple values is the property of A. Second normal form (2NF) 7-1. Single C. First normal form (1NF) B. Loaded A. Secondary Key . 13 D. Tables 1–C/2–B/3–A/4–B/5–C/6– C. number of participating entities in a sets of candidate keys relationship by database designer is called A. number of Row & Columns in a relationship 7-9. tree like structure B. number of Tables in a relationship C. Tuple B. Candidate key A. Binary D. Primary key B. Composite key degree of relationship? B. non-candidate key than one attribute to uniquely identify rows in a table is called 7-2. non-prime attribute D. Foreign key C. none of them C. Committed C.

C. Relationship Set A / 7 – A / 8 – C / 9 – A / 10 – B B. Foreign key D. In an Entity. Multi-valued Attributes . Weak Entity Sets C. Super key 7-10. Answers Relationship diagram “Double Rectangles” represents 1–B/2–A/3–D/4–B/5–C/6– A. Derived Attributes D.