1410+ DataBase Management System (DBMS) Solved MCQs

These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Bachelor of Science in Computer Science FY (BSc CS) , Bachelor of Science in Computer Science SY (BSc CS) , Bachelor of Science in Information Technology SY (BSc IT) , Bachelor of Computer Applications (BCA) .

Chapters

Take a Test

701.	is a contiguous group of
A.	instance
B.	segment
C.	database
D.	dictionary
Answer» C. database

702.	is the smallest unit of allocation in an Oracle database.
A.	database
B.	instance
C.	tablespace
D.	database block
Answer» D. database block

703.	An Oracle is a set of tables and views that are used as a read-only reference about the database.
A.	database dictionary
B.	dictionary table
C.	data dictionary
D.	dictionary
Answer» C. data dictionary

704.	The is that part of main memory available for storage of copies of disk blocks.
A.	buﬀer
B.	catalog
C.	storage
D.	secondary storage
Answer» A. buﬀer

705.	A major goal of the database system is to minimize the number of block transfers between the disk and memory. This is achieved by
A.	buﬀer
B.	catalog
C.	storage
D.	secondary storage
Answer» A. buﬀer

706.	The subsystem responsible for the allocation of buﬀer space is called the
A.	buﬀer
B.	buﬀer manager
C.	storage
D.	secondary storage
Answer» B. buﬀer manager

707.	In the buﬀer where there is no space for another block, the block can be inserted using
A.	pinned block strategy
B.	forced output block
C.	buﬀer replacement strategy
D.	all of the mentioned
Answer» C. buﬀer replacement strategy

708.	A block that is not allowed to be written back to disk is said to be
A.	pinned
B.	forced
C.	buﬀer
D.	all of the mentioned
Answer» A. pinned

709.	In case the buﬀer manager do not write the blocks properly then the buﬀer manager uses
A.	replacement strategy
B.	forced strategy
C.	crash recovery system
D.	both replacement and forced strategy
Answer» C. crash recovery system

710.	The technique where the blocks which have been used are replaced is called
A.	replacement strategy
B.	forced strategy
C.	crash recovery system
D.	most recently used
Answer» D. most recently used

711.	frees the space occupied by a block as soon as the ﬁnal tuple of that block has been processed.
A.	replacement strategy
B.	forced strategy
C.	toss immediate strategy
D.	most recently used
Answer» C. toss immediate strategy

712.	Indices whose search key speciﬁes an order diﬀerent from the sequential order of the ﬁle are called indices.
A.	nonclustered
B.	secondary
C.	all of the mentioned
D.	none of the mentioned
Answer» C. all of the mentioned

713.	An consists of a search-key value and pointers to one or more records with that value as their search-key value.
A.	index entry
B.	index hash
C.	index cluster
D.	index map
Answer» A. index entry

714.	In a clustering index, the index record contains the search-key value and a pointer to the ﬁrst data record with that search-key value and the rest of the records will be in the sequential pointers.
A.	dense
B.	sparse
C.	straight
D.	continuous
Answer» A. dense

715.	In a index, an index entry appears for only some of the search-key values.
A.	dense
B.	sparse
C.	straight
D.	continuous
Answer» A. dense

716.	A search key containing more than one attribute is referred to as a search key.
A.	simple
B.	composite
C.	compound
D.	secondary
Answer» B. composite

717.	In B+ tree the node which points to another node is called
A.	leaf node
B.	external node
C.	final node
D.	internal node
Answer» D. internal node

718.	If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :
A.	less than 1
B.	less than n
C.	less than m
D.	less than n/2
Answer» A. less than 1

719.	A technique for direct search is
A.	binary search
B.	linear search
C.	tree search
D.	hashing
Answer» D. hashing

720.	Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.
A.	8, _, _, _, _, _, 10
B.	1, 8, 10, _, _, _, 3
C.	1, _, _, _, _, _,3
D.	1, 10, 8, _, _, _, 3
Answer» B. 1, 8, 10, _, _, _, 3

721.	Key value pairs is usually seen in
A.	hash tables
B.	heaps
C.	both hash tables and heaps
D.	skip list
Answer» A. hash tables

722.	What is the best deﬁnition of a collision in a hash table?
A.	two entries are identical except for their keys
B.	two entries with diﬀerent data have the exact same key
C.	two entries with diﬀerent keys have the same exact hash value
D.	two entries with the exact same key have diﬀerent hash values
Answer» A. two entries are identical except for their keys

723.	Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?
A.	all keys hash to same index
B.	all keys hash to diﬀerent indices
C.	all keys hash to an even-numbered index
D.	all keys hash to diﬀerent even-numbered indices
Answer» A. all keys hash to same index

724.	Breadth First Search is used in
A.	binary trees
B.	stacks
C.	graphs
D.	all of the mentioned
Answer» C. graphs

725.	A(n) can be used to preserve the integrity of a document or a message.
A.	message digest
B.	message summary
C.	encrypted message
D.	none of the mentioned
Answer» C. encrypted message

1410+ DataBase Management System (DBMS) Solved MCQs

is a contiguous group of

is the smallest unit of allocation in an Oracle database.

An Oracle is a set of tables and views that are used as a read-only reference about the database.

The is that part of main memory available for storage of copies of disk blocks.

A major goal of the database system is to minimize the number of block transfers between the disk and memory. This is achieved by

The subsystem responsible for the allocation of buﬀer space is called the

In the buﬀer where there is no space for another block, the block can be inserted using

A block that is not allowed to be written back to disk is said to be

In case the buﬀer manager do not write the blocks properly then the buﬀer manager uses

The technique where the blocks which have been used are replaced is called

frees the space occupied by a block as soon as the ﬁnal tuple of that block has been processed.

Indices whose search key speciﬁes an order diﬀerent from the sequential order of the ﬁle are called indices.

An consists of a search-key value and pointers to one or more records with that value as their search-key value.

In a clustering index, the index record contains the search-key value and a pointer to the ﬁrst data record with that search-key value and the rest of the records will be in the sequential pointers.

In a index, an index entry appears for only some of the search-key values.

A search key containing more than one attribute is referred to as a search key.

In B+ tree the node which points to another node is called

If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :

A technique for direct search is

Key value pairs is usually seen in

What is the best deﬁnition of a collision in a hash table?

Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?

Breadth First Search is used in

A(n) can be used to preserve the integrity of a document or a message.

The property (or set of properties) that uniquely deﬁnes each row in a table is called the:

The separation of the data deﬁnition from the program is known as:

In the client / server model, the database:

The database design that consists of multiple tables that are linked together through matching data stored in each table is called

The association role deﬁnes:

A on the attribute A of relation r consists of one bitmap for each value that A can take.

To identify the deleted records we use the

Bitmaps can be combined with regular B+- tree indices for relations where a few attribute values are extremely common, and other values also occur, but much less frequently.

What is the purpose of the index in sql server?

How many types of indexes are there in sql server?

How non clustered index point to the data?

Which one is true about clustered index?

What is true about indexes?

Does index take space in the disk?

If an index is the metadata and statistics continue to exists

In index instead of storing all the columns for a record together, each column is stored separately with all other rows in an index.

A index is the one which satisﬁes all the columns requested in the query without performing further lookup into the clustered index.

Which of the following schemas does deﬁne a view or views of the database for particular users?

Which of the following is an attribute that can uniquely identify a row in a table?

Which of the following terms does refer to the correctness and completeness of the data in a database?

The relationship between DEPARTMENT and EMPLOYEE is a

If the state of the database no longer reﬂects a real state of the world that the database is supposed to capture, then such a state is called

Ensuring isolation property is the responsibility of the

In query processing, the is the lowest-level operator to access data.

In a the system scans each ﬁle block and tests all records to see whether they satisfy the selection condition.

726.	The property (or set of properties) that uniquely deﬁnes each row in a table is called the:
A.	identiﬁer
B.	index
C.	primary key
D.	symmetric key
Answer» C. primary key

727.	The separation of the data deﬁnition from the program is known as:
A.	data dictionary
B.	data independence
C.	data integrity
D.	referential integrity
Answer» B. data independence

728.	In the client / server model, the database:
A.	is downloaded to the client upon request
B.	is shared by both the client and server
C.	resides on the client side
D.	resides on the server side
Answer» D. resides on the server side

729.	The database design that consists of multiple tables that are linked together through matching data stored in each table is called
A.	hierarchical database
B.	network database
C.	object oriented database
D.	relational database
Answer» D. relational database

730.	The association role deﬁnes:
A.	how tables are related in the database
B.	the relationship between the class diagram and the tables in the database
C.	the tables that each attribute is contained
D.	which attribute is the table’s primary key
Answer» A. how tables are related in the database

731.	A on the attribute A of relation r consists of one bitmap for each value that A can take.
A.	bitmap index
B.	bitmap
C.	index
D.	array
Answer» A. bitmap index

732.	To identify the deleted records we use the
A.	existence bitmap
B.	current bitmap
C.	final bitmap
D.	deleted bitmap
Answer» A. existence bitmap

733.	Bitmaps can be combined with regular B+- tree indices for relations where a few attribute values are extremely common, and other values also occur, but much less frequently.
A.	bitmap, b-tree
B.	bitmap, b+tree
C.	b-tree, bitmap
D.	b+tree, bitmap
Answer» B. bitmap, b+tree

734.	What is the purpose of the index in sql server?
A.	to enhance the query performance
B.	to provide an index to a record
C.	to perform fast searches
D.	all of the mentioned
Answer» D. all of the mentioned

735.	How many types of indexes are there in sql server?
A.	1
B.	2
C.	3
D.	4
Answer» B. 2