DBMS MCQ Solved Paper for LIC AAO

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

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

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

4. The part of a database management system which ensures that the data remains in a consistent state is
A. authorization and integrity manager
B. buffer manager
C. transaction manager
D. file manager
Answer : C

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

6. _______ product was acquired by Informix, integrated into its RDBMS and introduced as the Informix Universal Server an ORDBMS.
A. Star
B. llustar
C. SQL
D. Cygnus
Answer : B

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

8. The data models defined by ANSI/SPARC architecture are
A. Conceptual, physical and internal
B. Conceptual, view and external
C. Logical, physical and internal
D. Logical, physical and view
Answer : D

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

10. Which of the following constitutes a basic set of operations for manipulating relational data?
A. Predicate calculus
B. Relational calculus
C. Relational algebra
D. SQL
Answer : C

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

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

13. _____ First proposed the process of normalization.
A. Edgar. W
B. Edward Stephen
C. Edgar F. Codd
D. Edward Codd
Answer : C

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

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

16. A data type or format is specified for each _________
A. Relation
B. Tuple
C. Database
D. Domain
Answer : B

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

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

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

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

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

22. In multiple granularity of locks SIX lock is compatible with
A. IX
B. IS
C. S
D. SIX
Answer : B

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

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

25. Wait-for graph is used for
A. detecting view serializability.
B. detecting conflict serializability.
C. deadlock prevention
D. deadlock detection
Answer : D

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

27. _____ database is used to provide statistical information or summaries of values based on various criteria.
A. Statistical
B. Mathematical
C. Normalized
D. Un normalized
Answer : A

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

29. If both the functional dependencies : X�Y and Y�X hold for two attributes X and Y then the relationship between X and Y is
A. M:N
B. M:1
C.
D. 1:M
Answer : C

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

31. The normalization was first proposed by .
A. Code
B. Codd
C. Boyce Codd
D. Boyce
Answer : B

32. Checkpoints are a part of
A. Recovery measures.
B. Security measures.
C. Concurrency measures.
D. uthorization measures.
Answer : A

33. What is a disjoint less constraint?
A. It requires that an entity belongs to no more than one level entity set.
B. The same entity may belong to more than one level.
C. The database must contain an unmatched foreign key value.
D. An entity can be joined with another entity in the same level entity set.
Answer : A

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

35. ______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

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

37. The fact that information in the data warehouse changes far less often and may be regarded as non-real-time with periodic updating; This implies that data warehouses are _______
A. Volatile
B. Non - Volatile
C. Logical
D. Physical
Answer : B

38. The collection of information stored in a database at a particular moment is called as ......
A. schema
B. instance of the database
C. data domain
D. independence
Answer : B

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

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

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

42. Protection of data from unauthorized Disclosure results in loss of _______
A. Integrity
B. Availability
C. Confidentiality
D. Discretionary Security
Answer : C

43. The concept of mapping of ______ entity types is the concept in which the for each strong entity type E in the ER schema, create a relation R that includes all the simple attributes of E.
A. Regular
B. Irregular
C. None
D. Weak
Answer : A

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

45. The division operator divides a dividend A of degree m+n by a divisor relation B of degree n and produces a result of degree
A. m - 1
B. m + 1
C. m * m
D. m
Answer : D

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

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

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

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

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