Database Management System Set 22
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),
Bachelor of Business Administration in Computer Applications (BBA [CA]),
Bachelor of Science in Information Technology (BSc IT),
On This Page
This set of DataBase Management System (DBMS) Multiple Choice Questions & Answers (MCQs) focuses on Database Management System Set 22
Q1 | 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.
- bitmap, b-tree
- bitmap, b+tree
- b-tree, bitmap
- b+tree, bitmap
Q2 | What is the purpose of the index in sql server?
- to enhance the query performance
- to provide an index to a record
- to perform fast searches
- all of the mentioned
Q3 | How many types of indexes are there in sql server?
- 1
- 2
- 3
- 4
Q4 | How non clustered index point to the data?
- it never points to anything
- it points to a data row
- it is used for pointing data rows containing key values
- none of the mentioned
Q5 | Which one is true about clustered index?
- clustered index is not associated with table
- clustered index is built by default on unique key columns
- clustered index is not built on unique key columns
- none of the mentioned
Q6 | What is true about indexes?
- indexes enhance the performance even if the table is updated frequently
- it makes harder for sql server engines to work to work on index which have large keys
- it doesn’t make harder for sql server engines to work to work on index which have large keys
- none of the mentioned
Q7 | Does index take space in the disk?
- it stores memory as and when required
- yes, indexes are stored on disk
- indexes are never stored on disk
- indexes take no space
Q8 | If an index is the metadata and statistics continue to exists
- disabling
- dropping
- altering
- both disabling and dropping
Q9 | In index instead of storing all the columns for a record together, each column is stored separately with all other rows in an index.
- clustered
- column store
- non clustered
- row store
Q10 | A index is the one which satisfies all the columns requested in the query without performing further lookup into the clustered index.
- clustered
- non clustered
- covering
- b-tree
Q11 | Which of the following schemas does define a view or views of the database for particular users?
- internal schema
- conceptual schema
- physical schema
- external schema
Q12 | Which of the following terms does refer to the correctness and completeness of the data in a database?
- data security
- data constraint
- data independence
- data integrity
Q13 | 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
- consistent state
- parallel state
- durable state
- inconsistent state
Q14 | Ensuring isolation property is the responsibility of the
- recovery-management component of the dbms
- concurrency-control component of the dbms
- transaction-management component of the dbms
- buffer management component in dbms
Q15 | In query processing, the is the lowest-level operator to access data.
- index search
- linear search
- file scan
- access paths
Q16 | In a the system scans each file block and tests all records to see whether they satisfy the selection condition.
- index search
- linear search
- file scan
- access paths
Q17 | Which algorithm uses equality comparison on a key attribute with a primary index to retrieve a single record that satisfies the corresponding equality condition.
- a2
- a4
- a5
- a6
Q18 | The strategy can retrieve a single record if the equality condition is on a key; multiple records may be retrieved if the indexing field is not a key is
- a2
- a4
- a5
- a6
Q19 | The algorithm that uses a secondary ordered index to guide retrieval for comparison conditions involving <,≤,≥, or > is
- a2
- a4
- a5
- a6
Q20 | The algorithm scans each index for pointers to tuples that satisfy an individual condition.
- a2
- a4
- a9
- a6
Q21 | If access paths are available on all the conditions of a disjunctive selection, each index is scanned for pointers to tuples that satisfy the individual condition. This is satisfied by
- a10
- a7
- a9
- a6
Q22 | The space factor when determining the efficiency of an algorithm is measured by
- counting the maximum memory needed by the algorithm
- counting the minimum memory needed by the algorithm
- counting the average memory needed by the algorithm
- counting the maximum disk space needed by the algorithm
Q23 | Which of the following case does not exist in complexity theory
- best case
- worst case
- average case
- null case
Q24 | Which of the following is an attribute that can uniquely identify a row in a table?
- secondary key
- candidate key
- foreign key
- alternate key
Q25 | The relationship between DEPARTMENT and EMPLOYEE is a
- one-to-one relationship
- one-to-many relationship
- many-to-many relationship
- many-to-one relationship