DBMS GATE Questions

DBMS Questions For GATE

One of the best ways to master all the concepts from the Database Management section under the Computer Science subject is to practise hard these DBMS GATE Questions. Candidates can also explore further topics such as functional dependency, schema, clustering, data cleaning and so on. Our attempt here in this article below is to compile a collection of DBMS questions for GATE. Candidates are advised to practise these GATE CSE Question Paper to get the best results. Database Management is an important section found in the GATE CSE previous year paper, and solving these questions help the candidates to prepare more proficiently for the GATE exams.

Meanwhile, candidates can find the DBMS GATE Questions here, in this article below to solve and practise before the exams. They can refer to these DBMS GATE previous year questions and start preparing for the exams.

DBMS Questions for GATE

From Database Management Section of Computer Science and Engineering

MCQ – Single Answer DBMS GATE Questions

  1. If you take these entities ‘hotel room’, and ‘person’ with a many-to-many relationship, ‘lodging’ as shown in the figure below.

To store information about the rent payment to be made by person(s) occupying different hotel rooms, then this information should appear as an attribute of______

  1. Hotel Room
  2. Person
  3. Lodging
  4. None of the Above

2. From the basic ER and relational models given below, which of the statements below is “Incorrect”?

  1. An attribute of an entity can be composite
  2. In a row of a relational table, an attribute can have exactly one or Null value
  3. An attribute of an entity can have more than one value
  4. In a row of relational table, an attribute can have more than one value

3. Which of the given statements is considered “TRUE” about an SQL query?

P: An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause

Q: An SQL query can contain a HAVING clause only if it has a GROUP BY clause

R: All attributes used in the GROUP BY clause must appear in the SELECT clause

S: Not all attributes used in the GROUP BY clause need to appear in the SELECT clause

  1. P and R
  2. P and S
  3. Q and R
  4. Q and S

4. An instance of a relational scheme R(A, B, C) is given with distinct values for attribute A. Can you conclude that A is a candidate key for R?

(a) True

(b) False

5. Which normal form is considered adequate for normal relational database design?

(a) 3 N F

(b) 5 N F

(c) 2 N F

(d) 4 N F

6. The following table has two attributes, A and C, where A is the primary key and C is the foreign key referencing A with on-delete cascade.

















The set of all tuples that must be additionally deleted to preserve referential integrity. When the tuple (2,4) is deleted is:

(a) (3, 4) and (6, 4)

(b) (5,2) and (7,2)

(c) (5,2), (7,2) and (9,5)

(d) (3,4), (4,3) and (6,4)

7. Which of these statements below is/ are correct?

(a) SQL permits attribute names to be repeated in the same relation

(b) SQL query automatically eliminates duplicates

(c) SQL query will work if there are no indexes on the relations

(d) None of the above-mentioned

8. Given that the order of an internal node in a B+ tree, index is the maximum number of children it can have. Imagine a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. Then, what is the order of the internal node?

(a) 27

(b) 26

(c) 25

(d) 24

9. Referential Integrity constraints functions using the ________ concept

(a) Primary key

(b) Super key

(c) Foreign key

(d) Secondary key

10. From the statements mentioned below, which of them may result in an irrevocable error in a database system?

(a) Transaction reads a data item after it is written by an uncommitted transaction

(b) Transaction reads a data item after it is written by a committed transaction

(c) Transaction writes a data item after it is read by a committed transaction

(d) Transaction writes a data item after it is read by an uncommitted transaction

11. In a relational schema, every tuple is divided into fields, known as ______

(a) Queries

(b) Domains

(c) Relations

(d) None of the above

12. _____ is given as the logical design of the database, while the snapshot of the data in the database at a point in time is__________

(a) Database relation, attribute

(b) Database schema, attribute domain

(c) Database schema, database instance

(d) Attribute domain, attribute value

13. The set of attributes X will be fully functionally dependent on the set of attributes Y, if one of the conditions given below is met. What is it?

  1. X is not functionally dependent on any sub-set of Y
  2. X is functionally dependent on Y
  3. None
  4. both(a) and (b)

14. _____ is an aggregate function in SQL.

  1. Ordered by
  2. Distinct
  3. Avg
  4. Select

15. ________ of the following in place sorting algorithms needs the minimum number of swaps.

  1. Selection sort
  2. Insertion sort
  3. Heap sort
  4. Quick sort

16. What does an Embedded pointer provide?

  1. A physical record key
  2. A prime key
  3. An inverted index
  4. A secondary access path

17. A hashing function in a Hierarchical database is used to locate the_____

  1. Records
  2. Collision
  3. Foreign key
  4. Root

18. Which among the following is a true statement?

(i) Lossless, dependency preserving decomposition into 3NF is always possible

(ii) Any relation with two attributes is in BCNF

  1. (i)
  2. (ii)
  3. (i) and (ii)
  4. None of the above

19. Which is the maximum number of super keys for the relation schema R(X,Y,Z,W) with X as the key?





20. Which of the following is not part of the ACID properties?

  1. Consistency
  2. Atomicity
  3. Inconsistency
  4. Isolation

21. The fields on which clustering index is defined are of type_____

  1. Key and non-ordering
  2. Non-key and ordering
  3. Key and ordering
  4. Non-key and non-ordering

22. What is the command used to remove a relation from an SQL database?

  1. Remove table
  2. Update table
  3. Drop table
  4. Delete table

23. Every functional dependency that is in set E and also in closure of F is classified as______

  1. F plus is covered by E
  2. E is covered by F
  3. FD is covered by E
  4. F is covered by E

24. What is “AS” clause in SQL used for?

  1. Selection Operation
  2. Join Operation
  3. Projection Operation
  4. Rename Operation

25. If a block can hold either 3 records or 10 key pointers and a database contains “n” records, then how many blocks do we need to hold the data file and the dense index?


(b) N/10

(c) N/30

(d) N/3

26. From the given desired features, which are beyond the capability of relational algebra?

(a) Multiplication

(b) Finding transitive closure

(c) Aggregate computation

(d) All the above

27. In conservative two phase locking protocol, a transaction_____

  1. Should release exclusive locks only post the commit operation
  2. Should acquire all the locks at the beginning of transaction
  3. Should acquire all the exclusive locks at the beginning of transaction
  4. Should release all the locks only at beginning of transaction

28. ______ is not modification of database.

  1. Updating
  2. Deletion
  3. Sorting
  4. Insertion

29. ______ is based on Multi Valued Dependency.

  1. First
  2. Second
  3. Third
  4. Fourth

30. ______ is the operation to increase the length of a list.

  1. Look-up
  2. Modify
  3. Insert
  4. None of these

31. What refers to the completeness and the correctness of the data in a database?

  1. Data integrity
  2. Data security
  3. Data independence
  4. Data constraint

32. DML (Data Manipulation Language) is not used for________

  1. Insertion of new information into the Database
  2. Modification of information in the Database
  3. Deletion of information in the Database
  4. Creation of information table in the Database

33. What is a report generator used for?

  1. Print files on paper
  2. Update files
  3. Data entry
  4. None of these

34. What are database management systems intended for?

  1. Manage file access
  2. Establish relationships between records in different files
  3. Delete data redundancy
  4. None of the above

35. How many types of keys are there in Database Design?

  1. Primary key
  2. Candidate key
  3. Foreign key
  4. All the above

36. What does a scheme describe?

  1. Records and files
  2. Data elements
  3. Record relationships
  4. All of these

37. What does FD in DBMS stand for?

  1. Functional Data
  2. Facilitate Data
  3. Functional Dependency
  4. Facilitate Dependency

38. Row, in Mathematical term is referred as________

  1. Tuple
  2. Relation
  3. Domain
  4. Attribute

39. What do ODBC stand for?

  1. Oriented database connection
  2. Offline database connection
  3. Open database connection
  4. None of these

40. Queries to the database is_______

  1. Written in English
  2. Can aggregate functions such as SUM and COUNT
  3. Both (a) and (b)
  4. None of these

41. A program is a/an___ entity.

  1. Dormant
  2. Passive
  3. Hyperactive
  4. Active

42. Data warehouse supports______

  1. OLTP
  2. OLAP
  3. Operational Database
  4. both (a) and (b)

43. The Classification rules in Data Mining are extracted from______

  1. Information
  2. Database
  3. Decision Tree
  4. Data

44. What does the usage of Preemption and Transaction Rollback prevent?

(a) Deadlock situation

(b) Data manipulation

(c) Unauthorised usage of data files

(d) File preemption

45. Transaction manager________

  1. Maintains before and after database image
  2. Maintains appropriate concurrency control
  3. Maintains a log of transactions
  4. None of these

46. _______ contains complete record of all activities that affected the content of a database during a certain period of time.

  1. Report writer
  2. Transaction log
  3. Data manipulation language
  4. Query language

47. ________ is the highest isolation level in transaction management.

  1. Repeated read
  2. Uncommitted read
  3. Committed read
  4. Serializable

48. _________ are the commands used to control access over objects in relational database.

  2. QUE & QUIST
  4. None of the above

49. In a relation scheme R = (A, B, C, D, E, H) on which the following functional dependencies hold: {A–>B, BC–>D, E–>C, D–>A}, the candidate keys of R are______

  1. AE, BE
  2. AE, BE, DE
  3. AEH, BEH, BCH
  4. AEH, BEH, DEH

50. Select the TRUE statement from the following:

  1. A relation R is in 3NF if every non-prime attributes of R is completely functionally dependent on every key of R
  2. Every relation in 3NF is also in BCNF
  3. No relation can be in both 3NF and BCNF
  4. Every relation in BCNF is also in 3NF

Candidates can find access to further resources such as the GATE preparation materials or the GATE previous year papers at BYJU’S. Stay tuned and access more information when they go live!

Leave a Comment

Your Mobile number and Email id will not be published. Required fields are marked *