Quick Revision

GK One-Line Question & Answer

15541+ short questions with short answers, covering every category and sub-category on the site — no long articles to scroll through. Good for a fast recap before an exam, or a few minutes of daily practice.

DBMS → Introduction to DBMS 3

The space factor when determining the efficiency of an algorithm is measured by
counting the maximum memory needed by the algorithm
click to copy
The iterator maintains the                      of its execution in between calls so that successive next() requests receive successive result tuples.
state
click to copy
The relation EMPDT1 is defined 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
2nf and hence also in 1nf
click to copy

DBMS → Database Architecture 3

Which of the following case does not exist in complexity theory
null case
click to copy
Tuples are generated                        in producer-driven pipelining, they are generated                  on demand, in demand- driven pipelining.
eagerly, lazily
click to copy
                               is a procedural extension of Oracle – SQL that offers language constructs similar to those in imperative programming languages.
pl/sql
click to copy

DBMS → Data Models 3

The Average case occur in linear search algorithm
when item is somewhere in the middle of the array
click to copy
When two inputs that we desire to pipeline into the join are not already sorted it is the                            technique.
double-pipelined join
click to copy
                       combines the data manipulating power of SQL with the data processing power of Procedural languages.
pl/sql
click to copy

DBMS → ER Model 3

The complexity of the average case of an algorithm is
much more complicated to analyze than that of worst case
click to copy
Which of the following is/are false for RAW mode of FOR XML?
binary base32 returns the binary data in base32-encoded format
click to copy
                               has made PL/SQL code run faster without requiring any additional work on the part of the programmer.
oracle
click to copy

DBMS → Relational Model 2

The complexity of a linear search algorithm is
o(n)
click to copy
                       refers to the ability of the system to recover committed transaction updates if either the system or the storage media fails.
durability
click to copy

DBMS → Normalization 2

The complexity of Bubble sort algorithm is
o(n2)
click to copy
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?
smallint
click to copy

DBMS → Functional Dependency 2

A           is a query that retrieves rows from more than one table or view:
join
click to copy
Problems occurs if we don’t implement a proper locking strategy
phantom reads
click to copy

DBMS → SQL Basics 2

A condition is referred to as                      
join condition
click to copy
Which of the following fixed database roles can add or remove user IDs?
db_accessadmin
click to copy

DBMS → DDL Commands 2

Which oracle is the join condition is specified using the WHERE clause:
pre-oracle 9i
click to copy
Which of the following pair of regular
(ab)* and a*b*
click to copy

DBMS → DML Commands 2

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:
right outer join
click to copy
Which feature converts row data to a column for better analytical view?
pivot
click to copy

DBMS → Joins 2

Which operation are allowed in a join view:
all of the mentioned
click to copy
What is the default “SORT” order for a SQL?
ascending
click to copy

DBMS → Views 2

Which view that contains more than one table in the top-level FROM clause of the SELECT statement:
updatable join view
click to copy
How inserting data through stored procedure do reduces network traffic and increase database performance?
the execution plan is stored in the cache after it was executed the first time
click to copy

DBMS → Indexes 2

The results of each intermediate operation are created and then are used for evaluation of the next-level operations. This is called
materialized evaluation
click to copy
Stored procedures are safe from SQL injection attacks
TRUE
click to copy

DBMS → Transactions 2

                             allows the algorithm to execute more quickly by performing CPU activity in parallel with I/O activity.
buffering
click to copy
Which of the following connection type supports application role permissions and password encryption?
ole db and odbc
click to copy

DBMS → Concurrency Control 2

Pipelines can be executed in
2
click to copy
Cursor that reflects the changes made to the database table even after the result set is returned
dynamic
click to copy

DBMS → Deadlock 2

In a                    the system makes repeated requests for tuples from the operation at the top of the pipeline.
demand-driven pipeline
click to copy
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
not dependency preserving and not lossless join
click to copy

DBMS → Database Security 2

In a                            operations do not wait for requests to produce tuples, but instead generate the tuples eagerly.
producer-driven pipeline
click to copy
Which one of the following statements about normal forms is FALSE?
lossless, dependency-preserving decomposition into bcnf is always possible
click to copy

DBMS → PL/SQL 2

Each operation in a demand-driven pipeline can be implemented as an          that provides the following functions: open(), next(), and close().
iterator
click to copy
Which of the following is TRUE?
every relation in bcnf is also in 3nf
click to copy