1000+ DBMS Multiple Choice Question Answer [Solved]

1. In an E-R diagram double lines indicate
A. Total participation.
B. Multiple participation.
C. Cardinality N.
D. None of the above.
Answer : A

2. Which of the following statement on the view concept in SQL is invalid?
A. All views are not updateable
B. The views may be referenced in an SQL statement whenever tables are referenced.
C. The views are instantiated at the time they are referenced and not when they are defined.
D. The definition of a view should not have GROUP BY clause in it.
Answer : D

3. If two relations R and S are joined, then the non matching tuples of both R and S are ignored in
A. left outer join
B. right outer join
C. full outer join
D. inner join
Answer : D

4. E-R Modeling is achieved by using ____ diagrams
A. DFD
B. Flowcharts
C. Gantt Charts
D. E-R
Answer : D

5. The full form of GUI is _________
A. Government Union Internet
B. Graphical Unit Interface
C. Graphical User Interface
D. Graphical University Interface
Answer : C

6. Whenever two independent one-to-many relationships are mixed in the same relation, a __________ arises.
A. Functional dependency
B. Multi-valued dependency
C. Transitive dependency
D. Partial dependency
Answer : B

7. ______defines the structure of a relation which consists of a fixed set of attribute-domain pairs.
A. Instance
B. Program
C. Schema
D. Super Key
Answer : C

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

9. What are the desirable properties of a decomposition
A. Partition constraint.
B. Dependency preservation.
C. Redundancy.
D. Security.
Answer : B

10. Union operator is a :
A. Unary Operator
B. Ternary Operator
C. Binary Operator
D. Not an operator
Answer : C

11. For correct behaviour during recovery, undo and redo operation must be
A. Commutative
B. Associative
C. idempotent
D. distributive
Answer : C

12. SQL server stores index information in the _____system table
A. system indexes
B. syst indexes
C. sys indexes
D. sysind
Answer : C

13. Use of UNIQUE while defining an attribute of a table in SQL means that the attribute values are
A. distinct values
B. cannot have NULL
C. both (A) & (B)
D. same as primary key
Answer : C

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

15. 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

16. 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

17. The metadata is created by the
A. DML compiler
B. DML pre-processor
C. DDL interpreter
D. Query interpreter
Answer : C

18. The drawback of shadow paging technique are
A. Commit overhead
B. Data fragmentation
C. Garbage collection
D. All of these
Answer : D

19. 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

20. A weak entity has an ______ dependency on its owner entity, which can be used for both ON UPDATE and ON DELETE.
A. Direct
B. Indirect
C. Existence
D. No
Answer : C

21. The normal form that is not necessarily dependency preserving is
A. 2NF
B. 3NF
C. BCNF
D. 4NF
Answer : A

22. 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

23. Consider the join of relation R with a relation S. If R has m tuples and S has n tuples, then the maximum and minimum size of the join respectively are
A. m+n and 0
B. m+n and |m-n|
C. mn and 0
D. mn and m+n
Answer : C

24. The ______ language consists of SQL statements for operating on the data (insert, Modify, Delete) in tables that already exist.
A. Data Manipulation
B. Data Definition
C. Data Control
D. None
Answer : A

25. 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

26. operator is used to compare a value to a list of literals values that have been specified.
A. Like
B. COMPARE
C. BETWEEN
D. IN
Answer : A

27. As per equivalence rules for query transformation, selection operation distributes over
A. Union.
B. Set difference.
C. Intersection.
D. All of the above.
Answer : D

28. Which of the following is not a logical database structure?
A. Chain
B. Network
C. Tree
D. Relational
Answer : A

29. ____ table store information about database or about the system.
A. SQL
B. System
C. Nested
D. None of these
Answer : B

30. Grant and revoke are _____ statements.
A. TCL
B. DCL
C. DDL
D. DML
Answer : B

31. Which of the following is true for network structure?
A. It is a physical representation of the data.
B. It allows many to many relationship.
C. It is conceptually simple.
D. It will be the dominant database of the future.
Answer : A

32. A transaction is in state after the final statement has been executed.
A. partially committed
B. active
C. committed
D. none of the above
Answer : C

33. Employees in a company are each assigned their own office, i.e. for each employee there exists a unique office and for each office there exists a unique employee; This statement is an example of ____ type of relation.
A. 1:1
B. 1: Many
C. Many: One
D. Many : Many
Answer : A

34. ______is a special type of integrity constraint that relates two relations & maintains consistency across the relations.
A. Domain Integrity Constraints
B. Referential Integrity Constraints
C. Domain Constraints
D. Entity Integrity Constraints
Answer : B

35. In an ER model,_____ is described in the database by storing its data.
A. Entity
B. Attribute
C. Relationship
D. Notation
Answer : A

36. Which of the following addressing modes permits relocation without any change over in the code?
A. Indirect addressing
B. Indexed addressing
C. PC relative addressing
D. Base register addressing
Answer : B

37. ………………… 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

38. Which of the syntax is correct for insert statement?
i) insert into values
ii) insert into (column list) values
A. i-only
B. ii-only
C. Both of them
D. None of them
Answer : C

39. 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

40. 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

41. Isolation of the transactions is ensured by
A. Transaction management
B. Application programmer
C. Concurrency control
D. Recovery management
Answer : C

42. The relational model is based on the concept that data is organized and stored in two-dimensional tables called ______
A. Fields
B. Records
C. Relations
D. Keys
Answer : C

43. In SQL the word natural can be used with
A. inner join
B. full outer join
C. right outer join
D. all of the above
Answer : A

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

45. Which is the best file organization when data is frequently added or deleted from a file?
A. Sequential
B. Direct
C. Index sequential
D. None of the above
Answer : B

46. 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

47. 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

48. HSAM stands for ……….
A. Hierarchic Standard Access Method
B. Hierarchic Sequential Access Method
C. Hierarchic Sequential and Method
D. Hierarchic Standard and Method
Answer : B

49. Which of the following relational algebra operations do not require the participating tables to be union-compatible?
A. Union
B. Intersection
C. Difference
D. Join
Answer : D

50. In SQL, testing whether a subquery is empty is done using
A. DISTINCT
B. UNIQUE
C. NULL
D. EXISTS
Answer : D