The database administration function includes

Application programming
Computer operations management
Database access planning
All of the above
      _____________________________________________________________________________________
Goals for the design of the logical schema include

Being able to access data efficiently
Being able to construct queries easily
Avoiding data in consistency
All of the above
      _____________________________________________________________________________________
The logical data structure with one to many relationship is a

Network
Chain
Tree
All of these
      _____________________________________________________________________________________
E-R model uses this symbol to represent weak entity set

Dotted rectangle
Diamond
Doubly outlined rectangle
None of these
      _____________________________________________________________________________________
The problem that occurs when one transaction updates a database item and then the transaction fails for some reason is ________.

Temporary Select Problem
Temporary Modify Problem
Dirty Read Problem
None
      _____________________________________________________________________________________
A data model is a collection of conceptual tools for describing

Data and data relationships
Data semantics and consistency constraints
Data,data relationship,data semantics and consistency constraints
None of the above
      _____________________________________________________________________________________
In SQL, which command is used to select data in rows and column from one or more tables?

Choose
Select
List
Browse
      _____________________________________________________________________________________
In a B tree of order 5, the following keys are inserted as follows :
7, 8, 1, 4, 13, 20, 2, 6 and 5
How many elements are present in the root of the tree ?


1
2
3
4
      _____________________________________________________________________________________
An entity relationship diagram is a tool to represent

Data model
Process model
Event model
Customer model
      _____________________________________________________________________________________
SET concept is used in

Network Model
Hierarchical Model
Relational Model
None of these
      _____________________________________________________________________________________
The method of access which uses key transformation is known as

Direct
Hash
Random
Sequential
      _____________________________________________________________________________________
Which of the following operation is used if we are interested in only certain columns of a table?

Projection
Selection
Union
Join
      _____________________________________________________________________________________
If a relation scheme is in BCNF then it is also in

1NF
4NF
3NF
None of these
      _____________________________________________________________________________________
In a Hierarchical model records are organized as

Graph
List
Links
Tree
      _____________________________________________________________________________________
The DBMS that is most difficult to use is ________ .

Microsoft s SQL Server
Microsoft s Access
IBM s DB2
Oracle Corporation s Oracle
      _____________________________________________________________________________________
A computer file contains several records. What does each record contain?

Bytes
Words
Fields
Database
      _____________________________________________________________________________________
Which of the following is not a consequence of concurrent operations?

Lost update problem
Update anomaly
Unrepeatable read
Dirty read
      _____________________________________________________________________________________
The way a particular application views the data from the database that the application uses is a

Module
Relational model
Schema
Sub schema
      _____________________________________________________________________________________
There exists a construct which returns a value ‘true’ if the argument subquery is:

empty
non-empty
in error
none of the above
      _____________________________________________________________________________________
How many primitive operators of relation algebra as proposed by codd

2
3
4
6
      _____________________________________________________________________________________
Which of the following relational algebra operations do not require the participating tables to be union-compatible?

Union
Intersection
Difference
Join
      _____________________________________________________________________________________
A table joined with itself is called

Join
Self Join
Outer Join
Equi Join
      _____________________________________________________________________________________
_______is a program or set of program that interacts with the database at some point in its execution

A database system
A database application
Both
None
      _____________________________________________________________________________________
Match the following :
I. 2 NF    (a) transitive dependencies eliminated
II. 3 NF   (b) multivalued attribute removed
III. 4 NF  (c) contain no partial functional dependencies
IV. 5 NF   (d) contains no join dependency
Codes ( I   II  III IV )


(a) (c) (b) (d)
(d) (a) (b) (c)
(c) (d) (a) (b)
(d) (b) (a) (c)
      _____________________________________________________________________________________
Cartesian product in relational algebra is

Unary operator
Binary operator
Ternary operator
not defined
      _____________________________________________________________________________________
Use of UNIQUE while defining an attribute of a table in SQL means that the attribute values are

Distinct values
Cannot have NULL
Both (A) & (B)
Same as primary key
      _____________________________________________________________________________________
Which are the two ways in which entities can participate in a relationship?

Passive and active
Total and partial
Simple and Complex
All of the above
      _____________________________________________________________________________________
Goals for the design of the logical schema include

Avoiding data inconsistency
Being able to construct queries easily
Being able to access data efficiently
All of the above
      _____________________________________________________________________________________
Table is synonymous with the term

Record
Relation
Column
Field
      _____________________________________________________________________________________
The file organization that provides very fast access to any arbitrary record of a file is

Ordered file
Unordered file
Hashed file
B tree
      _____________________________________________________________________________________
An entity set that does not have sufficient attributes to form a primary key is a

Strong entity set
Weak entity set
Simple entity set
Primary entity set
      _____________________________________________________________________________________
Key to represent relationship between tables is called

Primary key
Secondary Key
Foreign Key
None of these
      _____________________________________________________________________________________
NULL is

The same as 0 for integer
The same as blank for character
The same as 0 for integer and blank for character
Not a value
      _____________________________________________________________________________________
In E-R Diagram derived attribute are represented by

Ellipse
Dashed ellipse
Rectangle
Triangle
      _____________________________________________________________________________________
 A hash table has space for 75 records, then the probability of collision before the table is 6% full.

.15
.20
.25
.30
      _____________________________________________________________________________________
The result of the UNION operation between R1 and R2 is a relation that includes

All the tuples of R1
All the tuples of R2
All the tuples of R1 and R2
All the tuples of R1 and R2 which have common columns
      _____________________________________________________________________________________
An index is clustered, if

it is on a set of fields that form a candidate key
it is on a set of fields that include the primary key.
the data records of the file are organized in the same order as the data entries of the index.
the data records of the file are organized not in the same order as the data entries of the index.
      _____________________________________________________________________________________
The basic variants of time-stampbased method of concurrency control are

Total time stamp-ordering
Partial time stamp ordering
Multiversion Time stamp ordering
All of the above
      _____________________________________________________________________________________
Shadow paging has

No redo
No undo
Redo but no undo
Neither redo nor undo
      _____________________________________________________________________________________
Which construct in SQL is used to test whether a subquery has any tuples in its result?

UNIQUE
EXISTS
GROUP BY
EXCEPT
      _____________________________________________________________________________________
The rule that a value of a foreign key must appear as a value of some specific table is called a

Referential constraint
Index
Integrity constraint
Functional dependency
      _____________________________________________________________________________________
In an E-R diagram an entity set is represent by a

Rectangle
Ellipse
Diamond box
Circle
      _____________________________________________________________________________________
An entity instance is a single occurrence of on

Entity type
Relational type
Entity and relationship type
None of these
      _____________________________________________________________________________________
Relational Algebra is

Data Definition Language
Meta Language
Procedural query Language
None of the above
      _____________________________________________________________________________________
Which of the following is a valid SQL type?

Character
Numeric
Float
All of the above
      _____________________________________________________________________________________
ODBC stands for

Object Database Connectivity
Oral Database Connectivity
Oracle Database Connectivity
Open Database Connectivity
      _____________________________________________________________________________________
The relational model feature is that there

Is no need for primary key data
Is much more data independence than some other database models.
Are explicit relationships among records.
Are tables with many dimensions
      _____________________________________________________________________________________
Multivalued dependency among attribute is checked at which level?

2NF
3NF
4NF
5NF
      _____________________________________________________________________________________
The database schema is written in

HLL
DML
DDL
DCL
      _____________________________________________________________________________________
 
Top