Académique Documents
Professionnel Documents
Culture Documents
A
Numeric fields
B
Data fields
C
Relational fields
D
Alpha fields
Answer D
___________________________________________________________________________________________
Batch processing is appropriate if
A
A large computer system is available
B
Only a small computer system is available
C
Only few transactions are involved
D
None of these
Answer D
___________________________________________________________________________________________
_______is a program or set of program that interacts with the database at some point in its execution
A
A database system
B
A database application
C
Both
D
None
Answer B
___________________________________________________________________________________________
The column of a table is referred to as the
A
Tuple
B
Attribute
C
Entity
D
Degree
Answer B
___________________________________________________________________________________________
The DBMS language component which can be embedded in a program is
A
The data definition language
B
The data manipulation language
C
The database administrator
D
A query language
Answer B
___________________________________________________________________________________________
Which of the following is an advantage of view?
A
Data security
B
Derived columns
C
Hiding of complex queries
D
All of the above
Answer D
___________________________________________________________________________________________
The language used in application programs to request data from the DBMS is referred to as the
A
DML
B
DDL
C
VDL
D
SDL
Answer A
___________________________________________________________________________________________
The method in which records are physically stored in a specified order according to a key field in each
record is
A
Hash
B
Direct
C
Sequential
D
All of the above
Answer A
___________________________________________________________________________________________
Key to represent relationship between tables is called
A
Primary key
B
Secondary Key
C
Foreign Key
D
None of these
Answer C
___________________________________________________________________________________________
Every BCNF decomposition is
A
Dependency preserving
B
Not dependency preserving
C
Need be dependency preserving
D
None of these
Answer C
___________________________________________________________________________________________
A data model is a collection of conceptual tools for describing
A
Data and data relationships
B
Data semantics and consistency constraints
C
Data,data relationship,data semantics and consistency constraints
D
None of the above
Answer C
___________________________________________________________________________________________
A window into a portion of a database is
A Schema
B
View
C
Query
D Data dictionary
Answer B
A _____ DBMS distributes data processing tasks between the workstation and a network server.
A
Network
B
Relational
C
Client Server
D
Hierarchical
Answer C
___________________________________________________________________________________________
Architecture of the database can be viewed as
A
Two levels
B
Four levels
C
Three levels
D
One level
Answer C
___________________________________________________________________________________________
Which of the following database object does not physically exist?
A
Base table
B
Index
C
View
D
None of the above
Answer C
___________________________________________________________________________________________
Atomicity is ensured by the component
A
Observable external writer
B
Transaction management component
C
Recovery management component
D
Concurrency control component
Answer B
___________________________________________________________________________________________
Which of the following is type of DBMS software?
A
Database manipulation language
B
Query language
C
Utilities
D
All of these
Answer D
___________________________________________________________________________________________
DBMS helps achieve
A
Data independence
B
Centralized control of data
C
Neither (A) nor (B)
D
Both (A) and (B)
Answer D
___________________________________________________________________________________________
Which data management language component enabled the DBA to define the schema components ?
A
DML
B
Sub-schema DLL
C
Schema DLL
D
All of these
Answer C
___________________________________________________________________________________________
SET concept is used in
A
Network Model
B
Hierarchical Model
C
Relational Model
D
None of these
Answer A
___________________________________________________________________________________________
The view of total database content is
A
Conceptual view
B
Internal view
C
External view
D
Physical View
Answer A
___________________________________________________________________________________________
ACID stands for
A
Atomicity, consistency, isolation and durability
B
Atomicity, command, integrity and data
C
Atomicity, control, integrated and direct
D
None of these
Answer A
___________________________________________________________________________________________
Most of the time, modification anomalies are serious enough that tables should be normalized into
A
1NF
B
2NF
C
3NF
D
BCNF
Answer D
___________________________________________________________________________________________
A subclass having more than one super class is called
A
Category
B
Classification
C
Combination
D
Partial participation
Answer D
An entity set that does not have sufficient attributes to form a primary key is a
A
Strong entity set
B
weak entity set
C
Simple entity set
D
Primary entity set
Answer B
___________________________________________________________________________________________
In an E-R diagram an entity set is represent by a
A
Rectangle
B
Ellipse
C
Diamond box
D
Circle
Answer A
___________________________________________________________________________________________
In E-R Diagram relationship type is represented by
A
Ellipse
B
Dashed ellipse
C
Rectangle
D
Diamond
Answer D
___________________________________________________________________________________________
By means of a data flow diagram, the analyst can detect
A
Task duplication
B
Unnecessary delays
C
Task overlapping
D
All of the above
Answer D
Given the basic ER and relational models, which of the following is INCORRECT?
A An attribute of an entity can have more than one value
B An attribute of an entity can be composite
C In a row of a relational table, an attribute can have more than one value
D In a row of a relational table, an attribute can have exactly one value or a NULL value
Answer C
___________________________________________________________________________________________
Which of the following indicates the maximum number of entities that can be involved in a relationship?
A
Minimum cardinality
B
Maximum cardinality
C
ERD
D
Greater Entity Count
Answer B
___________________________________________________________________________________________
The result of the UNION operation between R1 and R2 is a relation that includes
A
All the tuples of R1
B
All the tuples of R2
C
All the tuples of R1 and R2
D
All the tuples of R1 and R2 which have common columns
Answer D
___________________________________________________________________________________________
Relational calculus is a
A
Procedural language
B
Non Procedural language
C
Data definition language
D
High level language
Answer B
___________________________________________________________________________________________
Which of the following relational algebra operations do not require the participating tables to be unioncompatible?
A
Union
B
Intersection
C
Difference
D
Join
Answer D
___________________________________________________________________________________________
The relational model feature is that there
A
Is no need for primary key data
B
Is much more data independence than some other database models.
C
Are explicit relationships among records.
D
Are tables with many dimensions
Answer B
___________________________________________________________________________________________
A
B
C
D
7
4
5
9
Answer A
___________________________________________________________________________________________
Which of the operations constitute a basic set of operations for manipulating relational data?
A
Predicate calculus
B
Relational calculus
C
Relational algebra
D
None of the above
Answer C
___________________________________________________________________________________________
In the relational modes, cardinality is termed as
A Number of tuples
B Number of attributes
C Number of tables
D Number of constraints
Answer A
Which of the following statements are TRUE about an SQL query?
P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause
Q: An SQL query can contain a HAVING clause only if it has a GROUP BY clause
R : All attributes used in the GROUP BY clause must appear in the SELECT clause
S : Not all attributes used in the GROUP BY clause need to appear in the SELECT clause
A
P and R
B
P and S
C
Q and R
D
Q and S
Answer C
___________________________________________________________________________________________
The PROJECT Command will create new table that has
A
more fields than the original table
B
more rows than original table
C
both (A) & (B)
D
none of these
Answer D
___________________________________________________________________________________________
A relational database developer refers to a record as
A
A criteria
B
A relation
C
A tuple
D
An attribute
Answer C
___________________________________________________________________________________________
Relational Algebra is
A
Data Definition Language
B
Meta Language
C
Procedural query Language
D
None of the above
Answer C
___________________________________________________________________________________________
Cartesian product in relational algebra is
A
Unary operator
B
Binary operator
C
Ternary operator
D
not defined
Answer B
___________________________________________________________________________________________
(i) DML includes a query language based on both relation algebra and tuple calculus
(ii) DML includes a query language based on tuple calculus
(iii) DML includes a query language based on relational algebra
(iv) DML includes a query language based on none of the relational algebra and tuple calculus
Which one is correct?
A
(i) only
B
(ii) only
C
(iii) only
D
(iv) only
Answer A
___________________________________________________________________________________________
How many tuples does the result of the following SQL query contain?
SELECT A.Id
FROM A
WHERE A.Age > ALL (SELECT B.Age
FROM B
WHERE B.Name = Arun)
A
4
B
3
C
0
D
1
Answer B
___________________________________________________________________________________________
Which of the following operation is used if we are interested in only certain columns of a table?
A
Projection
B
Selection
C
Union
D
Join
Answer A
Which of the following is TRUE?
A Every relation in 3NF is also in BCNF
B A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R
C Every relation in BCNF is also in 3NF
D No relation can be in both BCNF and 3NF
Answer C
___________________________________________________________________________________________
The normal form that is not necessarily dependency preserving is
A
2NF
B
3NF
C
BCNF
D
4NF
Answer A
___________________________________________________________________________________________
Table is synonymous with the term
A
Record
B
Relation
C
Column
D
Field
Answer B
___________________________________________________________________________________________
Data integrity control
A Is used to set upper and lower limits on numeric data
B Requires the use of passwords to prohibit unauthorized access to the file
C Has the data dictionary keep the date and time of last access last back-up, and most recent modification for all
files
D All of the above
Answer C
___________________________________________________________________________________________
A table joined with itself is called
A
Join
B
Self Join
C
Outer Join
D
Equi Join
Answer B
___________________________________________________________________________________________
The rule that a value of a foreign key must appear as a value of some specific table is called a
A
Referential constraint
B
Index
C
Integrity constraint
D
Functional dependency
Answer A
___________________________________________________________________________________________
Which of the following is TRUE?
A Every relation in 3NF is also in BCNF
B A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R
C Every relation in BCNF is also in 3NF
D No relation can be in both BCNF and 3NF
Answer C
___________________________________________________________________________________________
Fifth Normal form is concerned with
A
Functional dependency
B
Multivalued dependency
C
Join dependency
D
Domain-key
Answer C
___________________________________________________________________________________________
In generalisation, the differences between members of an entity is
A
maximized
B
minimized
C
both (A) & (B)
D
None of these
Answer A
___________________________________________________________________________________________
A functional dependency is a relationship between or among
A
Tables
B
Rows
C
Relations
D
Attributes
Answer D
The dependency preservation decomposition is a property to decompose database schema D, in which each
functional dependency XY specified in F,
A appeared directly in one of the relation schemas Ri in the decomposed D.
B could be inferred from dependencies that appear in some Ri..
C both (A) and (B)
D None of these
Answer C
___________________________________________________________________________________________
Generalization is _______ process.
A
top-down
B
bottom up
C
both (A) & (B)
D
None of these
Answer B
___________________________________________________________________________________________
One solution to the multivalued dependency constraint problem is to
A
Split the relation into two relations, each with a single theme
B
Change the theme
C
Create a new theme
D
Add a composite key
Answer A
___________________________________________________________________________________________
The language which has recently become the defacto standard for interfacing application programs with
relational database system is
A
Oracle
B
SQL
C
DBase
D
4GL
Answer B
___________________________________________________________________________________________
Which of the following statement on the view concept in SQL is invalid?
A All views are not updateable
B The views may be referenced in an SQL statement whenever tables are referenced
C The views are instantiated at the time they are referenced and not when they are defined
D The definition of a view should not have GROUP BY clause in it
Answer D
The statement in SQL which allows to change the definition of a table is
A
Alter
B
Update
C
Create
D
Select
Answer A
___________________________________________________________________________________________
In SQL which command is used to select data in rows and column from one or more tables?
A
CHOOSE
B
SELECT
C
LIST
D
BROWSE
Answer B
___________________________________________________________________________________________
The keyword to eliminate duplicate rows from the query result in SQL is
A
Distinct
B
No Duplicate
C
Unique
D
None of the above
Answer C
___________________________________________________________________________________________
Use of UNIQUE while defining an attribute of a table in SQL means that the attribute values are
A
Distinct values
B
Cannot have NULL
C
Both (A) & (B)
D
Same as primary key
Answer C
___________________________________________________________________________________________
A DBMS query language is designed to
A
Support end users who use English-like commands
B
Support in the development of complex applications software
C
Specify the structure of a database
D
All of the above
Answer D
___________________________________________________________________________________________
Which of the following is a comparison operator in SQL?
A
Equal to
B
Like
C
Between
D
All of the above
Answer D
___________________________________________________________________________________________
Which command defines its columns, integrity constraint in create table
A
Create command
B
Drop table command
C
Alter table command
D
All of these
Answer A
___________________________________________________________________________________________
A / B+ tree index is to be built on the name attribute of the relation STUDENT. Assume that all students
names are of length 8 bytes, disk block are of size 512 bytes and index pointers are of size 4 bytes. Given
this scenario what would be the best choice of the degree (i.e. the number of pointers per node) of the B+
tree ?
A
16
B
22
C
43
D
44
Answer A
___________________________________________________________________________________________
Which of the following statements is true, when structure of database file with 20 records is modified
A
? EOF ( ) Prints T
B
? BOF ( ) Prints F
C
? BOF ( ) Prints T
D
? EOF ( ) Prints F
Answer A
The main idea behind computer files is that it is convenient
A
Arrange them
B
Store information
C
Create them
D
Access them
Answer D
___________________________________________________________________________________________
A file produced by a spreadsheet
A
Is generally stored on disk in an ASCII text format
B
Can be used as it by the DBMS
C
Can be used for graphic
D
All of the above
Answer A
___________________________________________________________________________________________
A computer file contains several records. What does each record contain?
A
Bytes
B
Words
C
Fields
D
Database
Answer C
___________________________________________________________________________________________
An indexing operation
A
Is sorted in ascending order
B
Contains only a list of keys and record numbers
C
Has a number assigned to each record
D
Both B and C
Answer C
___________________________________________________________________________________________
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 ?
A
1
B
2
C
3
D
4
Answer B
___________________________________________________________________________________________
A file organization component VSAM file is
A
Relative records data set
B
Keyed sequential data set
C
Entry sequential data set
D
All of the above
Answer D
___________________________________________________________________________________________
The master list of an indexed file
A
Is sorted in ascending order
B
Contains only a list of keys and record numbers
C
Has a number assigned to reach record
D
Both A and B
Answer C
___________________________________________________________________________________________
Two files may be joined into a third file if they have
A
Row in common
B
Field in common
C
No records with the same value in the common field
D
Both B and C
Answer B
___________________________________________________________________________________________
Which command classes text file, which has been created using SET ALTERNATIVE <FILE NAME>
Command ?
A
SET ALTERNATE OFF
B
CLOSE DATABASE
C
CLOSE ALTERNATE
D
CLEAR ALL
Answer A
___________________________________________________________________________________________
Index consists of
A
A list of keys
B
Pointers to the master list
C
Both A and B
D
None of these
Answer C
___________________________________________________________________________________________
The number of disk accesses performed by insertion operation in B-tree of height h is
A
0(1)
B
0(1gh)
C
0(h)
D
None of these
Answer C
___________________________________________________________________________________________
B+ tree are preferred to binary tree in Database because
A
Disk capacity are greater than memory capacities
B
Disk access is much slower than memory access
C
Disk data transfer rates are much less than memory data transfer rate
D
Disks are more reliable than memory
Answer B
___________________________________________________________________________________________
Isolation is ensured by the component
A
Observable external writer
B
Transaction management component
C
Recovery management component
D
Concurrency control component
Answer D
___________________________________________________________________________________________
In multiuser database if two users wish to update the same record at the same time, they are prevented
from doing so by
A
Jamming
B
Password
C
Documentation
D
Record lock
Answer D
The problem that occurs when one transaction updates a database item and then the transaction fails for
some reason is ________.
A
Temporary Select Problem
B
Temporary Modify Problem
C
Dirty Read Problem
D
None
Answer C
___________________________________________________________________________________________
Which of the following concurrency control schemes is not based on the serializability property?
A
Two phase locking
B
Graph-based locking
C
Time-stamp based locking
D
None of these
Answer D
___________________________________________________________________________________________
Which of the following schemas are used for ensuring atomicity?
A
Log with deferred modification
B
Log with immediate modification
C
Shadow paging
D
All of the above
Answer D
___________________________________________________________________________________________
Shadow paging has
A No redo
B No undo
C Redo but no undo
D Neither redo nor undo
Answer A
Which of the following is not a consequence of concurrent operations?
A
Lost update problem
B
Update anomaly
C
Unrepeatable read
D
Dirty read
Answer B
___________________________________________________________________________________________
The concept of locking can be used to solve the problem of
A
Deadlock
B
Lost update
C
Inconsistent
D
All of the above
Answer D
___________________________________________________________________________________________
The name of the transaction file shall be provided by the operator and the file that contains the edited
transactions ready for execution shall be called
A
Batch. Exe
B
Trans. Exe
C
Opt. Exe
D
Edit.Exe
Answer C
___________________________________________________________________________________________
If a transaction T has obtained an exclusive lock on item Q, then T can
A
Read Q
B
Write Q
C
Both read and write Q
D
Write Q but not read Q
Answer C
___________________________________________________________________________________________
Consider a schema R(A, B, C, D) and functional dependencies AB and CD. Then the decomposition
R1(A, B) and R2(C, D) is
A
Dependency preserving but not lossless join
B
Dependency preserving and lossless join
C
Lossless Join but not dependency preserving
D
Lossless Join
Answer A
___________________________________________________________________________________________
Data security threats include
A
Privacy invasion
B
Hardware failure
C
Fraudulent manipulation of data
D
Encryption and decryption
Answer C
___________________________________________________________________________________________
Which of the following ensures the atomicity of the transaction?
A
Transaction management component of DBMS
B
Application Programmer
C
Concurrency control component of DBMS
D
Recovery management component of DBMS
Answer A
___________________________________________________________________________________________