Advanced Database Management System MCQ with Answers |by softwaretechit

Advanced Database Management System MCQ with Answers. These questions are very useful for the preparation of competitive exams.

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?
c. Database
Ans. c) Database

2. DBMS can provide the simultaneous implementation of different portions of the database. (True/False)
Ans. True

3. For sharing data among clients, the most frequent way is the creation of two-tier client/server databases. (True/False)
Ans. True

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
Ans. b) Business logic

5. The requirements of information from various branches as well as divisions are successfully supported by a _________ database.
Ans. Enterprise

6. In a _________ schema, we organise data into a structure which appears as a tree.
Ans. Hierarchical schema

7. Network schema provides permission for only 1:1 relationships. (True/False)
Ans. False

8. In case of relational schema, every tuple is separated into fields which we call as _________.
Ans. Domains

9. Which of the following is not considered as a logical structure of the database?
a) Tree
b) Relational
c) Network
d) Chain
Ans. d) Chain

10. Relational model makes use of some unknown terminology. A tuple is said to be equal to a____.
Ans. Network

11. Logical data structure having 1:M relationship is considered as a:
a) Network b) Tree
c) Chain d) Relation
Ans. b) Tree

12. It is easy to preserve and update the _________ database
Ans. Centralised

13. In the case of distributed database, data is handled by numerous servers. (True/False)
Ans. True

15. QBE stands for _________.
Ans. Query by example

16. Domain integrity is also called as ‘_________’ integrity.
Ans. Attribute

17. There are two types of DROP commands: CASCADE and RISTRICT (True/False)
Ans. True

18. _________ command helps for the creation of SQL relations.
Ans. Create

19. With the help of WHERE and ______ commands it is possible to embed a SQL statement into another.

20. It is not possible to query multiple relations in SQL. (True/ False)
Ans. False

21. A ______ is a subschema in which logical tables are generated from more than one base table.
Ans. View

22. During the query execution contents are taken from other tables. (True/False)
Ans. True

23. To recognise embedded SQL requests to the pre-processor, we use the _________ statement.

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)
Ans. True

25. SQL offers _________ statements that make easy the process of concurrent transaction control.
Ans. Two

26. In transaction processing, the integrity rules of a database are maintained by _________ property.
Ans. Consistency

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
Ans. Dynamic SQL

28. Using dynamic SQL, programs cannot create SQL queries as strings at run time. (True/ False)
Ans. False

29. SQL is supported by RDBMS. (True/False)
Ans. False

30. SELECT, INSERT, DELETE and UPDATE commands are used by _______to modify the data.
Ans. DML

31. Decomposition helps to reduce data redundancy. (True/False)
Ans. True

32. Functional dependencies can be used to refine the _________.
Ans. Schema

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
Ans. (b) Inconsistency

34. When the data values are stored repeatedly in multiple copies in the database, it is known as________.
Ans. Redundancy

35. How does Normalisation help?
a) By eliminating various database anomalies
b) By minimising redundancy
c) By eliminating data inconsistency
d) All of the above
Ans. (d) All of the above

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.
Ans. Partially dependent

37. A table which is in ____ normal form may contain redundancies due to transitive dependencies.
Ans. Second

38. The Fifth Normal form is usually useful when we have large relational data models. (True/False)
Ans. True

39. The join dependency is a more generalised form of __________ dependency.
Ans. Multi-valued

40. An FD is a special case of an MVD and every FD is an MVD. (True/False)
Ans. True

41. The fifth normal form is also called __________.
Ans. Project-Join Normal Form (PJNF)

42. From a __________ point of view, it is standard to have tables that are in the Third Normal Form.
Ans. Rational model

43. According to relational database rules, a completely normalised database always has the best performance. (True/False).
Ans. False

44. Denormalisation is done to increase the performance of the database. (True/False).
Ans. True

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)
Ans. True

46. __________ splits tables by rows, thus reducing the number of records per table.
Ans. Horizontal Fragmentation

47. SQL commands defines the actions to be taken to control _________ .
Ans. Transaction Execution

48. _________ is formed with the combination of PK and FK.
Ans. Referential Integrity

49. ______________ may be avoided if an appropriate index exists to allow ordered access to the records.
Ans. Sorting

50. Relations are said to be Union compatible if they have the same _____________ and that to from same domain.
Ans. Attributes

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)
Ans. True

52. ___________ rely on nested loop joins for implementation.
Ans. Navigational strategies

53. __________ works reversely it starts with subquery first and after that executes the outer query.
Ans. Reverse lookup

54. It is required to validate update operations against stated relational database constraints (True/False)
Ans. True

55. ____________ is defined as a set of rows that encode the changes made to a specific base table.
Ans. Delta stream

56. _____________ represents a relational calculus expression.
Ans. Query graph

57. The query graph representation also indicates an order in which operations perform first. (True/False).
Ans. False

58. Semantic query optimisation helps inefficient query ____ by modifying one query into another.
Ans. Execution

59. Relational database constraints are used in semantic query optimisation technique. (True/False)
Ans. True

60. The key to achieving good stream processing performance is to optimise _______ together.
Ans. Multiple queries

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)
Ans. False

62. We can use the index not only to get all the tuples of the relation it indexes, but also _________.
Ans. Secondary

63. It is an open function that initiates the process of getting tuples, but it does not get a tuple.
(True/ False)
Ans. Open function

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)
Ans. True

65. Tuple-at-a-time, unary operations require neither _____________ nor _________.
Ans. False

66. _________ joins can be used for relations of any size. One relation does not need to necessarily fit in the main memory.
Ans. Nested-loop

67. Nested-loop does not allow us to avoid storing intermediate relations on disk in some situations. (True/ False)
Ans. False

68. In _________ algorithms, data is read into the main memory from the operand relations.
Ans. merged

69. In the second pass, all the sorted sublists are _________.
Ans. Two-pass

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)
Ans. True

71. The essential idea behind all hash-based algorithms is _________.
Ans. Last

72. The existence of an index on one or more attributes of relation makes available some algorithms that _________.
Ans. non-clustering

Post a Comment