McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Bachelor of Science in Computer Science FY (BSc CS) , Bachelor of Science in Computer Science SY (BSc CS) , Bachelor of Science in Information Technology SY (BSc IT) , Bachelor of Computer Applications (BCA) .
Chapters
| 351. |
A logical description of some portion of database that is required by a user to perform task is called as |
| A. | system view |
| B. | user view |
| C. | logical view |
| D. | data view |
| Answer» B. user view | |
| 352. |
______________ is a classical approach to database design? |
| A. | left – right approach |
| B. | right – left approach |
| C. | top – down approach |
| D. | bottom – up approach |
| Answer» C. top – down approach | |
| 353. |
_____________ refers to the correctness and completeness of the data in a database? |
| A. | data security |
| B. | data integrity |
| C. | data constraint |
| D. | data independence |
| Answer» B. data integrity | |
| 354. |
A table that displays data redundancies yields ____________ anomalies |
| A. | insertion |
| B. | deletion |
| C. | update |
| D. | all of the above |
| Answer» D. all of the above | |
| 355. |
A lock that allows concurrent transactions to access different rows of the same table is known as a |
| A. | field-level lock |
| B. | row-level lock |
| C. | table-level lock |
| D. | database-level lock |
| Answer» A. field-level lock | |
| 356. |
A type of query that is placed within a WHERE or HAVING clause of another query is called |
| A. | super query |
| B. | sub query |
| C. | master query |
| D. | multi-query |
| Answer» B. sub query | |
| 357. |
A transaction completes its execution is said to be |
| A. | saved |
| B. | loaded |
| C. | rolled |
| D. | committed |
| Answer» D. committed | |
| 358. |
A in a table represents a relationship among a set of values. |
| A. | column |
| B. | key |
| C. | row |
| D. | entry |
| Answer» C. row | |
| 359. |
The term is used to refer to a row. |
| A. | attribute |
| B. | tuple |
| C. | field |
| D. | instance |
| Answer» B. tuple | |
| 360. |
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» A. domain | |
| 361. |
A domain is atomic if elements of the domain are considered to be units. |
| A. | different |
| B. | indivisbile |
| C. | constant |
| D. | divisible |
| Answer» B. indivisbile | |
| 362. |
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» C. super key | |
| 363. |
Consider attributes ID, CITY and NAME. Which one of this can be considered as a super key? |
| A. | name |
| B. | id |
| C. | city |
| D. | city, id |
| Answer» B. id | |
| 364. |
The subset of a super key is a candidate key under what condition? |
| A. | no proper subset is a super key |
| B. | all subsets are super keys |
| C. | subset is a super key |
| D. | each subset is a super key |
| Answer» A. no proper subset is a super key | |
| 365. |
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» B. key | |
| 366. |
Which one of the following attribute can be taken as a primary key? |
| A. | name |
| B. | street |
| C. | id |
| D. | department |
| Answer» C. id | |
| 367. |
Which one of the following cannot be taken as a primary key? |
| A. | id |
| B. | register number |
| C. | dept_id |
| D. | street |
| Answer» D. street | |
| 368. |
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» B. primary | |
| 369. |
The relation with the attribute which is the primary key is referenced in another relation. The relation which has the attribute as a primary key is called |
| A. | referential relation |
| B. | referencing relation |
| C. | referenced relation |
| D. | referred relation |
| Answer» C. referenced relation | |
| 370. |
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» C. referenced relation | |
| 371. |
A integrity constraint requires that the values appearing in specified attributes of any tuple in the referencing relation also appear in specified attributes of at least one tuple in the referenced relation. |
| A. | referential |
| B. | referencing |
| C. | specific |
| D. | primary |
| Answer» A. referential | |
| 372. |
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» B. join | |
| 373. |
The result which operation contains all pairs of tuples from the two relations, regardless of whether their attribute values match. |
| A. | join |
| B. | cartesian product |
| C. | intersection |
| D. | set difference |
| Answer» B. cartesian product | |
| 374. |
The operation performs a set union of two “similarly structured” tables |
| A. | union |
| B. | join |
| C. | product |
| D. | intersect |
| Answer» A. union | |
| 375. |
The most commonly used operation in relational algebra for projecting a set of tuple from a relation is |
| A. | join |
| B. | projection |
| C. | select |
| D. | union |
| Answer» C. select | |
| 376. |
The operator takes the results of two queries and returns only rows that appear in both result sets. |
| A. | union |
| B. | intersect |
| C. | difference |
| D. | projection |
| Answer» B. intersect | |
| 377. |
A is a pictorial depiction of the schema of a database that shows the relations in the database, their attributes, and primary keys and foreign keys. |
| A. | schema diagram |
| B. | relational algebra |
| C. | database diagram |
| D. | schema flow |
| Answer» A. schema diagram | |
| 378. |
The provides a set of operations that take one or more relations as input and return a relation as an output. |
| A. | schematic representation |
| B. | relational algebra |
| C. | scheme diagram |
| D. | relation flow |
| Answer» B. relational algebra | |
| 379. |
Which one of the following provides the ability to query information from the database and to insert tuples into, delete tuples from, and modify tuples in the database? |
| A. | dml(data manipulation langauge) |
| B. | ddl(data definition langauge) |
| C. | query |
| D. | relational schema |
| Answer» A. dml(data manipulation langauge) | |
| 380. |
To remove a relation from an SQL database, we use the command. |
| A. | delete |
| B. | purge |
| C. | remove |
| D. | drop table |
| Answer» D. drop table | |
| 381. |
Updates that violate are disallowed. |
| A. | integrity constraints |
| B. | transaction control |
| C. | authorization |
| D. | ddl constraints |
| Answer» A. integrity constraints | |
| 382. |
The clause allows us to select only those rows in the result relation of the clause that satisfy a specified predicate. |
| A. | where, from |
| B. | from, select |
| C. | select, from |
| D. | from, where |
| Answer» A. where, from | |
| 383. |
The clause is used to list the attributes desired in the result of a query. |
| A. | where |
| B. | select |
| C. | from |
| D. | distinct |
| Answer» B. select | |
| 384. |
Which of the following statements contains an error? |
| A. | select * from emp where empid = 10003; |
| B. | select empid from emp where empid = 10006; |
| C. | select empid from emp; |
| D. | select empid where empid = 1009 and lastname = ‘geller’; |
| Answer» D. select empid where empid = 1009 and lastname = ‘geller’; | |
| 385. |
In SQL the spaces at the end of the string are removed by function. |
| A. | upper |
| B. | string |
| C. | trim |
| D. | lower |
| Answer» C. trim | |
| 386. |
The union operation is represented by |
| A. | ∩ |
| B. | u |
| C. | – |
| D. | * |
| Answer» B. u | |
| 387. |
The intersection operator is used to get the tuples. |
| A. | different |
| B. | common |
| C. | all |
| D. | repeating |
| Answer» B. common | |
| 388. |
If we want to retain all duplicates, we must write in place of union. |
| A. | union all |
| B. | union some |
| C. | intersect all |
| D. | intersect some |
| Answer» A. union all | |
| 389. |
The number of attributes in relation is called as its |
| A. | cardinality |
| B. | degree |
| C. | tuples |
| D. | entity |
| Answer» B. degree | |
| 390. |
clause is an additional filter that is applied to the result. |
| A. | select |
| B. | group-by |
| C. | having |
| D. | order by |
| Answer» C. having | |
| 391. |
joins are SQL server default |
| A. | outer |
| B. | inner |
| C. | equi |
| D. | none of the mentioned |
| Answer» B. inner | |
| 392. |
The is essentially used to search for patterns in target string. |
| A. | like predicate |
| B. | null predicate |
| C. | in predicate |
| D. | out predicate |
| Answer» A. like predicate | |
| 393. |
A indicates an absent value that may exist but be unknown or that may not exist at all. |
| A. | empty tuple |
| B. | new value |
| C. | null value |
| D. | old value |
| Answer» C. null value | |
| 394. |
If the attribute phone number is included in the relation all the values need not be entered into the phone number column. This type of entry is given as |
| A. | 0 |
| B. | – |
| C. | null |
| D. | empty space |
| Answer» C. null | |
| 395. |
The predicate in a where clause can involve Boolean operations such as and. The result of true and unknown is false and unknown is while unknown and unknown is |
| A. | unknown, unknown, false |
| B. | true, false, unknown |
| C. | true, unknown, unknown |
| D. | unknown, false, unknown |
| Answer» D. unknown, false, unknown | |
| 396. |
Using the clause retains only one copy of such identical tuples. |
| A. | null |
| B. | unique |
| C. | not null |
| D. | distinct |
| Answer» D. distinct | |
| 397. |
The primary key must be |
| A. | unique |
| B. | not null |
| C. | both unique and not null |
| D. | either unique or not null |
| Answer» C. both unique and not null | |
| 398. |
The result of unknown is unknown. |
| A. | xor |
| B. | or |
| C. | and |
| D. | not |
| Answer» D. not | |
| 399. |
Aggregate functions are functions that take a as input and return a single value. |
| A. | collection of values |
| B. | single value |
| C. | aggregate value |
| D. | both collection of values & single value |
| Answer» A. collection of values | |
| 400. |
A Boolean data type that can take values true, false, and |
| A. | 1 |
| B. | 0 |
| C. | null |
| D. | unknown |
| Answer» D. unknown | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.