DBMS Objective questions by anil nain 9416077273CHAPTER-1
Solved examples
Fill in the blankhs
A DBMS is an interface between ______ and ______ requests. (physical databse, user)
The ______ sub-system provides facilities to optimise DBMS performance. (performance)
Protection and control of database access is the responsibilities of _______ sub-system. (security management)
One of the responsibilities of a ______ is to create database schema. (DBA)
A rectangle in ERD representstion represents ________. (entity set)
T/F
A database is large collection of rather unrelated data.(F)
Data independence is a desirable characteristic of a DBMS.(T)
Information is processed data.(T)
The desirable characteristics of data processing are speed, volume and accuracy.(T)
SQL is a universal database query language.(T)
Unsolved
Fill in the blanks
<<<<
T/F
1. Logical data independency is easier to achieve than physical data independence.
2. DDL and DML are two different names fo rthe same thing.
3. C and COBOL are examples of DBMS.
4. Query optimization means arranging the queries so that the response time is minimized.
5. The three models of database are heirarchy, network and relational.
CHAPTER-2
Solved
Fill in the blanks
Primary key is ______ level constraint. (column)
The maximum number of characters that can be stored in a CHAR type fo data is _____. (255)
_______ data type can store unstrucrured data. (raw)
_______ operation returns a sub-set of attribute set from a table.(projection)
_______ operation creates new table from two given tables.(join)
T/F
Average, maximumand minimum are aggregate functions that return a single value.(T)
Rollback is the act of undoing certain transaction back to a given point. (T)
Once COMITted the operations performed on database cannot be undone.(T)
Unsolved
Fill in the blanks
<<<<>>>>>
T/F
Referential constraints requires an attibute be used in two tables.
All primary keys are candidate keys but not vice-versa.
Every SELECT command must have one or two WHERE cluses in it.
SQL is the only database language.
Every table must have at least one primary key and three candidate keys.
CHAPTER-3
Solved examples
Fill in the blanks
A relation is in ______ if and only if it is in ___ NF and every non-key attribute is irreducibly dependent on the primary key. (2NF, 1)
______ is the process of relational databse design. (normalization)
T/F
If a table is in 2NF, it may be or may not be in 1NF. (F)
Fourth normal form uses multiple dependency criteria for relation decomposition.(T)
Unsolved
Fill in the blanks
<<
T/F
A table is in 4NF if it is in 3NF and has no multiple sets of multivalued dependencies.
Normailization is an aid to database design.
BCNF has more merits than 3NF.
5NF is the maximum level of normalization possible in the normalization of databse.
Dependency is the basis of normalization.
CHAPTER-4
Solved examples
Fill in the blanks
Natural join is a _______operation. (commutaive)
The graphical representation of a query is ________. (query tree)
T/F
All the queries are equally faster. (F)
Natural join and cartesian product are one and the same operations.(T)
Unsolved
Fill in the blanks
<<<
T/F
Canonical representation of a query tree is also minimum spanning tree.
The order in which operations are cariied out on a relation is significant for the execution speed.
In a cascade sequence of projections, the last one can be ignored.
The four operations of natural join, join, union and intersections are individually associateive.
Heuristics may be applied in query optimization.
CHAPTER-5
Solved examples
Fill in the blanks
A binary lock can have ______ states. (two)
In the ______phase the number of locks increases from zero to maximum. (growing)
T/F
Time stamp is a unique identifier to identify a transaction. (T)
2-phase locking does not guarantee strict schedule.(F)
Unsolved
Fill in the blanks
<<<<<
T/F
ACID are properties of a transaction.
More storage is neede to apply multiple concurrency techniques.
A red lock is also known as shared lock.
Locking technique always ensures serializability.
Concurrency can occur only in a multi-processor database systems.
CHAPTER-6
Solved examples
Fill in the blanks
Client-server architecture is used to implement _________. (distributed database)
________ implies that once a name is specified, the named objects can be accessed without additional specification.
T/F
A horizontal fragment of a relation is a subset of the tuples in that relation.(T)
Semijoin operations intend to reduce the number of tuples in a relation before it is tranferred.
Unsolved
Fill in the blanks
A _______ is that part of distributed system which makes a request to other parts for a service.
Distributes transparency means _____.
____ is a multidatabase system.
A set of vertical fragments of a relation R, whose projection lists include all the attributes in R but share only the primary key attribute is called _________ vertical fragmentation of R.
To reconstrct a relation from a vertical fragments sequence of ________ operations is employed.
T/F
A client may act as a server for another application.
A distributed database may be highly redundant for performance improvement.
A distributed database uses network to communicate with its components.
Location transparency means that the database should behave differently depending on the location from which iit is being accessed.
Distributed database query optimization focuses on reducing the size of the fragments to be transferred.
