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
| 451. |
Which of the following function is used to find the column count of the particular resultset? |
| A. | getmetadata() |
| B. | metadata() |
| C. | getcolumn() |
| D. | get count() |
| Answer» A. getmetadata() | |
| 452. |
Which of the following is used as the embedded SQL in COBOL? |
| A. | exec sql <embedded sql statement >; |
| B. | exec sql <embedded sql statement > end-exec |
| C. | exec sql <embedded sql statement > |
| D. | exec sql <embedded sql statement > end exec; |
| Answer» B. exec sql <embedded sql statement > end-exec | |
| 453. |
Which of the following is used to distinguish the variables in SQL from the host language variables? |
| A. | . |
| B. | – |
| C. | : |
| D. | , |
| Answer» B. – | |
| 454. |
Which of the following is used to access large objects from a database ? |
| A. | setblob() |
| B. | getblob() |
| C. | getclob() |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 455. |
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» B. triggers | |
| 456. |
Triggers are supported in |
| A. | delete |
| B. | update |
| C. | views |
| D. | all of the mentioned |
| Answer» C. views | |
| 457. |
What are the after triggers? |
| A. | triggers generated after a particular operation |
| B. | these triggers run after an insert, update or delete on a table |
| C. | these triggers run after an insert, views, update or delete on a table |
| D. | all of the mentioned |
| Answer» B. these triggers run after an insert, update or delete on a table | |
| 458. |
The variables in the triggers are declared using |
| A. | – |
| B. | @ |
| C. | / |
| D. | /@ |
| Answer» B. @ | |
| 459. |
The default extension for an Oracle SQL*Plus file is: |
| A. | .txt |
| B. | .pls |
| C. | .ora |
| D. | .sql |
| Answer» D. .sql | |
| 460. |
Which of the following is NOT an Oracle- supported trigger? |
| A. | before |
| B. | during |
| C. | after |
| D. | instead of |
| Answer» B. during | |
| 461. |
What are the different in triggers? |
| A. | define, create |
| B. | drop, comment |
| C. | insert, update, delete |
| D. | all of the mentioned |
| Answer» C. insert, update, delete | |
| 462. |
Triggers enabled or disabled |
| A. | can be |
| B. | cannot be |
| C. | ought to be |
| D. | always |
| Answer» A. can be | |
| 463. |
Which prefixes are available to Oracle triggers? |
| A. | : new only |
| B. | : old only |
| C. | both :new and : old |
| D. | neither :new nor : old |
| Answer» C. both :new and : old | |
| 464. |
Any recursive view must be defined as the union of two subqueries: a query that is nonrecursive and a query. |
| A. | base, recursive |
| B. | recursive, base |
| C. | base, redundant |
| D. | view, base |
| Answer» A. base, recursive | |
| 465. |
Ranking of queries is done by which of the following? |
| A. | group by |
| B. | order by |
| C. | having |
| D. | both group by and order by |
| Answer» B. order by | |
| 466. |
In rank() function if one value is shared by two tuples then |
| A. | the rank order continues as counting numbers |
| B. | the rank order continues by leaving one rank in the middle |
| C. | the user specifies the order |
| D. | the order does not change |
| Answer» B. the rank order continues by leaving one rank in the middle | |
| 467. |
The function that does not create gaps in the ordering. |
| A. | intense_rank() |
| B. | continue_rank() |
| C. | default_rank() |
| D. | dense_rank() |
| Answer» D. dense_rank() | |
| 468. |
If there are n tuples in the partition and the rank of the tuple is r, then its is defined as (r −1)/(n−1). |
| A. | ntil() |
| B. | cum_rank |
| C. | percent_rank |
| D. | rank() |
| Answer» C. percent_rank | |
| 469. |
Inorder to simplify the null value confusion in the rank function we can specify |
| A. | not null |
| B. | nulls last |
| C. | nulls first |
| D. | either nulls last or first |
| Answer» D. either nulls last or first | |
| 470. |
The command such tables are available only within the transaction executing the query and are dropped when the transaction finishes. |
| A. | create table |
| B. | create temporary table |
| C. | create view |
| D. | create label view |
| Answer» B. create temporary table | |
| 471. |
OLAP stands for |
| A. | online analytical processing |
| B. | online analysis processing |
| C. | online transaction processing |
| D. | online aggregate processing |
| Answer» A. online analytical processing | |
| 472. |
The process of viewing the cross-tab (Single dimensional) with a fixed value of one attribute is |
| A. | slicing |
| B. | dicing |
| C. | pivoting |
| D. | both slicing and dicing |
| Answer» A. slicing | |
| 473. |
The operation of moving from finer- granularity data to a coarser granularity (by means of aggregation) is called a |
| A. | rollup |
| B. | drill down |
| C. | dicing |
| D. | pivoting |
| Answer» A. rollup | |
| 474. |
In SQL the cross-tabs are created using |
| A. | slice |
| B. | dice |
| C. | pivot |
| D. | all of the mentioned |
| Answer» A. slice | |
| 475. |
What do data warehouses support? |
| A. | olap |
| B. | oltp |
| C. | olap and oltp |
| D. | operational databases |
| Answer» A. olap | |
| 476. |
Which one of the following is the right syntax for DECODE? |
| A. | decode (search, expression, result [, search, result]… [, default]) |
| B. | decode (expression, result [, search, result]… [, default], search) |
| C. | decode (search, result [, search, result]… [, default], expression) |
| D. | decode (expression, search, result [, search, result]… [, default]) |
| Answer» D. decode (expression, search, result [, search, result]… [, default]) | |
| 477. |
Relational Algebra is a query language that takes two relations as input and produces another relation as an output of the query. |
| A. | relational |
| B. | structural |
| C. | procedural |
| D. | fundamental |
| Answer» C. procedural | |
| 478. |
Which of the following is a fundamental operation in relational algebra? |
| A. | set intersection |
| B. | natural join |
| C. | assignment |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 479. |
Which of the following is used to denote the selection operation in relational algebra? |
| A. | pi (greek) |
| B. | sigma (greek) |
| C. | lambda (greek) |
| D. | omega (greek) |
| Answer» B. sigma (greek) | |
| 480. |
For select operation the appear in the subscript and the argument appears in the paranthesis after the sigma. |
| A. | predicates, relation |
| B. | relation, predicates |
| C. | operation, predicates |
| D. | relation, operation |
| Answer» A. predicates, relation | |
| 481. |
The operation, denoted by −, allows us to find tuples that are in one relation but are not in another. |
| A. | union |
| B. | set-difference |
| C. | difference |
| D. | intersection |
| Answer» B. set-difference | |
| 482. |
Which is a unary operation: |
| A. | selection operation |
| B. | primitive operation |
| C. | projection operation |
| D. | generalized selection |
| Answer» D. generalized selection | |
| 483. |
Which is a join condition contains an equality operator: |
| A. | equijoins |
| B. | cartesian |
| C. | natural |
| D. | left |
| Answer» A. equijoins | |
| 484. |
Which of the following is not outer join? |
| A. | left outer join |
| B. | right outer join |
| C. | full outer join |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 485. |
The assignment operator is denoted by |
| A. | -> |
| B. | <- |
| C. | = |
| D. | == |
| Answer» B. <- | |
| 486. |
Which of the following symbol is used in the place of except? |
| A. | ^ |
| B. | v |
| C. | ¬ |
| D. | ~ |
| Answer» C. ¬ | |
| 487. |
Which of the following is the comparison operator in tuple relational calculus |
| A. | ⇒ |
| B. | = |
| C. | ε |
| D. | all of the mentioned |
| Answer» B. = | |
| 488. |
In domain relaional calculus “there exist” |
| A. | (p1(x)) |
| B. | (p1(x)) Э x |
| C. | v x (p1(x)) |
| D. | Э x (p1(x)) |
| Answer» D. Э x (p1(x)) | |
| 489. |
A set of possible data values is called |
| A. | attribute |
| B. | degree |
| C. | tuple |
| D. | domain |
| Answer» D. domain | |
| 490. |
An is a set of entities of the same type that share the same properties, or attributes. |
| A. | entity set |
| B. | attribute set |
| C. | relation set |
| D. | entity model |
| Answer» A. entity set | |
| 491. |
Entity is a |
| A. | object of relation |
| B. | present working model |
| C. | thing in real world |
| D. | model of relation |
| Answer» C. thing in real world | |
| 492. |
The attribute name could be structured as an attribute consisting of first name, middle initial, and last name. This type of attribute is called |
| A. | simple attribute |
| B. | composite attribute |
| C. | multivalued attribute |
| D. | derived attribute |
| Answer» B. composite attribute | |
| 493. |
The attribute AGE is calculated from DATE_OF_BIRTH. The attribute AGE is |
| A. | single valued |
| B. | multi valued |
| C. | composite |
| D. | derived |
| Answer» D. derived | |
| 494. |
Not applicable condition can be represented in relation entry as |
| A. | na |
| B. | 0 |
| C. | null |
| D. | blank space |
| Answer» C. null | |
| 495. |
Which of the following can be a multivalued attribute? |
| A. | phone_number |
| B. | name |
| C. | date_of_birth |
| D. | all of the mentioned |
| Answer» A. phone_number | |
| 496. |
Which of the following is a single valued attribute |
| A. | register_number |
| B. | address |
| C. | subject_taken |
| D. | reference |
| Answer» A. register_number | |
| 497. |
In a relation between the entities the type and condition of the relation should be specified. That is called as attribute. |
| A. | desciptive |
| B. | derived |
| C. | recursive |
| D. | relative |
| Answer» A. desciptive | |
| 498. |
express the number of entities to which another entity can be associated via a relationship set. |
| A. | mapping cardinality |
| B. | relational cardinality |
| C. | participation constraints |
| D. | none of the mentioned |
| Answer» A. mapping cardinality | |
| 499. |
An entity in A is associated with at most one entity in B, and an entity in B is associated with at most one entity in A.This is called as |
| A. | one-to-many |
| B. | one-to-one |
| C. | many-to-many |
| D. | many-to-one |
| Answer» B. one-to-one | |
| 500. |
An entity in A is associated with at most one entity in B. An entity in B, however, can be associated with any number (zero or more) of entities in A. |
| A. | one-to-many |
| B. | one-to-one |
| C. | many-to-many |
| D. | many-to-one |
| Answer» D. many-to-one | |
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.