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.
| 851. |
Consider money is transferred from (1)account-A to account-B and (2) account-B to account-A. Which of the following form a transaction? |
| A. | only 1 |
| B. | only 2 |
| C. | both 1 and 2 individually |
| D. | either 1 or 2 |
| Answer» D. either 1 or 2 | |
| 852. |
In                                  of Oracle, the database administrator creates a user account in the database for each user who needs access. |
| A. | database authentication |
| B. | operating system authentication |
| C. | internal authentication |
| D. | external authentication |
| Answer» B. operating system authentication | |
| 853. |
In                                the management of the password for the account can be handled outside of oracle such as operating system. |
| A. | database authentication |
| B. | operating system authentication |
| C. | internal authentication |
| D. | external authentication |
| Answer» C. internal authentication | |
| 854. |
                                   is a sequence of zero or more characters enclosed by single quotes. |
| A. | integers literal |
| B. | string literal |
| C. | string units |
| D. | string label |
| Answer» C. string units | |
| 855. |
If no header is speciï¬ed, the block is said to be an                                PL/SQL block. |
| A. | strong |
| B. | weak |
| C. | empty |
| D. | anonymous |
| Answer» E. | |
| 856. |
A                                        is an explicit numeric, character, string or Boolean value not represented by an identiï¬er. |
| A. | comments |
| B. | literals |
| C. | delimiters |
| D. | identiï¬ers |
| Answer» C. delimiters | |
| 857. |
We use                              name PL/SQL program objects and units. |
| A. | lexical units |
| B. | literals |
| C. | delimiters |
| D. | identiï¬ers |
| Answer» E. | |
| 858. |
A line of PL/SQL text contains groups of characters known as |
| A. | lexical units |
| B. | literals |
| C. | textual units |
| D. | identiï¬ers |
| Answer» B. literals | |
| 859. |
                       combines the data manipulating power of SQL with the data processing power of Procedural languages. |
| A. | pl/sql |
| B. | sql |
| C. | advanced sql |
| D. | pql |
| Answer» B. sql | |
| 860. |
                               is a procedural extension of Oracle – SQL that offers language constructs similar to those in imperative programming languages. |
| A. | sql |
| B. | pl/sql |
| C. | advanced sql |
| D. | pql |
| Answer» C. advanced sql | |
| 861. |
The relation EMPDT1 is deï¬ned with attributes empcode(unique), name, street, city, state, and pincode. For any pincode, there is only one city and state. Also, for any given street, city and state, there is just one pincode. In normalization terms EMPDT1 is a relation in |
| A. | 1nf only |
| B. | 2nf and hence also in 1nf |
| C. | 3nf and hence also in 2nf and 1nf |
| D. | bcnf and hence also in 3nf, 2nf and 1nf |
| Answer» C. 3nf and hence also in 2nf and 1nf | |
| 862. |
                               has made PL/SQL code run faster without requiring any additional work on the part of the programmer. |
| A. | sql server |
| B. | my sql |
| C. | oracle |
| D. | sql lite |
| Answer» D. sql lite | |
| 863. |
Which one of the following statements about normal forms is FALSE? |
| A. | bcnf is stricter than 3nf |
| B. | lossless, dependency-preserving decomposition into 3nf is always possible |
| C. | lossless, dependency-preserving decomposition into bcnf is always possible |
| D. | any relation with two attributes is in bcnf |
| Answer» D. any relation with two attributes is in bcnf | |
| 864. |
Consider a schema R(A, B, C, D) and functional dependencies A -> B and C -> D. Then the decomposition of R into R1 (A, B) and R2(C, D) is |
| A. | dependency preserving and lossless join |
| B. | lossless join but not dependency preserving |
| C. | dependency preserving but not lossless join |
| D. | not dependency preserving and not lossless join |
| Answer» E. | |
| 865. |
Cursor that reflects the changes made to the database table even after the result set is returned |
| A. | static |
| B. | dynamic |
| C. | forward_only |
| D. | keyset |
| Answer» C. forward_only | |
| 866. |
Which of the following connection type supports application role permissions and password encryption? |
| A. | ole db |
| B. | dblib |
| C. | odbc |
| D. | ole db and odbc |
| Answer» E. | |
| 867. |
Stored procedures are safe from SQL injection attacks |
| A. | true |
| B. | false |
| C. | depends on the result |
| D. | always safe |
| Answer» B. false | |
| 868. |
How inserting data through stored procedure do reduces network traffic and increase database performance? |
| A. | stored procedure can accept parameter |
| B. | permission check is not required |
| C. | the execution plan is stored in the cache after it was executed the ï¬rst time |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 869. |
What is the default “SORT†order for a SQL? |
| A. | ascending |
| B. | descending |
| C. | as speciï¬ed by the user |
| D. | none of the mentioned |
| Answer» B. descending | |
| 870. |
Which feature converts row data to a column for better analytical view? |
| A. | views |
| B. | join |
| C. | pivot |
| D. | trigger |
| Answer» D. trigger | |
| 871. |
Which of the following pair of regular |
| A. | 1(01)* and (10)*1 |
| B. | x(xx)* and (xx)*x |
| C. | (ab)* and a*b* |
| D. | x+ and x*x+ |
| Answer» D. x+ and x*x+ | |
| 872. |
Which of the following ï¬xed database roles can add or remove user IDs? |
| A. | db_accessadmin |
| B. | db_securityadmin |
| C. | db_setupadmin |
| D. | db_sysadmin |
| Answer» B. db_securityadmin | |
| 873. |
Problems occurs if we don’t implement a proper locking strategy |
| A. | dirty reads |
| B. | phantom reads |
| C. | lost updates |
| D. | unrepeatable reads |
| Answer» C. lost updates | |
| 874. |
You have a column that will only contain values from 0 to 256. What is the most economical data type to use for the column? |
| A. | tinyint |
| B. | smallint |
| C. | int |
| D. | decimal(1) |
| Answer» C. int | |
| 875. |
                       refers to the ability of the system to recover committed transaction updates if either the system or the storage media fails. |
| A. | isolation |
| B. | atomicity |
| C. | consistency |
| D. | durability |
| Answer» E. | |
| 876. |
Which of the following is/are false for RAW mode of FOR XML? |
| A. | xmlschema option does not returns an in-line xsd schema |
| B. | binary base32 returns the binary data in base32-encoded format |
| C. | each row in the query result is transformed into an xml element |
| D. | none of the mentioned |
| Answer» C. each row in the query result is transformed into an xml element | |
| 877. |
When two inputs that we desire to pipeline into the join are not already sorted it is the                            technique. |
| A. | hash join |
| B. | buffer join |
| C. | double-pipelined hash join |
| D. | double-pipelined join |
| Answer» E. | |
| 878. |
Tuples are generated                        in producer-driven pipelining, they are generated                  on demand, in demand- driven pipelining. |
| A. | lazily, eagerly |
| B. | eagerly, lazily |
| C. | slowly, eagerly |
| D. | eagerly, slowly |
| Answer» C. slowly, eagerly | |
| 879. |
The iterator maintains the                      of its execution in between calls so that successive next() requests receive successive result tuples. |
| A. | state |
| B. | transition |
| C. | rate |
| D. | block |
| Answer» B. transition | |
| 880. |
Each operation in a demand-driven pipeline can be implemented as an          that provides the following functions: open(), next(), and close(). |
| A. | demand |
| B. | pipeline |
| C. | iterator |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 881. |
In a                            operations do not wait for requests to produce tuples, but instead generate the tuples eagerly. |
| A. | demand-driven pipeline |
| B. | producer-driven pipeline |
| C. | demand pipeline |
| D. | all of the mentioned |
| Answer» C. demand pipeline | |
| 882. |
In a                    the system makes repeated requests for tuples from the operation at the top of the pipeline. |
| A. | demand-driven pipeline |
| B. | producer-driven pipeline |
| C. | demand pipeline |
| D. | all of the mentioned |
| Answer» B. producer-driven pipeline | |
| 883. |
Pipelines can be executed in |
| A. | 4 |
| B. | 3 |
| C. | 2 |
| D. | 5 |
| Answer» D. 5 | |
| 884. |
                             allows the algorithm to execute more quickly by performing CPU activity in parallel with I/O activity. |
| A. | buffering |
| B. | double buffering |
| C. | multiple buffering |
| D. | double reading |
| Answer» B. double buffering | |
| 885. |
The results of each intermediate operation are created and then are used for evaluation of the next-level operations. This is called |
| A. | materialized evaluation |
| B. | expression evaluation |
| C. | tree evaluation |
| D. | tree materialization |
| Answer» B. expression evaluation | |
| 886. |
Which view that contains more than one table in the top-level FROM clause of the SELECT statement: |
| A. | join view |
| B. | datable join view |
| C. | updatable join view |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 887. |
Which operation are allowed in a join view: |
| A. | update |
| B. | insert |
| C. | delete |
| D. | all of the mentioned |
| Answer» E. | |
| 888. |
Which join refers to join records from the write table that have no matching key in the left table are include in the result set: |
| A. | left outer join |
| B. | right outer join |
| C. | full outer join |
| D. | half outer join |
| Answer» C. full outer join | |
| 889. |
Which oracle is the join condition is speciï¬ed using the WHERE clause: |
| A. | oracle 9i |
| B. | oracle 8i |
| C. | pre-oracle 9i |
| D. | pre-oracle 8i |
| Answer» D. pre-oracle 8i | |
| 890. |
A condition is referred to as |
| A. | join in sql |
| B. | join condition |
| C. | join in sql & condition |
| D. | none of the mentioned |
| Answer» C. join in sql & condition | |
| 891. |
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 | |
| 892. |
The complexity of the average case of an algorithm is |
| A. | much more complicated to analyze than that of worst case |
| B. | much more simpler to analyze than that of worst case |
| C. | sometimes more complicated and some other times simpler than that of worst case |
| D. | none of the mentioned |
| Answer» B. much more simpler to analyze than that of worst case | |
| 893. |
The complexity of a linear search algorithm is |
| A. | o(n) |
| B. | o(log n) |
| C. | o(n2) |
| D. | o(n log n) |
| Answer» B. o(log n) | |
| 894. |
The complexity of Bubble sort algorithm is |
| A. | o(n) |
| B. | o(log n) |
| C. | o(n2) |
| D. | o(n log n) |
| Answer» D. o(n log n) | |
| 895. |
The Average case occur in linear search algorithm |
| A. | when item is somewhere in the middle of the array |
| B. | when item is not in the array at all |
| C. | when item is the last element in the array |
| D. | when item is the last element in the array or is not there at all |
| Answer» B. when item is not in the array at all | |
| 896. |
Which of the following case does not exist in complexity theory |
| A. | best case |
| B. | worst case |
| C. | average case |
| D. | null case |
| Answer» E. | |
| 897. |
The space factor when determining the efficiency of an algorithm is measured by |
| A. | counting the maximum memory needed by the algorithm |
| B. | counting the minimum memory needed by the algorithm |
| C. | counting the average memory needed by the algorithm |
| D. | counting the maximum disk space needed by the algorithm |
| Answer» B. counting the minimum memory needed by the algorithm | |
| 898. |
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 | |
| 899. |
If access paths are available on all the conditions of a disjunctive selection, each index is scanned for pointers to tuples that satisfy the individual condition. This is satisï¬ed by |
| A. | a10 |
| B. | a7 |
| C. | a9 |
| D. | a6 |
| Answer» B. a7 | |
| 900. |
The algorithm that uses a secondary ordered index to guide retrieval for comparison conditions involving is |
| A. | a2 |
| B. | a4 |
| C. | a5 |
| D. | a6 |
| Answer» E. | |