NEET - DBMS 1000+ MCQ [Solved] PDF Download

1. Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R.
A. It will result in a deadlock situation.
B. It will immediately be rejected.
C. It will immediately be granted.
D. It will be granted as soon as it is released by A .
Answer : C

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

3. The statement that is executed automatically by the system as a side effect of the modification of the database is
A. backup
B. assertion
C. recovery
D. trigger
Answer : D

4. The _____ category includes storage media that can be operated on directly by the computers central processing unit.
A. Primary storage
B. Secondary Storage
C. All
D. Tertiary Storage
Answer : A

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

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

7. An outstanding functionality of SQL is its support for automatic_____ to the target data.
A. programming
B. navigation
C. functioning
D. notification
Answer : B

8. DFD stands for
A. Data Flow Document
B. Data File Diagram
C. Data Flow Diagram
D. Non of the above
Answer : C

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

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

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

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

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

14. Which of the following relational algebraic operations is not from set theory?
A. Union
B. Intersection
C. Cartesian Product
D. Select
Answer : D

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

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

17. An advantage of views is
A. Data security
B. Derived columns
C. Hiding of complex queries
D. All of the above
Answer : A

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

19. Manager salary details are hidden from the employee .This is
A. Conceptual level data hiding.
B. External level data hiding.
C. Physical level data hiding.
D. None of these.
Answer : A

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

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

22. Relations produced from an E-R model will always be
A. First normal form.
B. Second normal form.
C. Third normal form.
D. Fourth normal form.
Answer : A

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

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

25. The cost of reading and writing temporary files while evaluating a query can be reduced by
A. building indices
B. pipelining
C. join ordering
D. none of the above
Answer : B

26. The graphical representation of a query is .
A. B-Tree
B. graph
C. Query Tree
D. directed graph
Answer : C

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

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

29. In an ER diagram the ___shape specifies the Attibute and a ____ shape specifies the primary key attribute.
A. Oval; An oval with an underlined attribute
B. Circle; A circle with bolded attribute inside it
C. Diamond; A bolded attribute
D. Square; An attribute within the square
Answer : A

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

31. Which of the following ensures the atomicity of the transaction?
A. Transaction management component of DBMS
B. Application Programmer
C. Concurrency control component of DBMS
D. Recovery management component of DBMS
Answer : A

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

33. A table can have only one
A. Secondary key
B. Alternate key
C. Unique key
D. Primary key
Answer : D

34. A top-to-bottom relationship among the items in a database is established by a
A. Hierarchical schema
B. Network schema
C. Relational Schema
D. All of the above
Answer : A

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

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

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

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

39. In an E-R, Y is the dominant entity and X is a subordinate entity. Then which of the following is incorrect :
A. Operationally, if Y is deleted, so is X
B. existence is dependent on Y.
C. Operationally, if X is deleted, so is Y.
D. Operationally, if X is deleted, & remains the same.
Answer : C

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

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

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

43. What is data integrity?
A. It is the data contained in database that is non redundant.
B. It is the data contained in database that is accurate and consistent.
C. It is the data contained in database that is secured.
D. It is the data contained in database that is shared.
Answer : B

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

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

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

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

48. ____specifies a search condition for a group or an aggregate.
A. GROUP BY Clause
B. HAVING Clause
C. FROM Clause
D. WHERE Clause
Answer : B

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

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