Database Management System (MI0034) PART A 1. ___ are the users assessing the DBMS though menus.

A) Casual users B) Nave users C) Casual users and Nave users D) None of these 2. The three schema architecture is also referred as ___ A) Client B) Server C) Client server D) None of these 3. In this schema architecture, ____ is independent of both software and hardware A) Internal level B) External level C) View level D) Conceptual level 4. ___ stores data in the form of a table A) Hierarchical model B) Relational model C) Network model D) Object oriented model 5. ___ is used to convert online users query into an efficient series of operations and send it to the data manager for execution A) Query processor B) DDL complier C) Run-time database processor D) Pre-complier 6. ___ processes schema definitions specified in the DDL and stores descriptions of the schema in the DBMS catalog A) Run-time database processor B) Query processor C) Pre-complier D) DDL complier

MBAN2 - 3

7. ____ makes each disk to duplicate itself entirely avoiding the loss of all the data when the single disk drive fails A) RAID 0 B) RAID 1 C) RAIF 2 D) RAID 5 8. RAID array is classified into ___ levels A) 5 B) 3 C) 4 D) 2 9. Transfer of data between main memory and disk takes place A) Units of blocks B) Units of bytes C) Units of MB D) None of these 10. ___ are sequential access devices A) Magnetic tapes B) CDs C) Pen drives D) Flash memory 11. ___ is an index specified by ordering the key field A) Clustering index B) Primary index C) Secondary index D) None of these 12. In ___ data pointer are stored only at the laaf nodes of the tree; the space overhead of the director table is negligible A) Static hashing B) B-tree C) B+ D) None of these

Refer a friend & Win Assured Cash Prizes + Gifts (LCD TV, Laptop, IPOD) for details visit www.halo.co.in

Page 1 of 8

Database Management System (MI0034) 13. Some entity types may not have any key attribute of their own; they are called ___ types A) Strong entity B) Single valued entity C) Weak entity D) Multi valued entity 14. ___ is one that describes the data type, relationship and constraints A) The conceptual schema B) Physical schema C) Database D) Attributes 15. ___ refers to the number of entity sets that participates in a relationship set A) Degree of the relationship B) Unary relationship C) Binary relationship D) Tertiary relationship 16. While joining if the comparison operator is = then it is ____ A) Natural join B) Theta join C) Equi join D) Outer join 17. For each attributes there is a set of permitted values called the ___ of those attributes A) Domain B) Design C) Database D) Entity 18. ___ selects required tows from the table A) Select B) Product C) Union D) Minus 19. ___ is procedural A) Tuple B) Relationship calculus C) Relationship algebra D) Domain calculus

MBAN2 - 3 20. The domain calculus differs from the tuple calculus in the type of variable used in ____ A) Formulas B) Tables C) Functions D) Procedures 21. The ___ statements provides commands for defining relation schema A) DDL B) DML C) DCL D) TCL 22. The ___ statements are used to grant permission to the user and revoke permission from the user lock certain permission for the user A) DML B) TCL C) DDL D) DCL 23. The LIKE operator can contain wild characters like ___ and ____ A) %, _ B) $, _ C) $, % D) ?, % 24. The operator is used in the multiple row sub queries A) IN B) ANY C) ALL D) All of these 25. Candidate keys are specified by the ___ constant A) CHECK B) NOT NULL C) NULL D) UNIQUE

26. ___ models gives idea about the known requirement of the application or logical server A) Inherent model B) Not Null C) Null D) Explicit model Page 2 of 8

Refer a friend & Win Assured Cash Prizes + Gifts (LCD TV, Laptop, IPOD) for details visit www.halo.co.in

Database Management System (MI0034) 27. ___ normal form is based on the concept of transitive dependency A) First B) Second C) Third D) Fourth 28. The ___ is also called Project Join Normal Form A) 2NF B) 3NF C) 4NF D) 5NF 29. ___ eliminates redundancy and promotes integrity A) Normalization B) Integration C) Consistency D) ER diagram 30. ___ is the ability of a database management system to manage the various transactions that occur with the system A) Transaction management B) Concurrency C) Atomicity D) Isolation 31. ___ occurs when one transaction updates a database item and then it the transaction falls for some reason the updated item is accessed by another transaction before it is changed back to its original value A) Lost update problem B) Incorrect summery problem C) Dirty read problem D) None of these 32. ___ prevents multiple users from changing the same data simultaneously A) A Lock B) A transaction C) Concurrency D) Isolation

MBAN2 - 3 33. ___ items is called exclusive-locked, because a single transaction exclusive holds the lock on the item A) Read-locked item B) White-locked item C) Exclusive-locked item D) Implicit-locked item 34. ____ should be responsible to bring the database back to operation as quickly as possible and with little or no data loss A) DM B) DBA C) Recovery manager D) Database designer 35. ___ is needed in case the system fails after a transaction commits but before al the changes are recorded in the database A) UNDO B) REDO C) Commit D) UNDO ALL 36. In ___ all system components such as data, DBMS software, and storage device reside at a single computer or site A) a centralized database system B) distributed database system C) client and server architecture D) a decentralized system 37. ___ is the machine running the front end application A) Server B) Client C) Client and server D) None of these 38. In any object oriented development there are ____ stages involved which are always related to each and they are distinct A) Two B) Three C) Four D) Five

Refer a friend & Win Assured Cash Prizes + Gifts (LCD TV, Laptop, IPOD) for details visit www.halo.co.in

Page 3 of 8

Database Management System (MI0034) 39. ___ allows the creation and deletion of indices A) Index authorization B) Delete authorization C) Update authorization D) Modify authorization

MBAN2 - 3 40. ___ is used to give authorization A) Revoke statement B) Delete statement C) Grant statement D) Select statement

PART B 41. State True (T) or False (F) i. Traditional file system keeps redundant information in many locations ii. In DBMS redundancy is eliminated to the maximum extent if properly design 45. State True (T) or False (F) i. A major drawback of the static hashing is that address space is fixed ii. In extendible hashing the stored file has a directory or index table associated with it A) i-F, ii-F B) i-F, ii-T C) i-T, ii-T D) i-T, ii-F 46. State True (T) or False (F) i. In a B+ tree, data pointers are stored only at the leaf nodes of the tree ii. A primary index is an index specified by ordering key field A) i-T, ii-T B) i-T, ii-F C) i-F, ii-T D) i-F, ii-F 47. State True (T) or False (F) i. The first step in database design is to create a conceptual schema for the database ii. The conceptual schema is one that describes the data type, relationship and constraint A) i-T, ii-T B) i-F, ii-T C) i-T, ii-F D) i-F, ii-F 48. Insert operation on relations can violet i. Domain constraints ii. Key constraints iii. Entity constraints iv. Referential integrity A) Any of i, ii, iii and iv B) Only ii, iii C) Only i and iii D) Only ii, iii and iv

A) i-T, ii-T B) i-F, ii-T C) i-T, ii-F D) i-F, ii-F 42. State True (T) or False (F) i. Logical date independence is the ability to modify the physical schema without causing application programs to be rewritten ii. Physical date independence is the ability to modify the conceptual schema without causing application programs to be rewritten A) i-T, ii-F B) i-F, ii-F C) i-F, ii-T D) i-T, ii-T 43. State True (T) or False (F) i. Query processor uses data dictionary to find the structure of schema object ii. Object oriented model is based on a collection of object A) i-F, ii-F B) i-F, ii-T C) i-T, ii-T D) i-T, ii-F 44. State True (T) or False (F) i. RAID 0 is basic of all RAID levels ii. In a RAID 0+1 disk drives are mirrored and then striped A) i-F, ii-T B) i-T, ii-T C) i-T, ii-F D) i-F, ii-F

Refer a friend & Win Assured Cash Prizes + Gifts (LCD TV, Laptop, IPOD) for details visit www.halo.co.in

Page 4 of 8

Database Management System (MI0034) 49. Which of the following condition(s) is/are to be satisfied in order to say the two relations are union compatible? i. The two relations that have the same number of columns ii. Each column of the first relation must be either the same data type as the corresponding column of the second relation A) Only i B) Only ii C) Both i and ii D) Neither i nor ii 50. State True (T) or False (F) i. Relational calculus is procedural whereas relational algebra is non procedural ii. Expressive power of relational algebra and relational calculus are equivalent A) i-T, ii-T B) i-T, ii-F C) i-F, ii-T D) i-F, ii-F 51. State True (T) or False (F) i. Group by clause is used to group the rows based on certain common criteria ii. Group by clause is usually used in conjunction with aggregate functions A) i-T, ii-T B) i-T, ii-F C) i-F, ii-T D) i-F, ii-F 52. State True (T) or False (F) i. Indexing provides a faster access ii. Indexes can also be used to ensure that no duplicate values are entered into a column A) i-F, ii-F B) i-T, ii-F C) i-T, ii-T D) i-F, ii-T 53. State True (T) or False (F) i. A relation is in second normal form if every non-prime attribute A in R fully functionally dependent on the Primary key of R ii. Accordingly to Codds definition, a relation schema R is in 3NF if it satisfies 2NF and no nonprime attribute is functionally dependent on the primary key A) i-T, ii-F B) i-F, ii-T C) i-F, ii-F D) i-T, ii-T

MBAN2 - 3

54. A relation R is in ___ if for all join dependence at least one of the following holds; i. (R1, R2.Rn) dependency ii. Every Ri is a candidate key for R A) 1NF B) 2NF C) 3NF D) 5NF 55. ACID properties of a database means A) Atomicity, Consistency, Isolation and Dependability B) Atomicity, Concurrency, Integrity and Durability C) Atomicity, Consistency, Integrity and Durability D) Atomicity, Consistency, Isolation and Durability 56. State True (T) or False (F) i. Dynamic files are those files on which the updation operation are done every rarely ii. In a static files constant updation operation takes place A) i-T, ii-T B) i-T, ii-F C) i-F, ii-T D) i-F, ii-F 57. State True (T) or False (F) i. Shared locks are used for data modification operations ii. Exclusive locks are held until transaction commits or rolls back since those are used for write operations A) i-F, ii-F B) i-F, ii-T C) i-T, ii-T D) i-T, ii-F 58. State True (T) or False (F) i. In deadlock state there exists a set of transaction in which every transaction in the set is waiting for another transaction in the sat ii. A lock is a restriction on access to data in a multi-user environment A) i-F, ii-T B) i-T, ii-T C) i-T, ii-F D) i-F, ii-F Page 5 of 8

Refer a friend & Win Assured Cash Prizes + Gifts (LCD TV, Laptop, IPOD) for details visit www.halo.co.in

Database Management System (MI0034) 59. State True (T) or False (F) i. Object oriented analysis deals with the development of object oriented system model to implement requirements ii. Object oriented design involves the development of object model of the application domain A) i-F, ii-F B) i-T, ii-F C) i-T, ii-T D) i-F, ii-T

MBAN2 - 3 60. State True (T) or False (F) i. A user who has been granted some form of authorization may be allowed to pass all or part of his rights to another user ii. To properly revoke access rights all paths in the authorization group must start from the authorizer A) i-F, ii-F B) i-T, ii-T C) i-T, ii-F D) i-F, ii-T

PART C 61. From the following, indentify the statements which are true related to the external level of the three schema architecture i. It is outmost layer ii. This layer is closet to users iii. It hides the details of physical storage structure and concentrates on describing entities iv. It describes the complete details of the stored records and access methods used to achieve efficient access to the data A) i and ii only B) i, ii and iii only C) i, ii, iii and iv D) i and iii only 62. From the following, identify the true statements with respect to dynamic hashing i. The space overhead of the directory table is negligible ii. Performance does not degrade as the file grows iii. It involves and additional level of indirection iv. The index table grow rapidly and too large to fit in main memory A) i, ii and iv only B) i, ii and iii only C) i, ii, iii and iv D) ii, iii and iv only 63. State True (T) or False (F) i. A B+ tree is a multi level index ii. B tree does not eliminate the redundant storage of search key values iii. In a B+ tree, the deleted entry always appears in a non-leaf node iv. In a B tree, the deleted entry may appear in a nonleaf node A) i-T, ii-T, iii-F, iv-T B) i-T, ii-T, iii-T, iv-T C) i-T, ii-F, iii-F, iv-T D) i-F, ii-T, iii-F, iv-T 64. State True (T) or False (F) i. The participation of an entity set E in a relationship set R is said to be total it every entity in E participates in at least one relationship in R ii. Total participation is also called existence dependency iii. If only some entities in E participate in relationship in R the participation of entity set E in Relationship R is said to be partial iv. A weak entity type is dependent on the existence of another entity A) i-F, ii-F, iii-T, iv-T B) i-T, ii-F, iii-T, iv-T C) i-T, ii-T, iii-T, iv-F D) i-T, ii-T, iii-T, iv-T 65. State True (T) or False (F) i. Relational calculus is a procedural language ii. Relational algebra is a nonprocedural language iii. Each tuple within a formula is either free or bound if it is quantifies iv. In domain calculus the variables range over single values from domains of attributes rather than ranging over tuples A) i-F, ii-T, iii-T, iv-T B) i-T, ii-F, iii-F, iv-T C) i-T, ii-T, iii-F, iv-T D) i-F, ii-F, iii-T, iv-T

Refer a friend & Win Assured Cash Prizes + Gifts (LCD TV, Laptop, IPOD) for details visit www.halo.co.in

Page 6 of 8

Database Management System (MI0034) 66. State True (T) or False (F) i. If there are NOT NULL columns which are missing in view, one cannot insert the records ii. If a view is created by referring to more than one table, one cannot do DML operation except SELECT iii. View updation is possible only if it is created by a single table A) i-T, ii-F, iii-T B) i-T, ii-T, iii-T C) i-T, ii-F, iii-F D) i-F, ii-F, iii-F 67. From the following, identify the steps related to Read-item(x) database operation. i. Find the address of the disk block that contains item x ii. Copy that disk block into a buffer in main memory iii. Copy then x from the buffer to the program variables x iv. Copy item x from the program variable into its current location in the buffer v. Store the updated block from the buffer back to disk A) i, ii, iii and iv only B) i, ii, iii, iv and v C) i, ii and iii only D) ii, iii, iv and v only 68. From the following, identify the reasons for transaction failure . i. A computer failure ii. Transaction of system error iii. Local error pr exception conditions detected by the transaction iv. Concurrency control enforcement v. Disk failure vi. Physical problems and catastrophes A) All of the above B) All except ii and iv C) All except vi D) All except iii 69. State True (T) or False (F) i. In the shrinking phase of two phase locking protocol, the transaction may acquire lock, but may not release any locks ii. In the growing phase of two phase locking protocol, the transaction may release locks, but may acquire any new locks iii. The growing phase of two phase locking protocol is also called as resource acquisition activity iv. In the two phases locking protocol cascading rollback are not avoided A) i-F, ii-F, iii-T, iv-T B) i-T, ii-F, iii-T, iv-T C) i-T, ii-T, iii-T, iv-F D) i-T, ii-T, iii-T, iv-T

MBAN2 - 3

70. State True (T) or False (F) i. In the case of deferred update of recovery technique, it defers or postpones any actual updates to the database until the transaction completes its execution successfully and reaches its commit point ii. In the case of immediate update of recovery technique, updates are applied to the database without waiting to reach the commit point iii. Immediate update technique is also known as UNDO/REDO algorithm A) i-T, ii-F, iii-T B) i-T, ii-T, iii-T C) i-T, ii-T, iii-F D) i-F, ii-T, iii-T 71. From the following list, identify the advantages of distributed database i. Increased reliability ii. Increased availability iii. Improved performance iv. Data sharing v. Transparency vi. Easier expansion A) All except vi B) All except iii C) All except v D) All of the above 72. State True (T) or False (F) i. In the case of client-server model, client applications are dependent on physical location of the data ii. Horizontal fragmentation is a collection of only certain attributes of the relation iii. Vertical fragmentation divides a relation by grouping rows to create subsets of tuples, where each subset has certain logical meaning iv. Mixing of horizontal and vertical fragmentation is called mixed fragmentation A) i-T, ii-T, iii-F, iv-T B) i-T, ii-T, iii-T, iv-T C) i-T, ii-T, iii-T, iv-F D) i-F, ii-T, iii-F, iv-T

Refer a friend & Win Assured Cash Prizes + Gifts (LCD TV, Laptop, IPOD) for details visit www.halo.co.in

Page 7 of 8

Database Management System (MI0034) 73. From the following, identify the characteristics of object oriented design i. Objects are abstractions of real world entities and mange themselves ii. Objects are independent and encapsulate state and representation information iii. System functionally is expressed in term of object services iv. Shared data areas are eliminated v. Objects communicate by message passing vi. Objects may be distributed and may execute sequentially or in parallel A) All of the above B) All except v C) All except i and ii D) All except iv 74. From the following list, identify the drawbacks of ODBMS i. Lower efficiency when data is simple and relationships are simple ii. Relational table are simpler iii. Reduced access speed due to late binding iv. Lack of standards includes lack of common query language v. Reduced paging A) All except vi B) All except iv C) All except iii D) All except v 75. A user may have several forms of authorization on part of the database. Indentify them from the following i. Read authorization ii. Insert authorization iii. Update authorization iv. Delete authorization v. Index authorization vi. Resource authorization vii. Drop authorization A) All except ii B) All except iii C) All of the above D) All except i

MBAN2 - 3

Refer a friend & Win Assured Cash Prizes + Gifts (LCD TV, Laptop, IPOD) for details visit www.halo.co.in

Page 8 of 8