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.

Looking for exam process/strategy questions instead? Try the Exam Preparation FAQ →

DBMS → Joins 3

The separation of the data definition from the program is known as:
data independence
click to copy
If the state of the database no longer reflects a real state of the world that the database is supposed to capture, then such a state is called
inconsistent state
click to copy
Which operation are allowed in a join view:
all of the mentioned
click to copy

DBMS → Views 3

In the client / server model, the database:
resides on the server side
click to copy
In query processing, the                        is the lowest-level operator to access data.
file scan
click to copy
Which view that contains more than one table in the top-level FROM clause of the SELECT statement:
updatable join view
click to copy

DBMS → Indexes 3

The association role defines:
how tables are related in the database
click to copy
In a                          the system scans each file block and tests all records to see whether they satisfy the selection condition.
linear search
click to copy
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

DBMS → Transactions 3

A                on the attribute A of relation r consists of one bitmap for each value that A can take.
bitmap index
click to copy
Which algorithm uses equality comparison on a key attribute with a primary index to retrieve a single record that satisfies the corresponding equality condition.
a2
click to copy
                             allows the algorithm to execute more quickly by performing CPU activity in parallel with I/O activity.
buffering
click to copy

DBMS → Concurrency Control 2

To identify the deleted records we use the
existence bitmap
click to copy
The strategy can retrieve a single record if the equality condition is on a key; multiple records may be retrieved if the indexing field is not a key is
a4
click to copy

DBMS → Deadlock 2

Bitmaps can be combined with regular B+- tree indices for relations where a few attribute values are extremely common, and other values also occur, but much less frequently.
bitmap, b+tree
click to copy
The algorithm that uses a secondary ordered index to guide retrieval for comparison conditions involving <,≤,≥, or > is
a6
click to copy

DBMS → Database Security 2

What is the purpose of the index in sql server?
all of the mentioned
click to copy
The        algorithm scans each index for pointers to tuples that satisfy an individual condition.
a9
click to copy

DBMS → PL/SQL 2

How many types of indexes are there in sql server?
2
click to copy
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 satisfied by
a10
click to copy

DBMS → Introduction to DBMS 2

How non clustered index point to the data?
it is used for pointing data rows containing key values
click to copy
The space factor when determining the efficiency of an algorithm is measured by
counting the maximum memory needed by the algorithm
click to copy

DBMS → Database Architecture 2

Which one is true about clustered index?
clustered index is built by default on unique key columns
click to copy
Which of the following case does not exist in complexity theory
null case
click to copy

DBMS → Data Models 2

What is true about indexes?
it makes harder for sql server engines to work to work on index which have large keys
click to copy
The Average case occur in linear search algorithm
when item is somewhere in the middle of the array
click to copy

DBMS → ER Model 2

Does index take space in the disk?
yes, indexes are stored on disk
click to copy
The complexity of the average case of an algorithm is
much more complicated to analyze than that of worst case
click to copy

DBMS → Relational Model 2

If an index is                                    the metadata and statistics continue to exists
disabling
click to copy
The complexity of a linear search algorithm is
o(n)
click to copy

DBMS → Normalization 2

In                                index instead of storing all the columns for a record together, each column is stored separately with all other rows in an index.
column store
click to copy
The complexity of Bubble sort algorithm is
o(n2)
click to copy

DBMS → Functional Dependency 2

A                                    index is the one which satisfies all the columns requested in the query without performing further lookup into the clustered index.
covering
click to copy
A           is a query that retrieves rows from more than one table or view:
join
click to copy

DBMS → SQL Basics 2

Which of the following schemas does define a view or views of the database for particular users?
external schema
click to copy
A condition is referred to as                      
join condition
click to copy

DBMS → DDL Commands 2

Which of the following is an attribute that can uniquely identify a row in a table?
candidate key
click to copy
Which oracle is the join condition is specified using the WHERE clause:
pre-oracle 9i
click to copy

DBMS → DML Commands 2

The relationship between DEPARTMENT and EMPLOYEE is a
one-to-many relationship
click to copy
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