MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1294 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.
| 351. |
For every relationship, how many possible types of actions are there when enforcingminimum cardinalities? |
| A. | Two |
| B. | Three |
| C. | Four |
| D. | Six |
| Answer» E. | |
| 352. |
The actions which are played in the order while recording it is called history. |
| A. | repeating |
| B. | redo |
| C. | replay |
| D. | undo |
| Answer» B. redo | |
| 353. |
Which are the types of integrity rule: |
| A. | Entity integrity |
| B. | Referential integrity |
| C. | Both |
| D. | None |
| Answer» C. Both | |
| 354. |
Which is a bottom-up approach to database design that design by examining therelationship between attributes: |
| A. | Functional dependency |
| B. | Database modeling |
| C. | Normalization |
| D. | Decomposition |
| Answer» D. Decomposition | |
| 355. |
The DBMS utility...................... allows reconstructing the correct state of database from the backupand history of transactions. |
| A. | Backup |
| B. | Recovery |
| C. | Monitoring |
| D. | Data loading |
| Answer» C. Monitoring | |
| 356. |
In precedence of set operators, the expression is evaluated from |
| A. | Left to left |
| B. | Left to right |
| C. | Right to left |
| D. | From user specification |
| Answer» C. Right to left | |
| 357. |
Which of the following is not true in case of triggers? |
| A. | Triggers accept parameters. |
| B. | Triggers are executed implicitly |
| C. | Execution of triggers is transparent to the users. |
| D. | A trigger can invoke another trigger. |
| Answer» B. Triggers are executed implicitly | |
| 358. |
A constraint requires that an entity belong to no more than one lower- level entity set. |
| A. | disjointness |
| B. | uniqueness |
| C. | special |
| D. | relational |
| Answer» B. uniqueness | |
| 359. |
The operation allows the combining of two relations by merging pairs of tuples, one from each relation, into a single tuple. |
| A. | select |
| B. | join |
| C. | union |
| D. | intersection |
| Answer» C. union | |
| 360. |
Drop Table cannot be used to drop a table referenced by a constraint. |
| A. | local key |
| B. | primary key |
| C. | composite key |
| D. | foreign key |
| Answer» E. | |
| 361. |
How many types of data independence: |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 362. |
Which is a duplicate copy of a file program that is stored on a different storagemedia than the original location: |
| A. | Concurrency |
| B. | Deadlock |
| C. | Backup |
| D. | Recovery |
| Answer» D. Recovery | |
| 363. |
The policy, allows the system to write modified blocks to disk even if the transactions that made those modifications have not all committed. |
| A. | force |
| B. | no-force |
| C. | steal |
| D. | no-steal |
| Answer» D. no-steal | |
| 364. |
The contains a list of pages that have been updated in the database buffer. |
| A. | dirty page table |
| B. | page table |
| C. | dirty redo |
| D. | all of the mentioned |
| Answer» B. page table | |
| 365. |
A relation is said to be in 3 NF if(i) it is in 2 NF (ii) non-key attributes are independent of one another (iii) key attribute is not dependent on part of a composite key (iv) has no multi-valued dependency |
| A. | i and iii |
| B. | i and iv |
| C. | i and ii |
| D. | ii and iv |
| Answer» D. ii and iv | |
| 366. |
The connective tests for set membership, where the set is a collection of values produced by a select clause. The connective tests for the absence of set membership. |
| A. | or, in |
| B. | not in, in |
| C. | in, not in |
| D. | in, or |
| Answer» D. in, or | |
| 367. |
The is the fastest and most costly form of storage, which is relatively small; its use is managed by the computer system hardware. |
| A. | cache |
| B. | disk |
| C. | main memory |
| D. | flash memory |
| Answer» B. disk | |
| 368. |
Every time attribute A appears, it is matched with the same value of attribute B, but not the samevalue of attribute C. Therefore, it is true that: |
| A. | A → B |
| B. | A → C |
| C. | A → (B, C). |
| D. | (B,C) → A. |
| Answer» B. A → C | |
| 369. |
An ________ is a set of entities of the same type that share the same properties, orattributes. |
| A. | Entity set |
| B. | Attribute set |
| C. | Relation set |
| D. | Entity model |
| Answer» B. Attribute set | |
| 370. |
Which mapping exists between the conceptual and internal levels: |
| A. | Conceptual |
| B. | Internal |
| C. | Both |
| D. | None |
| Answer» D. None | |
| 371. |
An entity set that does not have sufficient attributes to form a primary key is termed a |
| A. | strong entity set |
| B. | variant set |
| C. | weak entity set |
| D. | variable set |
| Answer» D. variable set | |
| 372. |
A(n) ____ lock exists when concurrent transactions are granted Read access onthe basis of a common lock. |
| A. | binary |
| B. | field-level |
| C. | shared |
| D. | Exclusive |
| Answer» D. Exclusive | |
| 373. |
For each attribute of a relation, there is a set of permitted values, called the of that attribute. |
| A. | domain |
| B. | relation |
| C. | set |
| D. | schema |
| Answer» B. relation | |
| 374. |
Let us consider phone_number ,which can take single or several values . Treating phone_numberasan _________ permits instructors to have several phone numbers (including zero) associated with them. |
| A. | Entity |
| B. | Attribute |
| C. | Relation |
| D. | Value |
| Answer» D. Value | |
| 375. |
What is not true about a view? |
| A. | It is a definition of a restricted portion of the database |
| B. | It is a security mechanism |
| C. | It is always updatable like any other table |
| D. | All are true |
| Answer» D. All are true | |
| 376. |
Which of the following hardware component is the most important to the operation of adatabase management system? |
| A. | High resolution video display |
| B. | Printer |
| C. | High speed, large capacity disk |
| D. | Mouse |
| Answer» D. Mouse | |
| 377. |
A is a query that retrieves rows from more than one table or view: |
| A. | start |
| B. | end |
| C. | join |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 378. |
The algorithm scans each index for pointers to tuples that satisfy an individual condition. |
| A. | a2 |
| B. | a4 |
| C. | a9 |
| D. | a6 |
| Answer» D. a6 | |
| 379. |
This extra information is usually maintained in the form of a at the client. |
| A. | cookie |
| B. | history |
| C. | remainder |
| D. | none of the mentioned |
| Answer» B. history | |
| 380. |
The purpose of an N-Ary association is: |
| A. | To capture a parent-child relationship |
| B. | To deal with one to many relationships |
| C. | To deal with relationships that involve more than two tables |
| D. | To represent an inheritance relationship |
| Answer» D. To represent an inheritance relationship | |
| 381. |
Relational calculus is a |
| A. | Procedural language. |
| B. | Non- Procedural language. |
| C. | Data definition language. |
| D. | High level language |
| Answer» C. Data definition language. | |
| 382. |
Relational Algebra is a __________ query language that takes two relations as input andproduces another relation as an output of the query. |
| A. | Relational |
| B. | Structural |
| C. | Procedural |
| D. | Fundamental |
| Answer» D. Fundamental | |
| 383. |
______states that primary keys should not be null: |
| A. | Entity integrity |
| B. | Referential integrity |
| C. | Both |
| D. | None |
| Answer» B. Referential integrity | |
| 384. |
FD stands for: |
| A. | Functional dependency |
| B. | Facilitate dependency |
| C. | Functional data |
| D. | Facilitate data |
| Answer» B. Facilitate dependency | |
| 385. |
If an index is the metadata and statistics continue to exists |
| A. | disabling |
| B. | dropping |
| C. | altering |
| D. | both disabling and dropping |
| Answer» B. dropping | |
| 386. |
is around one-half of the maximum seek time. |
| A. | access time |
| B. | average seek time |
| C. | seek time |
| D. | rotational latency time |
| Answer» C. seek time | |
| 387. |
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. | consistency |
| B. | atomicity |
| C. | durability |
| D. | isolation |
| Answer» E. | |
| 388. |
The concept of locking can be used to solve the problem of |
| A. | Lost update |
| B. | Uncommitted dependency |
| C. | Inconsistent data |
| D. | Deadlock |
| Answer» B. Uncommitted dependency | |
| 389. |
Which are the three levels of abstraction: |
| A. | Physical |
| B. | Logical |
| C. | External |
| D. | All of these |
| Answer» E. | |
| 390. |
Which of the following is not a data definition language statement? |
| A. | CREATE |
| B. | ALTER |
| C. | DROP |
| D. | SELECT |
| Answer» E. | |
| 391. |
A Database Procedure is stored in the Database |
| A. | In compiled form |
| B. | As source code |
| C. | Both A & B |
| D. | Not stored |
| Answer» D. Not stored | |
| 392. |
System analyst and application programmers are commonly referred to as ……………………. |
| A. | Naïve users |
| B. | Casual users |
| C. | Software engineers |
| D. | Programmers |
| Answer» D. Programmers | |
| 393. |
A is a special kind of a store procedure that executes in response to certain action on the table like insertion, deletion or updation of data. |
| A. | procedures |
| B. | triggers |
| C. | functions |
| D. | none of the mentioned |
| Answer» C. functions | |
| 394. |
A file used to govern the initialization of the instance is known as |
| A. | Shared file |
| B. | Parameter file |
| C. | Read-only file |
| D. | None of the above |
| Answer» C. Read-only file | |
| 395. |
Which one of the following is a set of one or more attributes taken collectively to uniquelyidentify a record? |
| A. | Candidate key |
| B. | Sub key |
| C. | Super key |
| D. | Foreign key |
| Answer» D. Foreign key | |
| 396. |
To select all columns from the table the syntax is: |
| A. | Select all from table_name |
| B. | Select * from table_name |
| C. | Select from table_name |
| D. | Non of the above |
| Answer» C. Select from table_name | |
| 397. |
The file organization that provides very fast access to any arbitrary record of a file is: |
| A. | Ordered file |
| B. | Unordered file |
| C. | Hashed file |
| D. | B-tree |
| Answer» D. B-tree | |
| 398. |
Which of the following is NOT VALID is PL/SQL? |
| A. | Boolboolean; |
| B. | NUM1, NUM2 number; |
| C. | deptnamedept.dname%type; |
| D. | date1 date := sysdate |
| Answer» C. deptnamedept.dname%type; | |
| 399. |
dump schemes have been developed that allow transactions to be active while the dump is in progress. |
| A. | archival |
| B. | fuzzy |
| C. | sql |
| D. | all of the mentioned |
| Answer» C. sql | |
| 400. |
State true or false. i) Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation. |
| A. | i-True, ii-False |
| B. | i-True, ii-True |
| C. | i-False, ii-True |
| D. | i-False, ii-False |
| Answer» D. i-False, ii-False | |