Class Test II

Download as pdf or txt
Download as pdf or txt
You are on page 1of 7

BHARATI VIDYAPEETH’S

INSTITUTE OF COMPUTER APPLICATIONS & MANAGEMENT (BVICAM)


(Affiliated to Guru Gobind Singh Indraprastha University, Approved by AICTE, New Delhi)
A-4, Paschim Vihar, Rohtak Road, New Delhi-110063, Visit us at: http://www.bvicam.in/
Course Code: MCA-108 Course Name: Database Management Systems
Class Test 2
Time: 1 Hour Max Marks: 20

All questions carry half (0.5) mark each:

1. . ………………. First proposed the process of normalization.

A) Edgar. W
B) Edgar F. Codd
C) Edward Stephen
D) Edward Codd

2. For using a specific database …………… command is used.

A) use database
B) database name use
C) Both A &B
D) None of them

3. ……………..specifies a search condition for a group or an aggregate.

A) GROUP BY Clause
B) HAVING Clause
C) FROM Clause
D) WHERE Clause

4. Drop Table cannot be used to drop a table referenced by a …………… constraint.

A) Local Key
B) Primary Key
C) Composite Key
D) Foreign Key

5. In SQL, which command is used to issue multiple CREATE TABLE, CREATE VIEW
and GRANT statements in a single transaction?

Page 1 of 7
A) CREATE PACKAGE
B) CREATE SCHEMA
C) CREATE CLUSTER
D) All of the above

6. In SQL, the CREATE TABLESPACE is used

A) to create a place in the database for storage of scheme objects, rollback segments,
and naming the data files to comprise the tablespace.
B) to create a database trigger.
C) to add/rename data files, to change storage
D) All of the above

7. What are the different events in Triggers?

A) Define, Create
B) Drop, Comment
C) Insert, Update, Delete
D) Select, Commit

8. To pass on granted privileges to other user the ...... clause is used

A. create option
B. grant option
C. update option
D. select option

9. Which two files are used during operation of the DBMS

A. Query languages and utilities


B. DML and query language
C. Data dictionary and transaction log
D. Data dictionary and query language

10. A transaction is said to be a unit of program's

A. Evaluation
B. Execution
C. Computation
D. Controlling

11. Commit and rollback are related to ……….


A. data integrity

Page 2 of 7
B. data consistency
C. data sharing
D. data security

12. The transaction wants to edit the data item is called as …….
A. Exclusive Mode
B. Shared Mode
C. Inclusive Mode
D. Unshared Mode

13. For committing a transaction, the DBMS might discard all the records.
A. after image
B. before image
C. log
D. redo log

14. A sophisticated locking mechanism is known as 2-phase locking which includes


Growing phase and …….
A. Shrinking Phase
B. Release phase
C. Commit phase
D. Acquire Phase

15. If a distributed transactions are well-formed and 2-phase locked, then ……………. is
the correct locking mechanism in the distributed transaction as well as in centralized
databases.
A. two-phase locking
B. three phase locking
C. transaction locking
D. well-formed locking

16. ……… property will check whether all the operation of a transaction completed or
none.
A. Atomicity
B. Consistency
C. Isolation
D. Durability

17. The total ordering of operations across groups ensures ………..of transactions.
A. serializability
B. synchronizability
C. atomicity
D. durability

Page 3 of 7
18. In which state, the transaction will wait for the final statement has been executed?
A. Active
B. Failed
C. Aborted
D. partially committed

19. The ORDER concurrency control technique is based on the property.


A. ordering mechanism
B. inherent ordering
C. total ordering
D. partial ordering

20. Transactions per rollback segment is derived from …..


A. Db_Block_Buffers
B. Processes
C. shared_Pool_size
D. buffers

21. The …………is responsible for ensuring the correct execution in the presence of
failures.
A. Database Manager
B. Transaction Manager
C. Recovery Manager
D. Executive Manager

22. A distributed transaction can be …………. if queries are issued at one or more nodes.
A. fully read-only
B. partially read-only
C. fully read-write
D. partially read-write

23. The distributed transaction can be completely read-only and the transaction is started
with a ………. READ ONLY statement.
A. DISTRIBUTED_TRANSACTIONS
B. TRANSACTION
C. SET TRANSACTION
D. READ TRANSACTION

24. The initialization parameter …………….. controls the number of possible distributed
transactions in which a given instance can concurrently participate, both as a client
and a server.
A. DISTRIBUTED_TRANSACTIONS
B. TRANSACTION

Page 4 of 7
C. SET TRANSACTION
D. CONTROL TRANSACTION

25. A database administrator can manually force the COMMIT or ROLLBACK of a local
………… distributed transaction.
A. in-force
B. in-doubt
C. in-local
D. in-manual

26. A ………………… specifies the actions needed to remove the drawbacks in the
current design of a database.
A) 1 NF
B) 2 NF
C) 3 NF
D) Normal form
27. A relation is in ……………………… if an attribute of a composite key is dependent on
an attribute of another composite key.
A) 2NF
B) 3NF
C) BCNF
D) 1NF
28. The fifth Normal form is concerned with
A) Functional dependency
B) Multivalued dependency
C) Join dependency
D) Domain key
29. A table is in the ………………….. if only candidate keys are the determinants.
A) functional dependency
B) transitive dependency
C) 4 NF
D) BCNF
30. In 2NF
A) No functional dependencies exist.
B) No multivalued dependencies exist.
C) No partial functional dependencies exist
D) No partial multivalued dependencies exist.
31. The normal form that is not necessarily dependency preserving is
A) 2NF
B) 3NF
C) BCNF
D) 4NF

Page 5 of 7
32. The …………….. is related to the concept of multi-valued dependency.
A) fourth normal form
B) fifth normal form
C) boyce codd normal form
D) third normal form
33. Which normal form is considered adequate for normal relational database design?
A) 2NF
B) 5NF
C) 4NF
D) 3NF
34. Dependency preservation is not guaranteed in
A) BCNF
B) 3NF
C) 4NF
D) DKNF
35. A relation is ………………. if every field contains only atomic values that are, no lists
or sets.
A) 1 NF
B) 2 NF
C) 3 NF
D) BCNF
36. A ..................... specifies the actions needed to remove the drawbacks in the current design of
database.

A) 1 NF
B) 2 NF
C) 3 NF
D) Normal form

37. A relation is in ........................... if an attribute of a composite key is dependent on an attribute


of other composite key.

A) 2NF
B) 3NF
C) BCNF
D) 1NF

38. Fifth Normal form is concerned with

A) Functional dependency
B) Multivalued dependency
C) Join dependency
D) Domain key

39. A table is in the ....................... if only candidate keys are the determinants.

Page 6 of 7
A) functional dependency
B) transitive dependency
C) 4 NF
D) BCNF

40. In 2NF

A) No functional dependencies exist.


B) No multivalued dependencies exist.
C) No partial functional dependencies exist
D) No partial multivalued dependencies exist.

Page 7 of 7

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy