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.
| 1251. |
A Boolean data type that can take values true, false, and |
| A. | 1 |
| B. | 0 |
| C. | null |
| D. | unknown |
| Answer» E. | |
| 1252. |
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» B. single value | |
| 1253. |
The result of           unknown is unknown. |
| A. | xor |
| B. | or |
| C. | and |
| D. | not |
| Answer» E. | |
| 1254. |
Using the              clause retains only one copy of such identical tuples. |
| A. | null |
| B. | unique |
| C. | not null |
| D. | distinct |
| Answer» E. | |
| 1255. |
The primary key must be |
| A. | unique |
| B. | not null |
| C. | both unique and not null |
| D. | either unique or not null |
| Answer» D. either unique or not null | |
| 1256. |
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» E. | |
| 1257. |
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» D. empty space | |
| 1258. |
The                            is essentially used to search for patterns in target string. |
| A. | like predicate |
| B. | null predicate |
| C. | in predicate |
| D. | out predicate |
| Answer» B. null predicate | |
| 1259. |
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» D. old value | |
| 1260. |
                   joins are SQL server default |
| A. | outer |
| B. | inner |
| C. | equi |
| D. | none of the mentioned |
| Answer» C. equi | |
| 1261. |
           clause is an additional ï¬lter that is applied to the result. |
| A. | select |
| B. | group-by |
| C. | having |
| D. | order by |
| Answer» D. order by | |
| 1262. |
The number of attributes in relation is called as its |
| A. | cardinality |
| B. | degree |
| C. | tuples |
| D. | entity |
| Answer» C. tuples | |
| 1263. |
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» B. union some | |
| 1264. |
The intersection operator is used to get the            tuples. |
| A. | different |
| B. | common |
| C. | all |
| D. | repeating |
| Answer» C. all | |
| 1265. |
The union operation is represented by |
| A. | ∩ |
| B. | u |
| C. | – |
| D. | * |
| Answer» C. – | |
| 1266. |
           operator is used for appending two strings. |
| A. | & |
| B. | % |
| C. | _ |
| Answer» D. | |
| 1267. |
In SQL the spaces at the end of the string are removed by                function. |
| A. | upper |
| B. | string |
| C. | trim |
| D. | lower |
| Answer» D. lower | |
| 1268. |
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» E. | |
| 1269. |
The                  clause is used to list the attributes desired in the result of a query. |
| A. | where |
| B. | select |
| C. | from |
| D. | distinct |
| Answer» C. from | |
| 1270. |
The              clause allows us to select only those rows in the result relation of the          clause that satisfy a speciï¬ed predicate. |
| A. | where, from |
| B. | from, select |
| C. | select, from |
| D. | from, where |
| Answer» B. from, select | |
| 1271. |
Updates that violate                      are disallowed. |
| A. | integrity constraints |
| B. | transaction control |
| C. | authorization |
| D. | ddl constraints |
| Answer» B. transaction control | |
| 1272. |
To remove a relation from an SQL database, we use the              command. |
| A. | delete |
| B. | purge |
| C. | remove |
| D. | drop table |
| Answer» E. | |
| 1273. |
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 deï¬nition langauge) |
| C. | query |
| D. | relational schema |
| Answer» B. ddl(data deï¬nition langauge) | |
| 1274. |
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» C. scheme diagram | |
| 1275. |
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» B. relational algebra | |
| 1276. |
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» C. difference | |
| 1277. |
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» D. union | |
| 1278. |
The               operation performs a set union of two “similarly structured†tables |
| A. | union |
| B. | join |
| C. | product |
| D. | intersect |
| Answer» B. join | |
| 1279. |
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» C. intersection | |
| 1280. |
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 | |
| 1281. |
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 | |
| 1282. |
A                    integrity constraint requires that the values appearing in speciï¬ed attributes of any tuple in the referencing relation also appear in speciï¬ed attributes of at least one tuple in the referenced relation. |
| A. | referential |
| B. | referencing |
| C. | speciï¬c |
| D. | primary |
| Answer» B. referencing | |
| 1283. |
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» D. referred relation | |
| 1284. |
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 | |
| 1285. |
Which one of the following cannot be taken as a primary key? |
| A. | id |
| B. | register number |
| C. | dept_id |
| D. | street |
| Answer» E. | |
| 1286. |
Which one of the following attribute can be taken as a primary key? |
| A. | name |
| B. | street |
| C. | id |
| D. | department |
| Answer» D. department | |
| 1287. |
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 | |
| 1288. |
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» B. all subsets are super keys | |
| 1289. |
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» C. city | |
| 1290. |
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 | |
| 1291. |
A domain is atomic if elements of the domain are considered to be                          units. |
| A. | different |
| B. | indivisbile |
| C. | constant |
| D. | divisible |
| Answer» C. constant | |
| 1292. |
The term                is used to refer to a row. |
| A. | attribute |
| B. | tuple |
| C. | field |
| D. | instance |
| Answer» C. field | |
| 1293. |
A Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â in a table represents a relationship among a set of values. |
| A. | column |
| B. | key |
| C. | row |
| D. | entry |
| Answer» D. entry | |
| 1294. |
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 | |