Data Base Questions & Answers (Compiled from UPSC, SSC ,PSC ,IBPS previous question papers)

Non procedural query language can be related with
Function dependency
B tree
Domain calculus
Relational algebric operators

Natural join can be related with
Function dependency
B tree
Domain calculus
Relational algebric operators

Secondary index can be related with
Function dependency
B tree
Domain calculus
Relational algebric operators

Two basic types of record access methods are
sequential and random
direct and immediate
sequential and indexed
online and real time

Data dictionary is a special file that contains
the names of all fields in all files
the data types of all fields of all files
Both of above
None of above

In order to use a DBMS, it is important to understand
the physical schema
all subschemas
one sub schema
none of above

Large collection of files are called
fields
Records
Database
Sectors

Which is a type of DBMS software
utilities
query language
report writer
All of above

Fragmentation of a file system
Can always be prevented
occurs only is file is not used properly
Can be temporarily removed by compaction
None of above

Which among following is not a relational database
dBase IV
4th Dimention
FoxPro
Reflex

Modify operation is likely to be done after
Delete
Lookup
Indexing
Insertion

Physical location of a record in database is determined with the help of
B tree file
Indexed file
Hashed file
sequential file

Transaction processing was made possible by the development of
direct access storage
magnetic tape
cash register input
minicomputers

Which normal form is considered adequate for normal relational database design
2NF
5NF
3NF
4NF

The logical structure with one to many relationships is a
network
tree
chain
relational

Which among following contains a complete record of all activity that affected the contents of a database during a creation period of time
report writer
query language
DML
transaction log
Answer And Explanation

Which among following is an approach for standardizing storing of data
MIS
Structured programming
CODASYL specifications
None of above

RAID configurations of a disk are used to provide
fault tolerance
high speed
high data density
none of above

Data management system may be implemented as
system software
application software
computer program
all of above

File record length
should always be fixed
should always be variable
should be chosen to match the data character
depends upon the size of file

Network structure
is a physical representation of data
is conceptually simple
allows many to many relationships
none of above

Embedded pointer provides
a secondary access path
a physical record key
an inverted index
all of above

Which is not a logical database structure
Chain
Tree
Relational
Network

Ascending order of data hierarchy is
bit->byte->record->field->file->database
bit->byte->field->record->file->database
byte->bit->field->record->file->database
byte->bit->field->file->record->database

Database management systems are used to
eliminate data redundancy
establish relationships among records in different files
manage file access
none of above

The master list of an indexed file
is sorted in ascending order
contains only a list of keys and record numbers
has a number assigned to each record
none of above

Allocation map
Used to store program data
specifies which blocks are used by which file
is updated by application programs
allow programs to erase files

Attribute of one table matching to the primary key of other table, is called as
foreign key
secondary key
candidate key
composite key

If a relation scheme is in BSNF then it is also in
First normal form
Second normal form
Third normal form
Not in any normal form

‹ First 2 3 4

Categories

Android C programming C++ programming Cloud Computing Computer Computer System Architecure Data Base Data Structure Internet & Social Media Java programming Manual Testing MS Office MySQL Networking Operating System PHP Programming Software Engineering Software Testing

Data Base Question Answers, PSC, UPSC, IBPS, SSC Previous Papers