MCQs on Advanced Database Management System (DBMS) can be quite frustrating for those who are not well-versed in the topic. However, with a little bit of preparation, you can defeat most DBMS MCQs with ease. Here are the 50 most important advanced DBMS MCQs with answers that will help you to crack the exams.
Advanced Database Management System MCQ with Answers. Advanced DBMS MCQ questions are very useful for the preparation for MCA, BCA, MSC IT, BSC IT, GATE, NET, and other Academic and Competitive Exams.
Brief about Advanced Database Management System
Advanced Database Management System (DBMS) encompasses the design, implementation, management, and organization of databases. DBMS technology allows for the efficient retrieval of information by supporting different query languages.
The following are some DBMSs that are commonly used in business: Oracle, MySQL, Microsoft SQL Server, PostgreSQL, and MongoDB. A DBMS is a critical component of any information system and should be selected carefully to meet the specific needs of a given organization.
What is Advanced Database Management System
Advanced Database Management System (ADBMS) is a type of database management system (DBMS) that provides an enterprise with advanced capabilities for managing data, including advanced data modeling and analysis, improved data security, scalability, and performance optimization.
ADBMS typically provides additional functionality, such as data warehousing, data mining, data lakes, and business intelligence capabilities, compared to a standard DBMS. These advanced capabilities allow businesses to better utilize their data to gain insight and make decisions.
72 Advanced Database Management System MCQ with Answers.
1. What is a repository of data, intended to assist proficient storage of data, retrieval and preservation called?
a. DBMS
b. ADBMS
c. Database
d. RDBMS
[expand title="Show Answer"]Answer: (C)[/expand]
2. DBMS can provide the simultaneous implementation of different portions of the database. (True/False)
[expand title="Show Answer"]Answer: (T)[/expand]
3. For sharing data among clients, the most frequent way is the creation of two-tier client/server databases. (True/False)
[expand title="Show Answer"]Answer: (T)[/expand]
4. An application program comprises two components, one being the GUI. Name the other component.
a) Presentation logic
b) Business logic
c) Message logic
d) User interface logic
[expand title="Show Answer"]Answer: (B)[/expand]
5. The requirements of information from various branches as well as divisions are successfully supported by a ___ database.
[expand title="Show Answer"]Answer: (Enterprise)[/expand]
6. In a ___ schema, we organize data into a structure that appears as a tree.
[expand title="Show Answer"]Answer: (Hierarchical schema)[/expand]
7. Network schema provides permission for only 1:1 relationships. (True/False)
[expand title="Show Answer"]Answer: (F)[/expand]
8. In the case of relational schema, every tuple is separated into fields which we call ___.
[expand title="Show Answer"]Answer: (Domains)[/expand]
9. Which of the following is not considered a logical structure of the database?
a) Tree
b) Relational
c) Network
d) Chain
[expand title="Show Answer"]Answer: (D)[/expand]
10. Relational model makes use of some unknown terminology. A tuple is said to be equal to a ___.
[expand title="Show Answer"]Answer: (Network)[/expand]
11. Logical data structure having a 1:M relationship is considered as a:
a) Network
b) Tree
c) Chain
d) Relation
[expand title="Show Answer"]Answer: (B)[/expand]
12. It is easy to preserve and update the ___ database
[expand title="Show Answer"]Answer: (Centralized)[/expand]
13. In the case of distributed database, data is handled by numerous servers. (True/False)
[expand title="Show Answer"]Answer: (T)[/expand]
15. QBE stands for ___.
[expand title="Show Answer"]Answer: (Query by example)[/expand]
16. Domain integrity is also called ‘___’ integrity.
[expand title="Show Answer"]Answer: (Attribute)[/expand]
17. There are two types of DROP commands: CASCADE and RISTRICT (True/False)
[expand title="Show Answer"]Answer: (T)[/expand]
18. ___ command helps for the creation of SQL relations.
[expand title="Show Answer"]Answer: (Create)[/expand]
19. With the help of WHERE and ___ commands it is possible to embed a SQL statement into another.
[expand title="Show Answer"]Answer: (HAVING)[/expand]
20. It is not possible to query multiple relations in SQL. (True/ False)
[expand title="Show Answer"]Answer: (F)[/expand]
21. A ___ is a subschema in which logical tables are generated from more than one base table.
[expand title="Show Answer"]Answer: (View)[/expand]
22. During the query execution contents are taken from other tables. (True/False)
[expand title="Show Answer"]Answer: (T)[/expand]
23. To recognize embedded SQL requests to the pre-processor, we use the ___ statement.
[expand title="Show Answer"]Answer: (EXEC SQL)[/expand]
24. It is a good practice to append a colon before the host variables to differentiate them from other variables used in SQL. (True/False)
[expand title="Show Answer"]Answer: (T)[/expand]
25. SQL offers ___ statements that make easy the process of concurrent transaction control.
[expand title="Show Answer"]Answer: (Two)[/expand]
26. In transaction processing, the integrity rules of a database are maintained by ___ property.
[expand title="Show Answer"]Answer: (Consistency)[/expand]
27. ___ permits to create and submit SQL queries dynamically or run time
a) Miscellaneous SQL
b) Dynamic SQL
c) Data Definition Language
d) SQL Preprocessor
[expand title="Show Answer"]Answer: (B)[/expand]
28. Using dynamic SQL, programs cannot create SQL queries as strings at run time. (True/ False)
[expand title="Show Answer"]Answer: (F)[/expand]
29. SQL is supported by RDBMS. (True/False)
[expand title="Show Answer"]Answer: (F)[/expand]
30. SELECT, INSERT, DELETE and UPDATE commands are used by ___ to modify the data.
[expand title="Show Answer"]Answer: (DML)[/expand]
31. Decomposition helps to reduce data redundancy. (True/False)
[expand title="Show Answer"]Answer: (T)[/expand]
32. Functional dependencies can be used to refine the ___.
[expand title="Show Answer"]Answer: (Schema)[/expand]
33. Which of the following is preferred when there is a disagreement between data items in a database?
a) Redundancy
b) Inconsistency
c) Anomaly
d) Normalisation
[expand title="Show Answer"]Answer: (B)[/expand]
34. When the data values are stored repeatedly in multiple copies in the database, it is known as ___.
[expand title="Show Answer"]Answer: (Redundancy)[/expand]
35. How does Normalisation help?
a) By eliminating various database anomalies
b) By minimizing redundancy
c) By eliminating data inconsistency
d) All of the above
[expand title="Show Answer"]Answer: (D)[/expand]
36. An attribute (column) is said to be ___ if its value can be determined by anyone or more attributes of the primary key, but not all.
[expand title="Show Answer"]Answer: (Partially dependent)[/expand]
37. A table that is in ___ normal form may contain redundancies due to transitive dependencies.
[expand title="Show Answer"]Answer: (Second)[/expand]
38. The Fifth Normal form is usually useful when we have large relational data models. (True/False)
[expand title="Show Answer"]Answer: (T)[/expand]
39. The join dependency is a more generalized form of ___ dependency.
[expand title="Show Answer"]Answer: (Multi-valued)[/expand]
40. An FD is a special case of an MVD and every FD is an MVD. (True/False)
[expand title="Show Answer"]Answer: (T)[/expand]
41. The fifth normal form is also called ___.
[expand title="Show Answer"]Answer: (Project-Join Normal Form (PJNF))[/expand]
42. From a ___ point of view, it is standard to have tables that are in the Third Normal Form.
[expand title="Show Answer"]Answer: (Rational model)[/expand]
43. According to relational database rules, a completely normalized database always has the best performance. (True/False).
[expand title="Show Answer"]Answer: (F)[/expand]
44. Denormalisation is done to increase the performance of the database. (True/False).
[expand title="Show Answer"]Answer: (T)[/expand]
45. Denormalisation is a technique to move from higher to lesser normal forms of database modelling in order to get faster access to the database. (True/ False)
[expand title="Show Answer"]Answer: (T)[/expand]
46. ___ splits tables by rows, thus reducing the number of records per table.
[expand title="Show Answer"]Answer: (Horizontal Fragmentation)[/expand]
47. SQL commands define the actions to be taken to control ___.
[expand title="Show Answer"]Answer: (Transaction Execution)[/expand]
48. ___ is formed with the combination of PK and FK.
[expand title="Show Answer"]Answer: (Referential Integrity)[/expand]
49. ___ may be avoided if an appropriate index exists to allow ordered access to the records.
[expand title="Show Answer"]Answer: (Sorting)[/expand]
50. Relations are said to be Union compatible if they have the same ___ and that from the same domain.
[expand title="Show Answer"]Answer: (Attributes)[/expand]
51. MQO (Multi Query Optimisation) saves the evaluation cost and execution time by executing the common operations once over a set of queries (True/False)
[expand title="Show Answer"]Answer: (T)[/expand]
52. ___ relies on nested loop joins for implementation.
[expand title="Show Answer"]Answer: (Navigational strategies)[/expand]
53. ___ works reversely it starts with the subquery first and after that executes the outer query.
[expand title="Show Answer"]Answer: (Reverse lookup)[/expand]
54. It is required to validate update operations against stated relational database constraints (True/False)
[expand title="Show Answer"]Answer: (T)[/expand]
55. ___ is defined as a set of rows that encode the changes made to a specific base table.
[expand title="Show Answer"]Answer: (Delta stream)[/expand]
56. ___ represents a relational calculus expression.
[expand title="Show Answer"]Answer: (Query graph)[/expand]
57. The query graph representation also indicates an order in which operations perform first. (True/False).
[expand title="Show Answer"]Answer: (F)[/expand]
58. Semantic query optimisation helps inefficient query ___ by modifying one query into another.
[expand title="Show Answer"]Answer: (Execution)[/expand]
59. Relational database constraints are used in semantic query optimization techniques. (True/False)
[expand title="Show Answer"]Answer: (T)[/expand]
60. The key to achieving good stream processing performance is to optimise ___ together.
[expand title="Show Answer"]Answer: (Multiple queries)[/expand]
61. The system knows the blocks containing the tuples of R, and it is not possible to get the blocks one by one. (True/ False)
[expand title="Show Answer"]Answer: (F)[/expand]
62. We can use the index not only to get all the tuples of the relation it indexes but also ___.
[expand title="Show Answer"]Answer: (Secondary)[/expand]
63. It is an open function that initiates the process of getting tuples, but it does not get a tuple.
(True/ False)
[expand title="Show Answer"]Answer: (T)[/expand]
64. The selection of an algorithm for each operator is one of the most fundamental elements of the process of transformation of a logical query plan into a physical query plan. (True/ False)
[expand title="Show Answer"]Answer: (T)[/expand]
65. Tuple-at-a-time, unary operations require neither ___ nor ___.
[expand title="Show Answer"]Answer: (F)[/expand]
66. ___ joins can be used for relations of any size. One relation does not need to necessarily fit in the main memory.
[expand title="Show Answer"]Answer: (Nested-loop)[/expand]
67. Nested-loop does not allow us to avoid storing intermediate relations on disk in some situations. (True/ False)
[expand title="Show Answer"]Answer: (F)[/expand]
68. In ___ algorithms, data is read into the main memory from the operand relations.
[expand title="Show Answer"]Answer: (merged)[/expand]
69. In the second pass, all the sorted sublists are ___.
[expand title="Show Answer"]Answer: (Two-pass)[/expand]
70. If there are M buffers available and we can pick M as the number of buckets, we can gain a factor of M in the size of the relations that we can handle. (True/ False)
[expand title="Show Answer"]Answer: (T)[/expand]
71. The essential idea behind all hash-based algorithms is ___.
[expand title="Show Answer"]Answer: (Last)[/expand]
72. The existence of an index on one or more attributes of relation makes available some algorithms that ___.
[expand title="Show Answer"]Answer: (Non-clustering)[/expand]
If you need more MCQs of Advanced Database System click here on the link
Advanced-Data Structure MCQ sample papers with answers
Advanced Database Management System Quiz
Test your knowledge of the latest advancements in database management systems and find out if you are up-to-date with the latest trends in the industry. This quiz will assess your understanding of database systems and the technologies that drive them, allowing you to gain a better understanding of the technology behind the world’s leading database management systems. Take the quiz now and see how much you know!
Conclusion
The Advanced Database Management System MCQ with Answers quiz was a success. I hope the quiz might beneficial in testing your knowledge of the advanced database management system. You have enjoyed taking the quiz and found it helpful in reinforcing your understanding of the material.
I hope that you found this quiz helpful and informative, if so please share it on all forms of social media with your friends and family members. If you have any queries please free to contact us.
Read More MCQs:
- Grid Computing MCQs
- Computer awareness MCQ Quiz
- Computer Aptitude Question with answers
- Computer General Knowledge Questions and Answers
Good questions