MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1294 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 901. |
The strategy can retrieve a single record if the equality condition is on a key; multiple records may be retrieved if the indexing ï¬eld is not a key is |
| A. | a2 |
| B. | a4 |
| C. | a5 |
| D. | a6 |
| Answer» C. a5 | |
| 902. |
Which algorithm uses equality comparison on a key attribute with a primary index to retrieve a single record that satisï¬es the corresponding equality condition. |
| A. | a2 |
| B. | a4 |
| C. | a5 |
| D. | a6 |
| Answer» B. a4 | |
| 903. |
In a                          the system scans each ï¬le block and tests all records to see whether they satisfy the selection condition. |
| A. | index search |
| B. | linear search |
| C. | file scan |
| D. | access paths |
| Answer» C. file scan | |
| 904. |
In query processing, the                        is the lowest-level operator to access data. |
| A. | index search |
| B. | linear search |
| C. | file scan |
| D. | access paths |
| Answer» D. access paths | |
| 905. |
If the state of the database no longer reflects a real state of the world that the database is supposed to capture, then such a state is called |
| A. | consistent state |
| B. | parallel state |
| C. | durable state |
| D. | inconsistent state |
| Answer» E. | |
| 906. |
Ensuring isolation property is the responsibility of the |
| A. | recovery-management component of the dbms |
| B. | concurrency-control component of the dbms |
| C. | transaction-management component of the dbms |
| D. | buffer management component in dbms |
| Answer» C. transaction-management component of the dbms | |
| 907. |
The relationship between DEPARTMENT and EMPLOYEE is a |
| A. | one-to-one relationship |
| B. | one-to-many relationship |
| C. | many-to-many relationship |
| D. | many-to-one relationship |
| Answer» C. many-to-many relationship | |
| 908. |
Which of the following terms does refer to the correctness and completeness of the data in a database? |
| A. | data security |
| B. | data constraint |
| C. | data independence |
| D. | data integrity |
| Answer» E. | |
| 909. |
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. | clustered |
| B. | column store |
| C. | non clustered |
| D. | row store |
| Answer» C. non clustered | |
| 910. |
A                                    index is the one which satisï¬es all the columns requested in the query without performing further lookup into the clustered index. |
| A. | clustered |
| B. | non clustered |
| C. | covering |
| D. | b-tree |
| Answer» D. b-tree | |
| 911. |
Which of the following is an attribute that can uniquely identify a row in a table? |
| A. | secondary key |
| B. | candidate key |
| C. | foreign key |
| D. | alternate key |
| Answer» C. foreign key | |
| 912. |
Which of the following schemas does deï¬ne a view or views of the database for particular users? |
| A. | internal schema |
| B. | conceptual schema |
| C. | physical schema |
| D. | external schema |
| Answer» E. | |
| 913. |
If an index is                                    the metadata and statistics continue to exists |
| A. | disabling |
| B. | dropping |
| C. | altering |
| D. | both disabling and dropping |
| Answer» B. dropping | |
| 914. |
Does index take space in the disk? |
| A. | it stores memory as and when required |
| B. | yes, indexes are stored on disk |
| C. | indexes are never stored on disk |
| D. | indexes take no space |
| Answer» C. indexes are never stored on disk | |
| 915. |
What is true about indexes? |
| A. | indexes enhance the performance even if the table is updated frequently |
| B. | it makes harder for sql server engines to work to work on index which have large keys |
| C. | it doesn’t make harder for sql server engines to work to work on index which have large keys |
| D. | none of the mentioned |
| Answer» C. it doesn’t make harder for sql server engines to work to work on index which have large keys | |
| 916. |
Which one is true about clustered index? |
| A. | clustered index is not associated with table |
| B. | clustered index is built by default on unique key columns |
| C. | clustered index is not built on unique key columns |
| D. | none of the mentioned |
| Answer» C. clustered index is not built on unique key columns | |
| 917. |
How non clustered index point to the data? |
| A. | it never points to anything |
| B. | it points to a data row |
| C. | it is used for pointing data rows containing key values |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 918. |
How many types of indexes are there in sql server? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 919. |
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» E. | |
| 920. |
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» C. b-tree, bitmap | |
| 921. |
To identify the deleted records we use the |
| A. | existence bitmap |
| B. | current bitmap |
| C. | final bitmap |
| D. | deleted bitmap |
| Answer» B. current bitmap | |
| 922. |
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» B. bitmap | |
| 923. |
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» B. the relationship between the class diagram and the tables in the database | |
| 924. |
Indices whose search key speciï¬es an order different 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» D. none of the mentioned | |
| 925. |
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» E. | |
| 926. |
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» E. | |
| 927. |
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» C. data integrity | |
| 928. |
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» D. symmetric key | |
| 929. |
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» D. none of the mentioned | |
| 930. |
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 different indices |
| C. | all keys hash to an even-numbered index |
| D. | all keys hash to different even-numbered indices |
| Answer» B. all keys hash to different indices | |
| 931. |
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 different data have the exact same key |
| C. | two entries with different keys have the same exact hash value |
| D. | two entries with the exact same key have different hash values |
| Answer» B. two entries with different data have the exact same key | |
| 932. |
Key value pairs is usually seen in |
| A. | hash tables |
| B. | heaps |
| C. | both hash tables and heaps |
| D. | skip list |
| Answer» B. heaps | |
| 933. |
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» C. 1, _, _, _, _, _,3 | |
| 934. |
A technique for direct search is |
| A. | binary search |
| B. | linear search |
| C. | tree search |
| D. | hashing |
| Answer» E. | |
| 935. |
If h is any hashing function and is used to hash n keys in to a table of size m, where n |
| A. | less than 1 |
| B. | less than n |
| C. | less than m |
| D. | less than n/2 |
| Answer» B. less than n | |
| 936. |
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» E. | |
| 937. |
A search key containing more than one attribute is referred to as a                    search key. |
| A. | simple |
| B. | composite |
| C. | compound |
| D. | secondary |
| Answer» C. compound | |
| 938. |
In a                      index, an index entry appears for only some of the search-key values. |
| A. | dense |
| B. | sparse |
| C. | straight |
| D. | continuous |
| Answer» B. sparse | |
| 939. |
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» B. sparse | |
| 940. |
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» B. index hash | |
| 941. |
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» E. | |
| 942. |
                                       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» D. most recently used | |
| 943. |
In case the buffer manager do not write the blocks properly then the buffer manager uses |
| A. | replacement strategy |
| B. | forced strategy |
| C. | crash recovery system |
| D. | both replacement and forced strategy |
| Answer» D. both replacement and forced strategy | |
| 944. |
A block that is not allowed to be written back to disk is said to be |
| A. | pinned |
| B. | forced |
| C. | buffer |
| D. | all of the mentioned |
| Answer» B. forced | |
| 945. |
In the buffer where there is no space for another block, the block can be inserted using |
| A. | pinned block strategy |
| B. | forced output block |
| C. | buffer replacement strategy |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 946. |
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. | buffer |
| B. | catalog |
| C. | storage |
| D. | secondary storage |
| Answer» B. catalog | |
| 947. |
The subsystem responsible for the allocation of buffer space is called the |
| A. | buffer |
| B. | buffer manager |
| C. | storage |
| D. | secondary storage |
| Answer» C. storage | |
| 948. |
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» D. dictionary | |
| 949. |
A tablespace is further broken down into |
| A. | tablespace |
| B. | segments |
| C. | extents |
| D. | blocks |
| Answer» C. extents | |
| 950. |
                     is a contiguous group of |
| A. | instance |
| B. | segment |
| C. | database |
| D. | dictionary |
| Answer» D. dictionary | |