Entity-relationship Diagram! Database Trivia Quiz

Reviewed by Editorial Team

The ProProfs editorial team is comprised of experienced subject matter experts. They've collectively created over 10,000 quizzes and lessons, serving over 100 million users. Our team includes in-house content moderators and subject matter experts, as well as a global network of rigorously trained contributors. All adhere to our comprehensive editorial guidelines, ensuring the delivery of high-quality content.

Learn about Our Editorial Process

| By Sumit Srivastava

Sumit Srivastava

Community Contributor

Quizzes Created: 2 | Total Attempts: 1,399

| Attempts: 1,069

Questions

Feedback

During the Quiz End of Quiz

Difficulty

Sequential Easy First Hard First

1/56 Questions

Which of the following gives a logical structure of the database graphically?
- Entity-relationship diagram
- Entity diagram
- Both A and B are correct.
- Neither A nor B

About This Quiz

Explore the structure of databases with our Entity-Relationship Diagram! Database Trivia Quiz. Assess your understanding of logical database structuring through ER diagrams, entity sets, and relationship types. Perfect for students and professionals in database management and computer science.

Entity-relationship Diagram! Database Trivia Quiz - Quiz

Quiz Preview

2.

Every weak entity set can be converted into a strong entity set by:
- Using generalization
- Adding appropriate attributes
- Using aggregation
- None of the above
Correct Answer

A. Adding appropriate attributes

Explanation

Adding appropriate attributes to a weak entity set can convert it into a strong entity set. Weak entity sets depend on a strong entity set for their existence and cannot exist independently. By adding appropriate attributes, the weak entity set becomes capable of existing independently and no longer relies on another entity set for its existence. This strengthens the entity set and converts it into a strong entity set. Generalization and aggregation are not methods for converting weak entity sets into strong entity sets.

Rate this question:

1
3.

In a one-to-many relationship, the entity that is on the one side of the relationship is called a(n) ________ entity.
- Parent
- Child
- Subtype
- Instance
Correct Answer

A. Parent

Explanation

In a one-to-many relationship, the entity that is on the one side of the relationship is called a Parent entity. This entity is the main entity that has a relationship with multiple instances of another entity, known as the Child entity. The Parent entity acts as the "one" in the relationship, while the Child entity represents the "many" side. The Parent entity typically holds the primary key that is used to establish the relationship with the Child entities.

Rate this question:

2
4.

Weak entity relationship is represented as
- Underline
- Double line
- Double diamond
- Double rectangle
Correct Answer

A. Double diamond

Explanation

A weak entity relationship is represented by a double diamond. A weak entity is an entity that cannot exist without the existence of another entity, known as the identifying entity. The double diamond symbolizes this dependency, indicating that the weak entity relies on the identifying entity for its existence. The double diamond is used to visually represent this relationship in entity-relationship diagrams, making it easier to understand the dependencies between entities.

Rate this question:

1
5.

The ER model includes additional concepts like:
- Specialization
- Generalization
- Categorization
- All of the Above
Correct Answer

A. All of the Above

Explanation

The ER model includes additional concepts like specialization, generalization, and categorization. Specialization is the process of defining subclasses based on a superclass, allowing for more specific attributes and relationships. Generalization is the opposite process, where common attributes and relationships are identified and grouped into a superclass. Categorization is the process of organizing entities into categories or classes based on their common characteristics. Therefore, all of the given options are correct as they represent additional concepts included in the ER model.

Rate this question:
6.

E-R modelling techniques is a:
- Top-down approach
- Bottom-up approach
- Left-right approach
- None of the above
Correct Answer

A. Top-down approach

Explanation

E-R modelling techniques is a top-down approach because it starts with identifying the overall structure and then breaks it down into smaller components. In this approach, the focus is on understanding the system as a whole and then gradually refining the details. It involves identifying the entities, their relationships, and attributes, and then creating the entity-relationship diagram accordingly. This approach allows for a systematic and organized way of designing the database by starting from a high-level perspective and gradually moving towards the implementation details.

Rate this question:

1
7.

The total participation by entities is represented in the E-R diagram as
- Dashed line
- Double line
- Double rectangle
- Circle
Correct Answer

A. Double line

Explanation

In an E-R diagram, the double line represents total participation by entities. Total participation means that every entity in one entity set must participate in a relationship with an entity in another entity set. The double line indicates that the participation is mandatory and every entity must be involved in the relationship. This is in contrast to a single line, which represents partial participation, where some entities may choose not to participate in the relationship.

Rate this question:
8.

Which relationship is used to represent a specialization entity?
- ISA
- AIS
- ONIS
- WHOIS
Correct Answer

A. ISA

Explanation

The relationship used to represent a specialization entity is ISA. This relationship signifies that one entity is a specialized version of another entity. It is commonly used in database design to represent inheritance and hierarchy in entities.

Rate this question:
9.

A _____________ constraint requires that an entity belong to no more than one lower-level entity set.
- Disjointness
- Uniqueness
- Special
- Relational
Correct Answer

A. Disjointness

Explanation

A disjointness constraint requires that an entity belong to no more than one lower-level entity set. This means that an entity cannot simultaneously belong to multiple lower-level entity sets. This constraint ensures that there is no overlap or duplication of entities across different entity sets, maintaining the integrity and uniqueness of the data model.

Rate this question:
10.

The completeness constraint may be one of the following: Total generalization or specialization, Partial generalization or specialization. Which is the default?
- Total
- Partial
- Should be specified
- Cannot be determined
Correct Answer

A. Partial

Explanation

The default completeness constraint is partial. This means that if no constraint is specified, it is assumed that the generalization or specialization is only partial, meaning that not all instances of the superclass will have corresponding instances in the subclass.

Rate this question:
11.

Which normal form is considered adequate for normal relational database design?
- 2NF
- 5NF
- 4NF
- 3NF
Correct Answer

A. 3NF

Explanation

The 3NF (Third Normal Form) is considered adequate for normal relational database design. This normal form ensures that there are no transitive dependencies between non-key attributes in a relation. It helps in reducing data redundancy and improving data integrity by eliminating any fields that are not directly dependent on the primary key. By achieving 3NF, a database design can efficiently organize and store data while minimizing data redundancy and maintaining data consistency.

Rate this question:
12.

Consider a schema R(A, B, C, D) and functional dependencies A -> B and C -> D. Then the decomposition of R into R1 (A, B) and R2(C, D) is
- Dependency preserving and lossless join
- Lossless join but not dependency preserving
- Dependency preserving but not lossless join
- (d) not dependency preserving and not lossless join
Correct Answer

A. Dependency preserving but not lossless join

Explanation

The decomposition of R into R1(A, B) and R2(C, D) is dependency preserving because the functional dependencies A -> B and C -> D are preserved in the decomposed relations. However, it is not lossless join because there is no common attribute between R1 and R2 that can be used to join them back together without losing any information.

Rate this question:
13.

Relation R with an associated set of functional dependencies, F, is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is
- Zero
- More than zero but less than that of an equivalent 3NF decomposition
- Proportional to the size of F+
- Indeterminate
Correct Answer

A. More than zero but less than that of an equivalent 3NF decomposition

Explanation

The correct answer is more than zero but less than that of an equivalent 3NF decomposition. When a relation is decomposed into BCNF, it minimizes redundancy by eliminating partial dependencies. However, BCNF does not eliminate all redundancy. There may still be redundancy present due to transitive dependencies. In an equivalent 3NF decomposition, which further eliminates transitive dependencies, the redundancy would be completely eliminated. Therefore, the redundancy in the resulting set of relations from BCNF decomposition is more than zero but less than that of an equivalent 3NF decomposition.

Rate this question:
14.

A table has fields F1, F2, F3, F4, and F5, with the following functional dependencies: 1) F1->F3 2) F2->F4 3) (F1,F2)->F5 in terms of normalization, this table is in
- 1NF
- 2NF
- 3NF
- NONE OF THE ABOVE
Correct Answer

A. 1NF

Explanation

This table is in 1NF (First Normal Form) because it satisfies the criteria for 1NF. In 1NF, each attribute in a table must contain only atomic values (indivisible values). The given table has fields F1, F2, F3, F4, and F5, and there are no repeating groups or multivalued attributes. Therefore, it meets the requirements for 1NF.

Rate this question:
15.

Consider the following functional dependencies in a database. 1) Date_of_Birth->Age 2) Age->Eligibility 3)Name->Roll_number 4)Roll_number->Name 5)Course_number->Course_name 6)Course_number->Instructor 7)(Roll_number, Course_number)->Grade The relation (Roll_number, Name, Date_of_birth, Age) is
- In second normal form but not in third normal form
- In third normal form but not in BCNF
- In BCNF
- In none of the above
Correct Answer

A. In none of the above

Explanation

The given relation (Roll_number, Name, Date_of_birth, Age) is not in any of the above normal forms because it violates the third normal form and BCNF. The functional dependency Age->Eligibility violates the third normal form because Eligibility is not functionally dependent on the key of the relation. Additionally, the functional dependency Roll_number->Name violates BCNF because it is a partial dependency, where the determinant (Roll_number) does not determine all the attributes in the relation. Therefore, the relation is not in any of the mentioned normal forms.

Rate this question:
16.

The relation schema Student_Performance (name, courseNo, rollNo, grade) has the following FDs: 1) name,courseNo->grade 2) rollNo,courseNo->grade 3)name->rollNo 4) rollNo->name The highest normal form of this relation scheme is
- 2NF
- BCNF
- 3NF
- 4NF
Correct Answer

A. 3NF

Explanation

The highest normal form of this relation schema is 3NF. This is because all the functional dependencies in the schema are either full key dependencies or transitive dependencies. In 3NF, there should be no transitive dependencies, meaning that no non-key attribute should be functionally dependent on another non-key attribute. In this schema, all the functional dependencies are either between the key attributes (name, courseNo, and rollNo) and the non-key attribute (grade), or between the non-key attributes (name and rollNo). Therefore, the schema satisfies the requirements of 3NF.

Rate this question:
17.

The relation EMPDT1 is defined with attributes empcode(unique), name, street, city, state, and pincode. For any pincode,there is only one city and state. Also, for any given street, city and state, there is just one pincode. In normalization terms EMPDT1 is a relation in
- 1NF only
- 3NF and hence also in 2NF and 1NF
- BCNF and hence also in 3NF, 2NF and 1NF
- 2NF and hence also in 1NF
Correct Answer

A. 2NF and hence also in 1NF

Explanation

The given relation EMPDT1 satisfies the conditions of 2NF and 1NF. In 2NF, there should be no partial dependencies, meaning that no non-key attribute depends on only a part of the primary key. Since for any given street, city, and state, there is just one pincode, there is no partial dependency. In 1NF, each attribute should be atomic and single-valued, which is satisfied by the given relation. Therefore, the relation EMPDT1 is in 2NF and hence also in 1NF.

Rate this question:
18.

Which one of the following statements if FALSE?
- A prime attribute can be transitively dependent on a key in a BCNF relation.
- Any relation with two attributes is in BCNF
- A relation in which every key has only one attribute is in 2NF
- A prime attribute can be transitively dependent on a key in a 3 NF relation.
Correct Answer

A. A prime attribute can be transitively dependent on a key in a BCNF relation.

Explanation

In a BCNF (Boyce-Codd Normal Form) relation, a prime attribute cannot be transitively dependent on a key. BCNF requires that every non-trivial functional dependency in the relation must be determined by a superkey. Therefore, a prime attribute cannot be transitively dependent on a key in a BCNF relation.

Rate this question:
19.

Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection (Title, Author, Catalog_no) With the following functional dependencies: I. Title Author -> Catalog_no II. Catalog_no -> Title Author Publisher Year III. Publisher Title Year -> Price Assume {Author, Title} is the key for both schemes. Which of the following statements is true?
- Both Book and Collection are in 3NF only
- Book is in 2NF and Collection is in 3NF
- Both Book and Collection are in BCNF
- Both Book and Collection are in 2NF only
Correct Answer

A. Book is in 2NF and Collection is in 3NF

Explanation

The given answer is correct because in the Book scheme, the functional dependency I violates the 2NF as it is a partial dependency. By decomposing the scheme, we can remove this partial dependency and achieve 2NF. In the Collection scheme, there are no partial dependencies or transitive dependencies, so it is already in 3NF. Therefore, the statement "Book is in 2NF and Collection is in 3NF" is true.

Rate this question:
20.

Let R(A,B,C,D,E,P,G) be a relational schema in which the following FDs are known to hold: 1) AB->CD 2) DE->P 3) C->E 4) P->C 5) B->G The relation schema R is
- Not in 2NF
- In 3NF, but not in BCNF
- In 2NF, but not in 3NF
- In BCNF
Correct Answer

A. Not in 2NF

Explanation

The given relational schema is not in 2NF because it violates the second normal form (2NF) rule which states that no non-prime attribute should be functionally dependent on a proper subset of any candidate key. In this case, attribute E is functionally dependent on C, which is a proper subset of the candidate key AB. Therefore, the relational schema is not in 2NF.

Rate this question:
21.

Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F={CH→G, A→BC, B→CFH, E→A, F→EG} is a set of functional dependencies (FDs) so that F + is exactly the set of FDs that hold for R. How many candidate keys does the relation R have?
- 3
- 5
- 4
- 6
Correct Answer

A. 4

Explanation

The relation R has four candidate keys. A candidate key is a minimal set of attributes that can uniquely identify every tuple in a relation. To determine the candidate keys, we can use the closure of each attribute set in R. Starting with each individual attribute, we find the closure by applying the functional dependencies in F. The closure of each attribute set is as follows: A+ = ABCFHG, B+ = BCFHGA, C+ = CFHGA, D+ = D, E+ = AEBCFHG, F+ = FEG, G+ = G, H+ = H. From these closures, we can see that the candidate keys are AD, AE, AF, and AG, as they are the minimal sets of attributes that can determine all other attributes in R. Therefore, the answer is 4.

Rate this question:
22.

Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F={CH→G, A→BC, B→CFH, E→A, F→EG} is a set of functional dependencies (FDs) so that F + is exactly the set of FDs that hold for R. The relation R is
- In 2NF, but not in 3NF.
- In 3NF, but not in BCNF.
- In 1NF, but not in 2NF.
- In BCNF.
Correct Answer

A. In 1NF, but not in 2NF.

Explanation

The given set of functional dependencies (FDs) F={CH→G, A→BC, B→CFH, E→A, F→EG} indicates that there are partial dependencies present in the relation R. This means that there are attributes that are functionally dependent on only a part of the candidate key. Therefore, the relation R is in 1NF, but not in 2NF. In 2NF, all non-key attributes should be fully dependent on the entire candidate key. However, the given FDs show that attribute C is dependent on only a part of the candidate key (A), violating the 2NF criteria.

Rate this question:
23.

Every time attribute A appears, it is matched with the same value of attribute B, but not the same value of attribute C. Therefore, it is true that:
- A → B.
- A → C.
- A → (B,C).
- (B,C) → A.
Correct Answer

A. A → B.

Explanation

The given information states that every time attribute A appears, it is matched with the same value of attribute B, but not the same value of attribute C. This implies that there is a direct relationship between A and B, where A determines the value of B. However, there is no information provided about the relationship between A and C or between B and C. Therefore, the only valid conclusion that can be drawn is that A determines the value of B, making the statement A → B true.

Rate this question:
24.

A functional dependency is a relationship between or among:
- Tables
- Rows
- Relations
- Attributes
Correct Answer

A. Attributes

Explanation

A functional dependency is a relationship between attributes in a database. It states that the value of one or more attributes determines the value of another attribute. In other words, if we know the value of certain attributes, we can determine the value of other attributes based on this relationship. Therefore, the correct answer is "Attributes" because functional dependencies are defined between attributes, not tables, rows, or relations.

Rate this question:
25.

If every functional dependency in set E is also in closure of F then this is classified as
- FD is covered by E
- E is covered by F
- F is covered by E
- F+ is covered by E
Correct Answer

A. E is covered by F

Explanation

If every functional dependency in set E is also in the closure of F, it means that the closure of F contains all the functional dependencies in E. This implies that F is able to derive all the functional dependencies in E. Therefore, E is covered by F.

Rate this question:
26.

Inst_dept (ID, name, salary, dept name, building, budget) is decomposed into instructor (ID, name, dept name, salary) department (dept name, building, budget) This comes under
- Lossy-join decomposition
- Lossy decomposition
- Lossless-join decomposition
- Both a and b
Correct Answer

A. Both a and b

Explanation

This decomposition can be considered both a lossy-join decomposition and a lossless-join decomposition. It is lossy because the original relation Inst_dept cannot be recreated from the decomposed relations instructor and department. Information about the instructor's salary is lost in the decomposition. However, it is also lossless because the join of the decomposed relations instructor and department can be used to recreate the original relation Inst_dept. Therefore, the correct answer is both a and b.

Rate this question:
27.

Consider a relation R(A,B,C,D,E) with the following functional dependencies: ABC -> DE and D -> AB The number of superkeys of R is:
- 2
- 7
- 10
- 15
Correct Answer

A. 10

Explanation

The given relation R has two functional dependencies: ABC -> DE and D -> AB. To find the number of superkeys, we need to consider all possible combinations of attributes that can uniquely determine all other attributes.

From the given functional dependencies, we can see that ABCD is a superkey since it can determine all attributes. Additionally, D is also a superkey as it can determine AB, and ABC is also a superkey as it can determine DE.

Other possible superkeys can be formed by combining attributes from ABCD with attributes from DE. For example, ABCDE is a superkey since it can determine all attributes. Similarly, ABCE, ACDE, BCDE, ABD, ACD, BCD, and ACE are also superkeys.

Therefore, the number of superkeys for relation R is 10.

Rate this question:
28.

In a two-phase locking protocol, a transaction release locks in ......... phase.
- Shrinking phase
- Growing phase
- Running phase
- Initial phase
Correct Answer

A. Shrinking phase

Explanation

In a two-phase locking protocol, the transaction releases locks in the shrinking phase. This phase occurs after the transaction has completed its operations and is ready to release the locks it acquired during the growing phase. During the shrinking phase, the transaction releases the locks in a systematic manner, ensuring that other transactions can access the locked resources. This helps in maintaining data consistency and preventing conflicts between concurrent transactions.

Rate this question:
29.

............ protocol grantees that a set of transactions becomes serializable.
- Two phase locking
- Two phase commit
- Transaction locking
- Checkpoints
Correct Answer

A. Two phase locking

Explanation

Two phase locking is a protocol that ensures serializability of transactions. It consists of two phases: the growing phase and the shrinking phase. In the growing phase, transactions acquire locks on the resources they need before accessing them. This ensures that no other transaction can access the same resource simultaneously. In the shrinking phase, transactions release the locks they acquired, allowing other transactions to access the resources. By following this protocol, the transactions are executed in a serial order, preventing conflicts and ensuring serializability.

Rate this question:
30.

The situation in which a transaction holds a data item and waits for the release of data item held by some other transaction, which in turn waits for another transaction, is called .......
- Serialiable schedule
- Process waiting
- Concurrency
- Deadlock
Correct Answer

A. Deadlock

Explanation

Deadlock refers to a situation where multiple transactions are waiting indefinitely for each other to release the resources they hold. In this scenario, a transaction holds a data item and is waiting for the release of the data item held by another transaction. However, that transaction is also waiting for yet another transaction, creating a cycle of dependencies and preventing any progress. This deadlock situation can cause a system to become unresponsive and requires intervention to resolve.

Rate this question:
31.

The database system must take special actions to ensure that transactions operate properly without interference from concurrently executing database statements. This property is referred to as
- Atomicity
- Durability
- Isolation
- Consistency
Correct Answer

A. Isolation

Explanation

The given correct answer is "Isolation." Isolation refers to the property of a database system that ensures that transactions are executed in a way that they are not affected by other concurrently executing transactions. It ensures that each transaction is executed independently and in isolation from other transactions, preventing interference and maintaining data integrity. Isolation is important to prevent issues like dirty reads, non-repeatable reads, and phantom reads, which can occur when multiple transactions access and modify the same data simultaneously.

Rate this question:
32.

Which of the following is a procedure for acquiring the necessary locks for a transaction where all necessary locks are acquired before any are released?
- Record controller
- Exclusive lock
- Authorization rule
- Two phase lock
Correct Answer

A. Two phase lock

Explanation

The Two Phase Lock (2PL) protocol is a procedure for acquiring locks in a transaction where all necessary locks are acquired before any are released. In the 2PL protocol, a transaction is divided into two phases: the growing phase and the shrinking phase. In the growing phase, the transaction acquires all the necessary locks before it starts accessing and modifying the data. Once the transaction has acquired all the necessary locks, it enters the shrinking phase where it starts releasing the locks only after it has completed all its data access and modification operations. This ensures that no conflicts occur between transactions and maintains data integrity.

Rate this question:
33.

When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a timestamp smaller than that of Tj (that is, Ti is older than Tj ). Otherwise, Ti is rolled back (dies). This is
- Wait-die
- Wait-wound
- Wound-wait
- Wait
Correct Answer

A. Wait-die

Explanation

The given scenario describes the "Wait-die" strategy for handling conflicting transactions. In this strategy, if a transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a smaller timestamp (i.e., it is older) than Tj. If Ti has a larger timestamp (i.e., it is younger) than Tj, Ti is rolled back (dies). This strategy ensures that older transactions are given priority and prevents deadlock situations.

Rate this question:
34.

Immediate database modification technique uses
- Both undo and redo
- Undo but no redo
- Redo but no undo
- Neither undo nor redo
Correct Answer

A. Both undo and redo

Explanation

Immediate database modification technique uses both undo and redo. Undo is used to rollback or undo the changes made to the database in case of a failure or error. Redo is used to reapply the changes made to the database after a failure or error has been corrected. By using both undo and redo, the database can maintain consistency and integrity even in the event of failures or errors.

Rate this question:
35.

Consider the following transactions with data items P and Q initialized to zero: T1: read (P) ; read (Q) ; if P = 0 then Q : = Q + 1 ; write (Q) ; T2: read (Q) ; read (P) ; if Q = 0 then P : = P + 1 ; write (P) ; Any non-serial interleaving of T1 and T2 for concurrent execution leads to..
- A Serializable Schedule
- A Schedule that is not conflict Serializable
- A Conflict Serializable Schedule
- A Schedule for which a precedence graph cannot be drawn
Correct Answer

A. A Schedule that is not conflict Serializable

Explanation

A non-serial interleaving of T1 and T2 for concurrent execution leads to a schedule that is not conflict serializable. Conflict serializability is a property of a schedule where the order of conflicting operations (operations that access the same data item) is preserved. In this case, both T1 and T2 read and write the same data items P and Q, and their operations conflict with each other. If the schedule is not conflict serializable, it means that the order of conflicting operations is not preserved, leading to potential data inconsistencies.

Rate this question:
36.

Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below. T1: r1(X); r1(Z); w1(X); w1(Z) T2: r2(Y); r2(Z); w2(Z) T3: r3(Y); r3(X); w3(Y) S1: r1(X); r3(Y); r3(X); r2(Y); r2(Z); w3(Y); w2(Z); r1(Z); w1(X); w1(Z) S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z); r2(Z); w3(Y); w1(X); w2(Z); w1(Z) Which one of the following statements about the schedules is TRUE?
- Only S1 is conflict Serializable
- Only S2 is conflict Serializable
- Both S1 and S2 is conflict Serializable
- Neither S1 nor S2 is conflict Serializable
Correct Answer

A. Only S1 is conflict Serializable

Explanation

The schedule S1 is conflict serializable because it can be transformed into an equivalent serial schedule by swapping non-conflicting operations. On the other hand, the schedule S2 is not conflict serializable because there is a conflict between the operations r1(Z) and w2(Z), which cannot be resolved by swapping operations. Therefore, the statement "Only S1 is conflict Serializable" is true.

Rate this question:
37.

Consider the following transaction involving two bank accounts x and y. read(x); x := x – 50; write(x); read(y); y := y +50; write(y) The constraint that the sum of the accounts x and y should remain constant is that of
- Atomicity
- Consistency
- Durability
- Isolation
Correct Answer

A. Consistency

Explanation

The constraint that the sum of the accounts x and y should remain constant is that of consistency. Consistency ensures that the data in the database remains in a valid state before and after the transaction. In this case, the transaction involves deducting 50 from account x and adding 50 to account y. To maintain consistency, the sum of the balances in both accounts should remain the same before and after the transaction.

Rate this question:
38.

Which level of RAID refers to disk mirroring with block striping?
- RAID level 1
- RAID level 2
- RAID level 3
- RAID level 4
Correct Answer

A. RAID level 1

Explanation

RAID level 1 refers to disk mirroring with block striping. In this level of RAID, data is mirrored onto two or more disks simultaneously, providing redundancy and fault tolerance. Each disk in the array contains an exact copy of the data, allowing for data recovery in case of disk failure. Block striping is also used, which means that data is divided into blocks and distributed across the disks in the array. This combination of mirroring and striping provides both data protection and improved performance.

Rate this question:
39.

A unit of storage that can store one or more records in a hash file organization is denoted as
- Buckets
- Disk Pages
- Blocks
- Nodes
Correct Answer

A. Buckets

Explanation

A unit of storage that can store one or more records in a hash file organization is denoted as "Buckets". In a hash file organization, data is stored in buckets, which are essentially containers that hold multiple records. Each bucket is identified by a unique hash value, allowing for efficient retrieval and storage of records based on their key values. Buckets are commonly used in hash table data structures to store and retrieve data quickly using a hashing algorithm.

Rate this question:
40.

The file organization which allows us to read records that would satisfy the join condition by using one block read is
- Heap file organization
- Sequential file organization
- Clustering file organization
- Hash file organization
Correct Answer

A. Clustering file organization

Explanation

Clustering file organization allows us to read records that would satisfy the join condition by using one block read. In this type of file organization, related records are physically stored together in the same block or nearby blocks on the disk. This reduces the number of disk accesses required to retrieve the records needed for a join operation, resulting in improved performance.

Rate this question:
41.

The highest level in the hierarchy of data organization is called
- Databank
- Database
- Datafile
- Datarecord
Correct Answer

A. Database

Explanation

The highest level in the hierarchy of data organization is called a database. A database is a collection of related data that is organized and stored in a structured manner. It allows for efficient storage, retrieval, and manipulation of data. At the highest level, a database contains multiple tables or files, which in turn contain records and fields. It provides a centralized and integrated approach to managing data, ensuring data consistency and security.

Rate this question:

1
42.

Which of the following hardware component is the most important to the operation of database management system?
- High Resolution Video Display
- Printer
- High Speed Large Capacity Disk
- Mouse
Correct Answer

A. High Speed Large Capacity Disk

Explanation

The most important hardware component for the operation of a database management system is a high speed large capacity disk. This is because a database management system requires a large amount of storage space to store and retrieve data efficiently. A high speed disk ensures fast access and retrieval of data, while a large capacity disk allows for the storage of a large amount of data. Without a high speed large capacity disk, the performance of the database management system would be significantly hindered.

Rate this question:
43.

What operator tests column for the absence of data?
- EXISTS operator
- NOT operator
- IS NULL operator
- None of these
Correct Answer

A. IS NULL operator

Explanation

The IS NULL operator tests a column for the absence of data. It is used to check if a column contains a NULL value, which represents the absence of data. Therefore, the IS NULL operator is the correct answer for this question.

Rate this question:
44.

In SQL, which command(s) is(are) used to change a table's storage characteristics?
- ALTER TABLE
- MODIFY TABLE
- CHANGE TABLE
- All of the above
Correct Answer

A. ALTER TABLE

Explanation

The ALTER TABLE command is used in SQL to change a table's storage characteristics. This command allows modifications to be made to an existing table, such as adding or dropping columns, changing data types, or altering constraints. The MODIFY TABLE and CHANGE TABLE options are not valid SQL commands for changing a table's storage characteristics. Therefore, the correct answer is ALTER TABLE.

Rate this question:
45.

Which of the following statement on the view concept in SQL is invalid ?
- All views are not updatable
- The views may be referenced in an SQL statement whenever tables are referenced
- The views are instantiated at the time they are referenced and not when they are defined
- The definition of a view should not have GROUP BY clause in it
Correct Answer

A. The definition of a view should not have GROUP BY clause in it

Explanation

The given correct answer is "the definition of a view should not have GROUP BY clause in it". This statement is invalid because a view can have a GROUP BY clause in its definition. The GROUP BY clause is used to group rows based on a specific column or columns in the view's underlying query. It is often used in conjunction with aggregate functions to perform calculations on grouped data. Therefore, the statement is incorrect.

Rate this question:
46.

Find the temperature in increasing order of all cities
- SELECT city FROM weather ORDER BY temperature;
- SELECT city, temperature FROM weather;
- SELECT city, temperature FROM weather ORDER BY temperature;
- SELECT city, temperature FROM weather ORDER BY city;
Correct Answer

A. SELECT city, temperature FROM weather ORDER BY temperature;

Explanation

This answer is correct because it selects both the city and temperature columns from the weather table and orders the results in increasing order based on the temperature column. This will give a list of cities sorted by their temperature values from lowest to highest.

Rate this question:
47.

Find the names of these cities with temperature and condition whose condition is neither sunny nor cloudy
- SELECT city, temperature, condition FROM weather WHERE condition NOT IN ('sunny', 'cloudy');
- SELECT city, temperature, condition FROM weather WHERE condition NOT BETWEEN ('sunny', 'cloudy');
- SELECT city, temperature, condition FROM weather WHERE condition IN ('sunny', 'cloudy');
- SELECT city, temperature, condition FROM weather WHERE condition BETWEEN ('sunny', 'cloudy');
Correct Answer

A. SELECT city, temperature, condition FROM weather WHERE condition NOT IN ('sunny', 'cloudy');

Explanation

The correct answer is the first option: SELECT city, temperature, condition FROM weather WHERE condition NOT IN ('sunny', 'cloudy'). This query retrieves the names of cities along with their temperature and condition from the weather table. The condition is filtered to exclude both 'sunny' and 'cloudy', meaning that only cities with conditions other than sunny or cloudy will be included in the result.

Rate this question:
48.

Which of the following is not true of the traditional approach to information processing
- There is common sharing of data among the various applications
- It is file oriented
- Programs are dependent on the file
- It is inflexible
Correct Answer

A. There is common sharing of data among the various applications

Explanation

The traditional approach to information processing does not involve common sharing of data among various applications. In this approach, each application has its own separate data files and does not share data with other applications. This lack of data sharing can lead to data redundancy and inconsistency.

Rate this question:
49.

The information about data in a database is called _______.
- Metadata
- Hyperdata
- Teradata
- None of these
Correct Answer

A. Metadata

Explanation

Metadata refers to the information about data in a database. It includes details such as the structure, format, and organization of the data, as well as information about its source, meaning, and usage. Metadata provides context and helps in understanding and managing the data effectively. It is used for data integration, data governance, data quality, and other data management processes. Hyperdata and Teradata are not valid terms related to the information about data in a database. Therefore, the correct answer is Metadata.

Rate this question:

Quiz Review Timeline (Updated): Mar 22, 2023 +

Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.

Current Version
Mar 22, 2023

Quiz Edited by
ProProfs Editorial Team
Apr 27, 2017

Quiz Created by
Sumit Srivastava

Entity-relationship Diagram! Database Trivia Quiz

Which of the following gives a logical structure of the database graphically?

Quiz Preview

Every weak entity set can be converted into a strong entity set by:

In a one-to-many relationship, the entity that is on the one side of the relationship is called a(n) ________ entity.

Weak entity relationship is represented as

The ER model includes additional concepts like:

E-R modelling techniques is a:

The total participation by entities is represented in the E-R diagram as

Which relationship is used to represent a specialization entity?

A _____________ constraint requires that an entity belong to no more than one lower-level entity set.

The completeness constraint may be one of the following: Total generalization or specialization, Partial generalization or specialization. Which is the default?

Which normal form is considered adequate for normal relational database design?

Consider a schema R(A, B, C, D) and functional dependencies A -> B and C -> D. Then the decomposition of R into R1 (A, B) and R2(C, D) is

Relation R with an associated set of functional dependencies, F, is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is

A table has fields F1, F2, F3, F4, and F5, with the following functional dependencies: 1) F1->F3 2) F2->F4 3) (F1,F2)->F5 in terms of normalization, this table is in

Consider the following functional dependencies in a database. 1) Date_of_Birth->Age 2) Age->Eligibility 3)Name->Roll_number 4)Roll_number->Name 5)Course_number->Course_name 6)Course_number->Instructor 7)(Roll_number, Course_number)->Grade The relation (Roll_number, Name, Date_of_birth, Age) is

The relation schema Student_Performance (name, courseNo, rollNo, grade) has the following FDs: 1) name,courseNo->grade 2) rollNo,courseNo->grade 3)name->rollNo 4) rollNo->name The highest normal form of this relation scheme is

The relation EMPDT1 is defined with attributes empcode(unique), name, street, city, state, and pincode. For any pincode,there is only one city and state. Also, for any given street, city and state, there is just one pincode. In normalization terms EMPDT1 is a relation in

Which one of the following statements if FALSE?

Let R(A,B,C,D,E,P,G) be a relational schema in which the following FDs are known to hold: 1) AB->CD 2) DE->P 3) C->E 4) P->C 5) B->G The relation schema R is

Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F={CH→G, A→BC, B→CFH, E→A, F→EG} is a set of functional dependencies (FDs) so that F + is exactly the set of FDs that hold for R. How many candidate keys does the relation R have?

Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F={CH→G, A→BC, B→CFH, E→A, F→EG} is a set of functional dependencies (FDs) so that F + is exactly the set of FDs that hold for R. The relation R is

Every time attribute A appears, it is matched with the same value of attribute B, but not the same value of attribute C. Therefore, it is true that:

A functional dependency is a relationship between or among:

If every functional dependency in set E is also in closure of F then this is classified as

Inst_dept (ID, name, salary, dept name, building, budget) is decomposed into instructor (ID, name, dept name, salary) department (dept name, building, budget) This comes under

Consider a relation R(A,B,C,D,E) with the following functional dependencies: ABC -> DE and D -> AB The number of superkeys of R is:

In a two-phase locking protocol, a transaction release locks in ......... phase.

............ protocol grantees that a set of transactions becomes serializable.

The situation in which a transaction holds a data item and waits for the release of data item held by some other transaction, which in turn waits for another transaction, is called .......

The database system must take special actions to ensure that transactions operate properly without interference from concurrently executing database statements. This property is referred to as

Which of the following is a procedure for acquiring the necessary locks for a transaction where all necessary locks are acquired before any are released?

When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a timestamp smaller than that of Tj (that is, Ti is older than Tj ). Otherwise, Ti is rolled back (dies). This is

Immediate database modification technique uses

Consider the following transactions with data items P and Q initialized to zero: T1: read (P) ; read (Q) ; if P = 0 then Q : = Q + 1 ; write (Q) ; T2: read (Q) ; read (P) ; if Q = 0 then P : = P + 1 ; write (P) ; Any non-serial interleaving of T1 and T2 for concurrent execution leads to..

Consider the following transaction involving two bank accounts x and y. read(x); x := x – 50; write(x); read(y); y := y +50; write(y) The constraint that the sum of the accounts x and y should remain constant is that of

Which level of RAID refers to disk mirroring with block striping?

A unit of storage that can store one or more records in a hash file organization is denoted as

The file organization which allows us to read records that would satisfy the join condition by using one block read is

The highest level in the hierarchy of data organization is called

Which of the following hardware component is the most important to the operation of database management system?

What operator tests column for the absence of data?

In SQL, which command(s) is(are) used to change a table's storage characteristics?

Which of the following statement on the view concept in SQL is invalid ?

Find the temperature in increasing order of all cities

Find the names of these cities with temperature and condition whose condition is neither sunny nor cloudy

Which of the following is not true of the traditional approach to information processing

The information about data in a database is called _______.