

MCQOPTIONS
Saved Bookmarks
This section includes 175 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
51. |
Which one of the following is a set of one or more attributes taken collectively to uniquely identify a record? |
A. | Candidate key |
B. | Sub key |
C. | Super key |
D. | Foreign key |
Answer» D. Foreign key | |
52. |
A _____ is a property of the entire relation, rather than of the individual tuples in which each tuple is unique. |
A. | Rows |
B. | Key |
C. | Attribute |
D. | Fields |
Answer» C. Attribute | |
53. |
A _________ integrity constraint requires that the values appearing in specified attributesof any tuple in the referencing relation also appear in specified attributes of at least one tuple inthe referenced relation. |
A. | Referential |
B. | Referencing |
C. | Specific |
D. | Primary |
Answer» B. Referencing | |
54. |
An attribute in a relation is a foreign key if the _______ key from one relation is used as an attribute in that relation. |
A. | Candidate |
B. | Primary |
C. | Super |
D. | Sub |
Answer» C. Super | |
55. |
Using the SQL GROUP BY phrase with a SELECT statement can help detect which of the following problems? |
A. | The multivalue, multicolumn problem |
B. | The inconsistent values problem |
C. | The missing values problem |
D. | The general-purpose remarks column problem |
Answer» C. The missing values problem | |
56. |
The ______ is the one in which the primary key of one relation is used as a normal attribute in another relation. |
A. | Referential relation |
B. | Referencing relation |
C. | Referenced relation |
D. | Referred relation |
Answer» D. Referred relation | |
57. |
Which is a bottom-up approach to database design that design by examining the relationship between attributes: |
A. | Functional dependency |
B. | Database modeling |
C. | Normalization |
D. | Decomposition |
Answer» D. Decomposition | |
58. |
Which is a bottom-up approach to database design that design by examining the relationship between attributes: |
A. | Functional dependency |
B. | Database modeling |
C. | Normalization |
D. | Decomposition |
Answer» D. Decomposition | |
59. |
In a relational database a referential integrity constraint can be specified with the help of |
A. | primary key |
B. | foreign key |
C. | secondary key |
D. | none of the above |
Answer» C. secondary key | |
60. |
We can use the following three rules to find logically implied functional dependencies. This collection of rules is called |
A. | Axioms |
B. | Armstrong s axioms |
C. | Armstrong |
D. | Closure |
Answer» C. Armstrong | |
61. |
Which of the following has each related entity set has its own schema and there is an additional schema for the relationship set? |
A. | A many-to-many relationship set |
B. | A multivalued attribute of an entity set |
C. | A one-to-many relationship set |
D. | None of the mentioned |
Answer» B. A multivalued attribute of an entity set | |
62. |
Suppose now that R(A,B:) and S(A,B:) are two relations with r and s tuples, respectively(again, not necessarily distinct). If m is the number of (not necessarily distinct) tuples in theresult of the SQL query: R intersect S; Then which of the following is the most restrictive, correct condition on the value of m? |
A. | m = min(r,s) |
B. | 0 <= m <= r + s |
C. | min(r,s) <= m <= max(r,s) |
D. | 0 <= m <= min(r,s) |
Answer» E. | |
63. |
The relation with the attribute which is the primary key is referenced in another relation. The relation which has the attribute as primary key is called |
A. | Referential relation |
B. | Referencing relation |
C. | Referenced relation |
D. | Referred relation |
Answer» D. Referred relation | |
64. |
Entity Relationship model consists of collection of basic objects called _________ and relationship among these objects. |
A. | functions |
B. | models |
C. | None of these |
D. | entities |
Answer» E. | |
65. |
Which of the syntax is correct for insert statement?
i) insert into
|
A. | i-only |
B. | ii-only |
C. | Both of them |
D. | None of them |
Answer» D. None of them | |
66. |
A _____ is a property of the entire relation, rather than of the individual tuples in Which each tuple is unique. |
A. | Rows |
B. | Key |
C. | Attribute |
D. | Fields |
Answer» C. Attribute | |
67. |
Which type of entity represents a logical generalization whose actual occurrence is represented by a second, associated entity? |
A. | Supertype entity |
B. | Subtype entity |
C. | Archetype entity |
D. | Instance entity |
Answer» D. Instance entity | |
68. |
Which of the following schemas defines a view or views of the database for particular users? |
A. | External |
B. | Conceptual |
C. | Internal |
D. | None of these |
Answer» C. Internal | |
69. |
Which is proper subset designed to support views belonging to different classes of users in order to hid or protect information: |
A. | Schema |
B. | Subschema |
C. | Non-schema |
D. | None-subschema |
Answer» C. Non-schema | |
70. |
View the Exhibit and examine the structure of the EMPLOYEES and DEPARTMENTS tables. Which SET operator would you use in the blank space in the following SQL statement to list the departments where all the employees have managers? SELECT department_id FROM departments ____ SELECT department_id FROM employees WHERE manager_id IS NULL; |
A. | UNION |
B. | MINUS |
C. | INTERSECT |
D. | UNION ALL |
Answer» C. INTERSECT | |
71. |
Inst_dept (ID, name, salary, dept name, building, budget) is decomposed into instructor (ID, name, dept name, salary) department (dept name, building, budget) This comes under |
A. | Lossy-join decomposition |
B. | Lossy decomposition |
C. | Lossless-join decomposition |
D. | Both Lossy and Lossy-join decomposition |
Answer» E. | |
72. |
The relation employee(ID,name,street,Credit,street,city,salary) is decomposed intoemployee1 (ID, name)employee2 (name, street, city, salary) This type of decomposition is called |
A. | Lossless decomposition |
B. | Lossless-join decomposition |
C. | All of the mentioned |
D. | None of the mentioned |
Answer» E. | |
73. |
The ____ lock allows concurrent transactions to access the same row as long as they require the use of different fields within that row. |
A. | table-level |
B. | page-level |
C. | row-level |
D. | field-level |
Answer» E. | |
74. |
____ means that the data used during the execution of a transaction cannot be used by a second transaction until the first one is completed. |
A. | Atomicity |
B. | Consistency |
C. | Durability |
D. | Isolation |
Answer» E. | |
75. |
A DBMS uses a transaction ____ to keep track of all transactions that update the database |
A. | log |
B. | table |
C. | block |
D. | Statement |
Answer» B. table | |
76. |
A(n) ____ lock exists when concurrent transactions are granted Read access on the basis of a common lock. |
A. | binary |
B. | field-level |
C. | shared |
D. | Exclusive |
Answer» D. Exclusive | |
77. |
All transactions are controlled and executed by the DBMS (subject to some limitations) to guarantee database ____. |
A. | integrity |
B. | uniqueness |
C. | consistency |
D. | Design |
Answer» B. uniqueness | |
78. |
If the complete execution of the transaction(s) takes the database from one consistent state to the other then that property of transaction is called: |
A. | Isolation |
B. | Durability |
C. | Consistency preservation |
D. | None of the above |
Answer» D. None of the above | |
79. |
Consider a directed line(->) from the relationship set advisor to both entity sets instructor and student. This indicates _________ cardinality |
A. | One to many |
B. | One to one |
C. | Many to many |
D. | Many to one |
Answer» C. Many to many | |
80. |
A .................. normal form, normalization will be needed where all attributes in a relation tuple are not functionally dependent only on the key attribute. |
A. | First |
B. | Second |
C. | Third |
D. | Fourth |
Answer» D. Fourth | |
81. |
A .................. normal form, normalization will be needed where all attributes in a relation are not functionally dependent only on the key attribute. |
A. | First |
B. | Second |
C. | Third |
D. | Fourth |
Answer» D. Fourth | |
82. |
Which forms every non-prime attribute is fully dependent functionally on the candidate key of a relational schema: |
A. | 1NF |
B. | 2NF |
C. | 3NF |
D. | 5NF |
Answer» C. 3NF | |
83. |
In the PL/SQL block below, how many rows will be inserted in the messages table? DECLARE v_start_salesNUMBER := 2; v_end_sales NUMBER := 100; BEGIN FOR i IN v_start_sales..v_end_sales LOOP INSERT INTO messages(msgid) VALUES v_start_sales; END LOOP; END; |
A. | 0 |
B. | 99 |
C. | 1 |
D. | 100 |
Answer» C. 1 | |
84. |
We indicate roles in E-R diagrams by labeling the lines that connect ___________ to __________ |
A. | Diamond , diamond |
B. | Rectangle, diamond |
C. | Rectangle, rectangle |
D. | Diamond, rectangle |
Answer» E. | |
85. |
In the schema (dept name, size) we have relations total inst 2007, total inst 200Q:8) Which dependency have lead to this relation ? |
A. | Dept name, year->size |
B. | Year->size |
C. | Dept name->size |
D. | Size->year |
Answer» B. Year->size | |
86. |
What will be the number of columns of CARTESIAN PRODCUT if the participating relations have 5 and 20 rows respectively? |
A. | 5 |
B. | 20 |
C. | 25 |
D. | 100 |
Answer» E. | |
87. |
Which of the following operations need the participating relations to be union compatible? |
A. | UNION |
B. | INTERSECTION |
C. | DIFFERENCE |
D. | All of the above |
Answer» E. | |
88. |
Consider a relation R(A,B,C,D,E) with the following functional dependencies:ABC -> DE andD -> AB The number of superkeys of R is: |
A. | 2 |
B. | 7 |
C. | 10 |
D. | 12 |
Answer» D. 12 | |
89. |
The DBMS utility...................... allows reconstructing the correct state of database from the backup and history of transactions. |
A. | Backup |
B. | Recovery |
C. | Monitoring |
D. | Data loading |
Answer» C. Monitoring | |
90. |
The DBMS utility, ____________ allows to reconstruct the correct state of database from the backup and history of transactions. |
A. | Backup |
B. | Recovery |
C. | Monitoring |
D. | Data loading |
Answer» C. Monitoring | |
91. |
When a program is abnormally terminated, the equivalent of a ____ command occurs. |
A. | COMMIT |
B. | ROLLBACK |
C. | QUIT |
D. | EXIT |
Answer» B. ROLLBACK | |
92. |
Which refers to a property of computer to run several operation simultaneously and possible as computers await response of each other: |
A. | Concurrency |
B. | Deadlock |
C. | Backup |
D. | Recovery |
Answer» B. Deadlock | |
93. |
Which is refers to a stalemate situation due to which no further progress is possible as computer await response of each other: |
A. | Concurrency |
B. | Deadlock |
C. | Backup |
D. | Recovery |
Answer» C. Backup | |
94. |
Which of the following is the preferred way to recover a database after a transaction in progress terminates abnormally? |
A. | Rollback |
B. | Rollforward |
C. | Switch to duplicate database |
D. | Reprocess transactions |
Answer» B. Rollforward | |
95. |
Choose the RDBMS which supports full edged client server application development |
A. | dbase v |
B. | oracle 7.1 |
C. | foxpro 2.1 |
D. | ingress |
Answer» C. foxpro 2.1 | |
96. |
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 granted. |
C. | It will immediately be reject |
Answer» C. It will immediately be reject | |
97. |
Deadlocks are possible only when one of the transactions wants to obtain a(n) ____ lock on a data item. |
A. | binary |
B. | exclusive |
C. | shared |
D. | Complete |
Answer» C. shared | |
98. |
Which of the following consists of a row of column headings, together with zero or more rows of data values? |
A. | COMPOSITE INDEX |
B. | UNIQUE INDEX |
C. | TABLE |
D. | None of the above |
Answer» D. None of the above | |
99. |
Which of the following is a structure that provides faster access to the rows of a table based on the values of one or more columns? |
A. | Table |
B. | View |
C. | Index |
D. | None of the above |
Answer» D. None of the above | |
100. |
For every relationship, how many possible types of actions are there when enforcing minimum cardinalities? |
A. | Two |
B. | Three |
C. | Four |
D. | Six |
Answer» E. | |