DATA BASE

If a relation scheme is in BSNF then it is also in
• A. First normal form
• B. Second normal form
• C. Third normal form
• D. All of the above

Answer: Option C

Attribute of table A is matching with primary key of table B, is called
• A. foreign key
• B. secondary key
• C. candidate key
• D. composite key

Answer: Option A

Allocation map
• A. Used to store program data
• B. specifies which blocks are used by which file
• C. is updated by application programs
• D. allow programs to erase files

Answer: Option B

The master list of an indexed file
• A. is sorted in ascending order
• B. contains only a record numbers
• C. has a number alloted to each record
• D. none of above

Answer: Option C

Database management systems are used to
• A. eliminate data redundancy
• B. establish relationships among records in different files
• C. manage file access
• D. none of above

Answer: Option D

Ascending order of data hierarchy is
• A. bit->byte->record->field->file->database
• B. bit->byte->field->record->file->database
• C. byte->bit->field->record->file->database
• D. byte->bit->field->file->record->database

Answer: Option B

Which is not a logical database structure
• A. Chain
• B. Tree
• C. Relational
• D. Network

Answer: Option A

Embedded pointer provides
• A. a secondary access path
• B. a physical record key
• C. an inverted index
• D. all of above

Answer: Option A

Network structure
• A. is a physical representation of data
• B. is conceptually simple
• C. allows many to many relationships
• D. none of above

Answer: Option C

File record length
• A. should always be fixed
• B. should always be variable
• C. should be chosen to match the data character
• D. depends upon the size of file

Answer: Option D

Data management system may be implemented as
• A. system software
• B. application software
• C. computer program
• D. all of above

Answer: Option D

RAID configurations of a disk for purpose of
• A. fault tolerance
• B. high speed
• C. high data density
• D. none of above

Answer: Option A

Which among following is an approach for standardizing storing of data
• A. MIS
• B. Structured programming
• C. CODASYL specifications
• D. None of above

Answer: Option C

____________ contains a complete record of all activity that affected the contents of a database during a creation period of time
• A. report writer
• B. query language
• C. DML
• D. transaction log

Answer: Option D

_______ is logical structure of one to many relationships.
• A. network
• B. tree
• C. chain
• D. relational

Answer: Option B

Which one among the following is normal form is considered adequate for normal relational database design
• A. 2NF
• B. 5NF
• C. 3NF
• D. 4NF

Answer: Option C

Transaction processing was made feasible by the development of
• A. direct access storage
• B. magnetic tape
• C. cash register input
• D. minicomputers

Answer: Option A

Physical location of a record in database is determined with the assist of
• A. B tree file
• B. Indexed file
• C. Hashed file
• D. sequential file

Answer: Option C

Modify operation is likely to be over after
• A. Delete
• B. Lookup
• C. Indexing
• D. Insertion

Answer: Option B

__________ is not a relational database
• A. dBase IV
• B. 4th Dimention
• C. FoxPro
• D. Reflex

Answer: Option D

Fragmentation of a file system
• A. Can always be prevented
• B. Can be temporarily removed by compaction
• C. A and B
• D. None of above

Answer: Option C

Which is a type of DBMS software
• A. utilities
• B. query language
• C. report writer
• D. All of above

Answer: Option D

Large collection of files are called
• A. fields
• B. Records
• C. Database
• D. Sectors

Answer: Option C

For using of DBMS, it is essential to understand
• A. the physical schema
• B. all subschemas
• C. one sub schema
• D. none of above

Answer: Option C

Data dictionary is a special file that have
• A. the names of every fields of every files
• B. data types of every fields of every files
• C. Both of above
• D. None of above

Answer: Option B

Two fundemantal types of record access methods are
• A. sequential and random
• B. direct and immediate
• C. sequential and indexed
• D. online and real time

Answer: Option C

Secondary index can be related with
• A. Function dependency
• B. B tree
• C. Domain calculus
• D. Relational algebric operators

Answer: Option B

Natural join can be related with
• A. Function dependency
• B.  tree
• C. Domain calculus
• D. Relational algebric operators

Answer: Option D

Non procedural query language can be related with
• A. Function dependency
• B. B tree
• C. Domain calculus
• D. Relational algebric operators

Answer: Option C

_______________ performs the Administrative supervision of database
• A. Database administrator
• B. DP Manager
• C. DB Manager
• D. None of above

Answer: Option A

_________ is used for adds a new field to an active database.
• A. MODIFY LABEL
• B. MODIFY COMMAND
• C. MODIFY STRUCTURE
• D. MODIFY REPORT

Answer: Option C

______ , set a link between two database files
• A. JOIN
• B. UPDATE
• C. BROWSE
• D. SET RELATION

Answer: Option D

The highest parts of a record are called
• A. files
• B. data
• C. fields
• D. formats

Answer: Option C

Related fields in a data base are set to form
• A. data file
• B. data record
• C. menu
• D. bank

Answer: Option B

Data item features that are essential in data management include
• A. punctuation
• B. language
• C. spelling
• D. width

Answer: Option D

Data dictionary tell DBMS
• A. what files are in the database
• B. what attributes are processed by data
• C. what these files contain
• D. all of above

Answer: Option D