COMPUTER SCIENCE QUIZ - I: Part 3

Topic 3 - DATABASE MANAGEMENT SYSTEM

Q.1 Assume that R in an entity-relationship (ER) model is a many-to-one link between entity sets E1 and E2. Assume that E1 and E2 are totally involved in R and that E1's cardinality is higher than the cardinality of E2.

Which of the following statements regarding R is true?

1. Every object in E1 has precisely one linked entity in E2.
2. A specific entity in E1 is linked to multiple entities in E2.
3. Each entity in E2 is linked to precisely one other entity in E1.
4. Each entity in E2 is connected to a maximum of one entity in E1.

Ans. (a) Every object in E1 has precisely one linked entity in E2.

Explanation:

Given, E1 and E2 are participating Totally and |E1| > |E2|. The relation R is many-to-one.

The relationship can be observed from the given diagram.

We can conclude that every object in E1 is linked to exactly one object in E2. Hence, (a) is the correct answer.

Q. 2 A and B entity types make up an ER model of a database. These are linked together by a relationship R that lacks an independent attribute. In which of the following scenarios is it possible to combine R's relational table with A's?

1. R is a one-to-many relationship, and A participates totally in R.
2. Relationship R is one-to-many, and A only partially participates in R.
3. R is a many-to-one relationship, and A has complete involvement in R.
4. R is a one-to-many relationship, and A is only partially involved in R.

Q. 3 Which of the following is INACCURATE in terms of the basic ER and relational models?

1. An entity's attribute may take on more than one value.
2. An entity's attribute may be composite.
3. An attribute may have more than one value in a row of a relational table.
4. An attribute in a row of a relational table can only have a single value or NULL.

Q. 4 Let's assume that E1 and E2 are two entities in an E/R diagram with basic single-valued properties. The relationships R1 and R2 between E1 and E2 are one-to-many and many-to-many, respectively. There are no unique properties shared by R1 and R2. How many minimum numbers of tables are needed in the relational model to represent this scenario?

1. 2
2. 3
3. 4
4. 5

Q. 5 Which of the following claims regarding weak entity sets is FALSE?

1. Weak entities may be automatically destroyed together with their strong entity.
2. By not using the strong entity's key twice, the weak entity set prevents data duplication and the potential inconsistencies that result from doing so.
3. In the absence of attributes from the strong entity set upon which it depends, a weak entity set lacks any primary keys.
4. The relationships between tuples in a weak entity set and tuples in a strong entity set are not taken into account when partitioning tuples.

Q. 6 Select the correct option.

1. Super Key ⊆ Candidate Key ⊆ Primary Key
2. Candidate Key ⊆ Super Key ⊆ Primary Key
3. Primary Key ⊆Super Key ⊆ Candidate Key
4. Primary Key ⊆ Candidate Key ⊆ Super Key

Q. 7 The purpose of relational database schema normalization is NOT for

1. lowering the number of joins needed to fulfil a query.
2. removing data recorded in the database that is redundant in an uncontrolled way.
3. eliminating a number of abnormalities that may be created by inserts and deletes.
4. assuring the enforcement of functional dependencies.

Q. 8 If a relationship exists in both 2NF and 3NF forms, then:

1. No non-prime attribute depends on any other non-prime attributes
2. There is no functional dependency from a non-prime attribute to a prime attribute.
3. Every attribute is independently functional.
4. No functional dependencies exist from a prime attribute to all non-prime attributes.

Explanation:

Partial dependencies are removed in 2NF, and transitive dependencies are removed in 3NF. Partial dependency occurs when a non-prime attribute depends on a subset of any candidate key and transitive dependency occurs when a non-prime attribute depends on another non-prime attribute. Hence, (a) is the correct answer.

Q. 9 Take into account the relationship schema below. Every non-trivial functional dependency for the schema is listed below. The underlined attribute is the primary key.

Enrollment (rollno, courseid, email)

Non-trivial functional dependencies:

rollno, courseid → email

email → rollno

Select the correct option:

1. The schema is in 1NF but not in 2NF
2. The Schema is in 2NF but not in 3NF
3. The Schema is in 3NF but not in BCNF
4. The Schema is in BCNF but not in 4NF

Q. 10 Consider a relationship R(a, b, c, d) where a, b, c, and d are simple single valued attributes. The following functional dependency exist among these attributes a → c and b → d. Identify the normal form of the relationship.

1. 1 NF
2. 2 NF
3. 3 NF
4. BCNF

Q. 11 The relationship table obtained from the ER diagram will always be in

1. 1 NF
2. 2 NF
3. 3 NF
4. BCNF

Q. 12 Data that enhances the database's usability and performance are referred to as

1. Data Dictionary
2. Indexes
3. Application Meta Data
4. User Data

Q. 13 B + Trees are regarded as BALANCED because

1. all of the pathways from the root to the leaf nodes are the same length.
2. there is a maximum one-length difference between all of the paths from the root to the leaf nodes.
3. any two non-leaf sibling nodes can have a maximum of one difference in the number of their children.
4. the difference between any two leaf nodes in terms of records is at most 1.

Q. 14 What is the main reason B+ trees are preferred over binary search trees when indexing database relations?

1. The records for database relations are numerous.
2. The primary key is used to sort database relations.
3. Binary search trees need more memory than B+ trees.
4. Block-based data transmission from drives is used.

Q. 15 Which of the subsequent statements is true?

1. B+ trees are used for main memory, while B trees are used for disc storage.
2. On B+ trees, range searches are quicker.
3. B++ trees are used for secondary indexes, while B-trees are used for primary indexes.
4. Regardless of the quantity of records, a B+ tree always has the same height.

Q. 16 Which of the following claims regarding the B+ tree data structure, which is used to build an index of a relational database table, is FALSE?

1. A pointer to the subsequent leaf node is present at each leaf node.
2. Nodes that are not leaves have pointers to data records.
3. Height-balanced trees include B+ Tree.
4. Every node maintains sorted order for its key values.

Q. 17 Which of the following situations could result in an unrecoverable error in a database system?

1. A transaction reads a data object updated by an uncommitted transaction.
2. A transaction reads a data object read by another uncommitted transaction.
3. A transaction reads a data item updated by a committed transaction
4. A transaction updates a data item read by and an uncommitted transaction

Q. 18 Take a look at the given schedules S1 and S2, along with the transactions T1, T2, and T3.

T1: r1(X); r1(Z); w1(X); w1(Z)

T2: r2(Y); r2(Z); w2(Z)

T3: r3(Y); r3(X); w3(Y)

Out of the following schedule-related claims, which one is TRUE?

1. Only S1 is conflict Serializable
2. Only S2 is Conflict Serializable
3. Both S1 and S2 are Conflict Serializable
4. Neither S1 nor S2 are conflict Serializable.

Q. 19 Which of the following is not a part of ACID properties of a transaction?

1. Atomicity
2. Consistency
3. Isolation
4. Deadlock-Prevention

Q. 20 Which of the subsequent claims is FALSE?

1. Deadlocks are a problem with 2-phase locking protocols.
2. The number of aborts is higher for Time-Stamp Protocols.
3. Cascading rollback is a problem with Time-Stamp Protocols, but it is not with 2-Phase Locking Protocol.
4. None of these