1000+ DBMS Multiple Choice Question Answer [Solved]

1. The ____ operator joins two or more conditions and displays rows only if that rows data satisfies all conditions specified.
A. OR
B. AND
C. NOT
D. ALL
Answer : B

2. A DBMS is a ____ user if at most one user can use the system and is mostly restricted to personal computer systems.
A. None
B. Multi
C. Single
D. Concurrent
Answer : C

3. A relational database developer refers to a record as
A. an attribute
B. a tuple
C. a criteria
D. a relation
Answer : B

4. If a transaction T has obtained an exclusive lock on item Q, then T can
A. read Q
B. write Q
C. both read and write Q
D. write Q but not read Q
Answer : C

5. The ______ key of a relation is the attribute (column) or collection of attributes, which uniquely identify a given tuple.
A. Primary
B. Foreign
C. Candidate
D. Alternate
Answer : A

6. Which of the following is not a characteristic of a relational database model?
A. Table
B. Tree like structure
C. Complex logical relationship
D. Records
Answer : B

7. The keyword to eliminate duplicate rows from the query result in SQL is
A. DISTINCT
B. NO DUPLICATE
C. UNIQUE
D. None of the above
Answer : C

8. In 2NF
A. No functional dependencies (FDs) exist.
B. No multivalued dependencies (MVDs) exist.
C. No partial FDs exist.
D. No partial MVDs exist.
Answer : C

9. In a multi-user database, if two users wish to update the same record at the same time, they are prevented from doing so by
A. jamming
B. password
C. documentation
D. record lock
Answer : D

10. In a relational schema, each tuple is divided into fields called
A. Relations
B. Queries
C. Domains
D. All of the above
Answer : A

11. Which of the following is not a property of transactions?
A. Atomicity
B. Concurrency
C. Isolation
D. Durability
Answer : B

12. The language that requires a user to specify the data to be retrieved without specifying exactly how to get it is
A. Procedural DML.
B. Non-Procedural DML.
C. Procedural DDL.
D. Non-Procedural DDL.
Answer : B

13. If the closure of an attribute set is the entire relation then the attribute set is a
A. superkey
B. candidate key
C. primary key
D. not a key
Answer : A

14. It is an abstraction through which relationships are treated as higher level entities
A. Generalization.
B. Specialization.
C. Aggregation.
D. Inheritance.
Answer : C

15. ______ keyword is used to find the number of values in a column.
A. TOTAL
B. ADD
C. COUNT
D. SUM
Answer : C

16. ______is a preferred method for enforcing data integrity
A. Constraints
B. Triggers
C. Stored procedure
D. Cursors
Answer : A

17. The values of the attribute describes a particular
A. Entity set
B. File
C. Entity instance
D. Organization
Answer : C

18. Data items grouped together for storage purposes are called a
A. record
B. string
C. title
D. list
Answer : A

19. Maximum height of a B+ tree of order m with n key values is
A. Logm(n)
B. (m+n)/2
C. Logm/2(m+n)
D. None of these
Answer : D

20. 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
Answer : C

21. Drop Table cannot be used to drop a table referenced by a ______ constraint.
A. Primary Key
B. Local Key
C. Foreign Key
D. Composite Key
Answer : C

22. The fact that all employees of a particular organization should not have salaries more than $10000 is a _____ constraint.
A. Schema
B. Tuple
C. Domain
D. Relational
Answer : C

23. Relationships among relationships can be represented in an-E-R model using
A. Aggregation
B. Association
C. Weak entity sets
D. Weak relationship sets
Answer : A

24. The data in the database at a particular moment of time is called the _______
A. Snapshot
B. Dynaset
C. Stateless
D. Stateful
Answer : A

25. Relational Algebra is
A. Data Definition Language .
B. Meta Language
C. Procedural query Language
D. None of the above
Answer : C

26. Which one is correct statement?
Logical data independence provides following without changing application programs:
(i) Changes in access methods.
(ii) Adding new entities in database
(iii) Splitting an existing record into two or more records
(iv) C
A. (i) and (ii)
B. (iv) only
C. (i) and (iv)
D. (ii) and (iii)
Answer : D

27. Which of the following concurrency control schemes is not based on the serializability property?
A. Two - phase locking
B. Graph-based locking
C. Time-stamp based locking
D. None of these .
Answer : D

28. DROP is a statement in SQL.
A. Query
B. Embedded SQL
C. DDL
D. DCL
Answer : C

29. For using a specific database …………… command is used.
A. use database
B. database name use
C. Both A & B
D. None of them
Answer : A

30. By ______ an area on disk in certain ways, one can make it represent a bit value of either zero (0) or one (1).
A. Vulcanizing
B. Galvanizing
C. Magnetizing
D. Passing UV rays
Answer : C

31. The rule that a value of a foreign key must appear as a value of some specific table is called a
A. Referential constraint.
B. Index.
C. Integrity constraint.
D. Functional dependency.
Answer : A

32. The default level of consistency in SQL is
A. repeatable read
B. read committed
C. read uncommitted
D. serializable
Answer : D

33. A ____ key specifies a uniqueness constraint that no two distinct tuples in any state r of relation R can have the same value for super key.
A. Sub
B. Parent
C. Candidate
D. Super
Answer : D

34. The clause in SQL that specifies that the query result should be sorted in ascending or descending order based on the values of one or more columns is
A. View
B. Order by
C. Group by
D. Having
Answer : B

35. Which normal form is considered adequate for normal relational database design?
A. 2NF
B. 5NF
C. 4NF
D. 3NF
Answer : D

36. The set of all values that can be taken by the attribute is called as _______ of the attribute.
A. Tuple
B. Cardinality
C. Degree
D. Domain
Answer : D

37. The transactions like adding an employee, enrolling a student in a course are examples of _______
A. Logical
B. Physical
C. None
D. Theoretical
Answer : A

38. Which one is true statement :
A. With finer degree of granularity of locking a high degree of concurrency is possible.
B. Locking prevents non-serializable schedules.
C. Locking cannot take place at field level.
D. An exclusive lock on data item X is granted even if a shared lock is already held on X.
Answer : A

39. Which of the following is not a recovery technique?
A. Deferred update
B. Immediate update
C. Two-phase commit
D. Shadow paging
Answer : C

40. The ______ indexes are forced to store only record IDs in the data structure and require at least one additional I/O Operation to retrieve the actual record.
A. Clustered
B. Hashed
C. Un-clustered
D. Collision
Answer : C

41. Cascading rollback is avoided in all protocol except
A. strict two-phase locking protocol.
B. tree locking protocol
C. two-phase locking protocol
D. validation based protocol.
Answer : D

42. The clause alter table in SQL can be used to
A. add an attribute
B. delete an attribute
C. alter the default values of an attribute
D. all of the above
Answer : D

43. The size of a data item is called its _______, which can be a field of some record or may be a larger unit such as a record.
A. Similarity
B. Granularity
C. Dimensionality
D. Arity
Answer : B

44. ………………… approach reduces time and effort required for design and lesser risk in database management.
A. Single global database
B. Multiple databases
C. Top-down approach
D. None of the above
Answer : B

45. In SQL the statement select * from R, S is equivalent to
A. Select * from R natural join S.
B. Select * from R cross join S.
C. Select * from R union join S.
D. Select * from R inner join S.
Answer : B

46. DBMS is a collection of _____ that enables user to create and maintain a database.
A. Keys
B. Program
C. Translators
D. Language Activity
Answer : B

47. What will be the number of columns and rows respectively obtained for the operation, A- B, if A B are Base union compatible and all the rows of a are common to B? Assume A has 4 columns and 10 rows; and B has 4 columns and 15 rows
A. 4,0
B. 0,0
C. 4,5
D. 8,5
Answer : A

48. Precedence graphs help to find a
A. Serializable schedule.
B. Recoverable schedule.
C. Deadlock free schedule.
D. Cascadeless schedule.
Answer : A

49. An advantage of the database management approach is
A. data redundancy increases
B. data is dependent on programs
C. data is integrated and can be accessed by multiple programs
D. none of the above
Answer : C

50. A logical schema
A. is the entire database
B. Describes how data is actually stored on disk.
C. is a standard way of organizing information into accessible parts.
D. All of the above
Answer : C