DBMS Basics - Quiz 5

DBMS Basics - Quiz 5

[Answers are given in Green color]

1. A relational database is said to be a group of ____.

a. common fields                                c. records

b. field values                                    d. tables

2. One of the advantages of a relational database model is ____.

a. structural dependence                     c. easier database design

b. conceptual complexity                    d. complex database design

3. Using network terminology, a relationship is called a(n) ____.

a. member                                 c. set

b. owner                                    d. table

4. The hierarchical database model is based on a ____.

a. tree structure                               c. lack of a child segment

b. lack of a parent segment                 d. Matrix

5. The hierarchical database model depicts a set of ____ relationships.

a. M:1                                               c. 1:M

b. 1:1                                                d. M:N

6. The hierarchical database is not very efficient when handling ____.

a. large amounts of data                     c. many transactions

b. few transactions                           d. 1:M relationships

7. The hierarchical database models ____.

a. have no implementation limitations          c. have very strict standards

b. promote database integrity                   d. have a simple navigational system

8. A relational database model ____.

a. does not require substantial hardware and system software overhead

b. does not promote "islands of information" problems

c. allows trained people to use a good system poorly

d. lets the user operate in a human logical environment

9. The network database models have a ____.

a. navigational system that yields simple design

b. simple system that promotes efficiency

c. relationship of owner/member that promotes database integrity

d. great deal of structural independence

10. Database models have been developed for ____.

a. modeling  real-world events or conditions     

b. depositing data within a single file

c. keeping data within multiple data repositories  

d. allowing DBMSs to maintain lose control over the database activities.

11. The RDBMS ____.

a. performs functions provided by the hierarchical and network DBMS system

b. does not manage data structures

c. allows the user/designer to ignore the logical view of the database

d. does not manage the details of physical storage

12. System’s complexity is hidden from the user and designer in RDBMS. This leads to ____.

a. it does not exhibit data independence

b. it does not exhibit structural independence

c. easier data management

d. data management is very difficult

13. Database models can be grouped into two categories:  conceptual models and ____ models.

a. implementation                             c. physical

b. logical                                   d. query

14. Every row/record in the relational table is called as an entity ____.

a. instance                                        c. attribute

b. relationship                                    d. model

15. Degree of ______ is a way to classify data models.

a. difficulty                                        c. abstraction

b. knowledge                                     d. unification

DBMS Basics Quiz

Database System Architectures - Quiz

1. What do you mean by Cardinality in Relational database?

Number of Tables
Number of Tuples (Records)
Number of Attributes
Number of Integrity Constraints

2. The view of a complete database is

Conceptual View
Physical View
Internal View
External View

3. In relational algebra, Cartesian product is ________________ operator.

an Unary operator
a Binary operator
a Ternary operator
All of the above

4. In Relational database, a relation is called as

Tables
Tuples
Attributes
None of the above

5. A database schema can be designed using which of the following languages?

DML
DDL
TCL
RDL

6. External level of the database system architecture is termed as

Logical Level
View Level
Conceptual Level

7. An entity set that does not have sufficient attributes to form a Primary key is _________

Simple entity set
Strong entity set
Weak entity set
Not an entity set

8. The DBMS language component which can be embedded in an application program is

DDL
DML
TCL
RDL

9. Which of the following is used in SQL to redefine/modify the definition of a table which already exists?

UPDATE
SET
ALTER

10. Relational Algebra is a ________________ language.

Data Definition Language
Procedural Language
Non-Procedural Language
Data Manipulation Language

Score =

Correct answers:

Database System Architecures and Distributed Database - Quiz 2

Distributed Database and Database System Architectures - Quiz

1. Which of the following is more suitable for parallelizing a single query?

Coarse-granularity parallelism
Fine-granularity parallelism
Both
None of them

2. A regular desktop machine (with two to four processors) can be mentioned as ________________ machine.

Fine-grain parallel
Coarse-grain parallel
Massively parallel
None of the above

3. If we parallelize the execution of large number of small transactions in a database system, then which of the following would be increased?

Response time
Rotational latency
Throughput
All of the above

4. If the speed of a parallel system is N when the larger system has N times the resources of the smaller system, then the speedup is __________

Linear Speedup
Sublinear Speedup
Superlinear Speedup
None of the above

5. Which of the following can affect the speedup and scaleup of a database system?

Startup costs
Interference
Skew
All of the above

6. Which of the following situation would cause a skew?

Huge amount of records in a table
Even distribution of records in multiple sites
Both
None

7. In which of the following architectures memory bus is not a bottleneck?

Shared memory and shared disk
Shared disk and shared nothing
Shared memory and shared nothing
All of the above

8. Which of the following would improve the availability of resources especially for reading in a distributed database system?

Fragmentation of database
Replication of database
Defragmentation of database
Tuning of database

9. ______________ is very much required to process a query in a distributed database.

Global System Catalog
Database Views
Triggers
None of the above

10. Reliability and availablity of a Centralized Data Allocation method is ___________ when compared to a Completely Replicated Data Allocation .

Highest
Average
Lowest
Not applicable

Score =

Correct answers:

Go to Distributed database home

Distributed Database - Quiz 1

1. Let us suppose that in a distributed database, during a transaction T1, one of the sites, say S1, is failed. When recovers, the site S1 has to check its log file (log based recovery) to decide the next move on the transaction T1. If the log contains a record, what the site S1 has to do?

Need not do anything
Perform Undo
Perform Redo
Abort the transaction

2. Global Wait-for graph is used for ________________ in Distributed database.

Handling concurrency control
Handling failures
Handling deadlock
None of the above

3. In Distributed database, ______________ are the transactions for which a log is found in the log file, but neither a log nor an log is found.

In-doubt transactions
Serialized transactions
Cascadeless transactions
Distributed transactions

4. While using commit protocols for handling atomicity issues, the distributed database system may enter into a situation called Blocking problem. Which of the following commit protocols can avoid Blocking problem?

Two-phase commit protocol
Three-phase commit protocol
Both of the above
None of the above

5. Which of the following concurrency control protocol is suitable for an application where frequency of read operation is much greater than that of write operation?

Majority protocol
Quorum-consensus protocol
Biased protocol
Single lock protocol

6. Which of the following parallel database architectures is/are mainly used by distributed database system?

Shared Memory
Shared Disk
Shared Nothing
Hierarchical

7. Which of the following is not a promise of distributed database?

Network Transparency
Replication Transaparency
Fragmentation Transparency
None of the above

8. All sites in a distributed database must commit at exactly the same instant. TRUE/FALSE

TRUE
FALSE

9. The real use of the Two-phase commit protocol is ______________

Deadlock will not occur
Concurrency control can be avoided
Atomicity, i.e, all-or-nothing commits at all sites
None of the above

10. Read one, write all available protocol is used to increase ___________ in a distributed database system.

Availability
Robustness
Both Availability and Robustness
Neither Availability nor Robustness

Score =

Correct answers:

Database Normal Forms - Quiz 1

Normalization and Normal Forms in Database Design - Quiz 1

1. For a relation R, we are given that the domains of all attributes of R are indivisible. With this information, we can say the relation R is in

1 NF
2 NF
3 NF
BCNF

2. In a table with the schema STU(STUNO, STUNAME, ADDRESS, COURSENO, COURSENAME) and with the functional dependencies, STUNO --> STUNAME ADDRESS, COURSENO --> COURSENAME, STUNO COURSENO --> STUNAME ADDRESS COURSENAME, which of the following anomalies would present?

Insetion Anomaly
Deletion Anomaly
Update Anomaly
All of the above

3. A relation which has only atomic attributes and every non-key attribute fully functionally dependent on candidate keys is said to be in

1 NF
2 NF
3 NF
BCNF

4. Consider the schema given in question 2. Is the relation STU in 2 NF?

YES
NO

5. What does Atomic attribute mean?

It is one type of attribute used in DBMS
An attribute whose values can be divided into meaningful subparts
An attribute whose values cannot be divided into meaningful subparts
None of the above

6. If you have removed repeated groups of values from a relation and also removed the partial key dependencies, then we would say that the given relation is in

1 NF
2 NF
3 NF
BCNF

7. Assume a table with the schema STU(STUNO, STUNAME, ADDRESS, PINCODE) and with the functional dependencies, STUNO --> STUNAME ADDRESS PINCODE, PINCODE --> ADDRESS. Is this relation is in 2 NF?

YES
NO

8. A relation is said to be in 3 NF if which of the following is/are true?

No partial key dependencies
All attributes are atomic
No presence of transitive dependencies
All of the above

9. Assume a table with the schema STU(STUNO, STUNAME, ADDRESS, PINCODE) and with the functional dependencies, STUNO --> STUNAME ADDRESS PINCODE, PINCODE --> ADDRESS. Is this relation is in 3 NF?

YES
NO

10. Assume a table with the schema STU(STUNO, STUNAME, ADDRESS, COURSENO, COURSENAME) and with the functional dependencies, STUNO --> STUNAME ADDRESS, COURSENO --> COURSENAME, STUNO COURSENO --> STUNAME ADDRESS COURSENAME with no transitive dependency. The relation STU is in _______ NF?

1 NF
2 NF
3 NF
BCNF

Score =

Correct answers:

* You can also try other DBMS quizzes here

Functional Dependency - Quiz 3

Relational Database Design - Functional Dependency Quiz 2

1. Which of the following of a relation schema R, fully functionally determines all attributes of R?

Primary Key
Candidate Key
Both Primary and Candidate Key
Neither Primary Key nor Candidate Key

2. Any attribute that is proper subset of a primary key of a relation schema is called as

Descriptor attribute
Composite attribute
Prime attribute
Atomic attribute

3. Two sets of Functional Dependencies F and G are considered equal if F+ = G+.

TRUE
FALSE

4. The words Canonical cover and Minimal cover meant the same.

TRUE
FALSE

5. An attribute of relation schema R, that is not a part of Primary key is always considered as Non-Prime attribute

TRUE
FALSE

6. Assume the candidate keys for a relation schema R(A,B,C,D,E) as {A,B}, {A,C}, {C,D}, and {A,B} is chosen as the Primary key for R. Which of the following is true?

A is non-key attribute
C is non-prime attribute
E is key attribute
None of the above

7. If DNo --> {DName, DLoc}, which of the following Armstrong's axioms allow the functional dependency DNo --> DName?

Reflexivity rule
Augmentation rule
Decomposition rule
Union rule

8. Assume that a bank relates every customer with the home branch in which the customer maintains an account. Which of the following is true?

Branch --> Branch
Customer --> Branch
Customer --> Customer
All of the above

9. A functional dependency AB --> C is said to be minimal if

either A --> C or B --> C holds
neither A --> C nor B --> C holds
both A --> C and B --> C holds
None of the above holds

10. In a relational schema R(A, B, C) with functional dependencies A --> B, B --> C, and A --> C, which of the functional dependencies is redundant?

A --> C
A --> B
B --> C
None of the above

Score =

Correct answers:

Functional Dependency - Quiz 2

RegNo	SName	Gen	PR	Phone	PManager
R1	Sundar	M	BTech	9898786756	Kumar
R2	Ram	M	MS	9897786776	Kumar
R3	Karthik	M	MCA	8798987867	Steve
R4	John	M	BSc	7898886756	Badrinath
R5	Priya	F	MS	9809780967	Kumar
R6	Ram	M	MTech	9876887909	Jagdeesh

Relational Database Design - Functional Dependency Quiz 2

1. Which of the following functional dependencies are held in the given table?

RegNo --> SName Gen PR
RegNo --> Phone
PManager SName --> RegNo
All of the above

2. {(RegNo --> SName Gen PR Phone PManager), (Phone --> RegNo SName Gen PR PManager), (PR --> PManager)}. If these are the functional dependencies of the given relation, which of the following is the Primary key?

RegNo
Phone
(RegNo Phone)
(RegNo PR)

3. Assume that (RegNo, SName), (PR, Gen), (Phone, RegNo), and (RegNo) are the super keys for a relation. Which of the following is the candidate key for this relation?

SName
RegNo
PR
Phone

4. For a table r(A, B, C, D, E), if (A, B), (A, B, E), and (C, D, E) are the candidate keys, which of the following would be the Primary key?

ABE
CDE
AB
None of the above

5. For a table ST(B, O, I, S, Q, D), if S --> D, I --> B, IS --> Q, and B --> O, then what are the keys for ST?

IS
IB
BO
SD

6. In a functional dependency with multiple attributes, which of the following is true?

More than one attribute on LHS may be essential
More than one attribute on RHS may be essential
Both are essential
None of the above

7. If A --> B, B --> C, and C --> D, then which of the following is true?

A --> C
B --> D
A --> D
All of the above

8. If A --> BC, then A --> B and _________ is Decomposition rule.

B --> C
B --> A
A --> C
All of the above

9. Union rule, Decomposition rule, and Pseudotransitivity rule can be proved using Armstrong's axioms.

TRUE
FALSE
TRUE
FALSE

10. In a relational schema R(A, B, C, D, E) with functional dependencies AC --> E, C --> D, and D --> A, which of the functional dependencies has an extraneous attribute?

AC --> E
C --> D
D --> A
None of the above

Score =

Correct answers:

Functional Dependency Quiz 1

Relational Database Design - Functional Dependency Quiz

1. __________ refers to a attribute or group of attributes mentioned in the left hand side of the arrow in a FD.

Discriminator
Determinant
Multivalued attribute
All of the above

2. In a functional dependency X --> Y, if Y is functionally dependent on X, but not on X's proper subsets, then we would call the functional dependency as

Full Functional Dependency
Partial Functional Dependency
Multivalued Functional Dependency
None of the above

3. Which of the following is the result of bad database design?

Repetition of Information
Inability to represent some information
Inconsistent database state due to some transaction
All of the above

4. If X is {E, G, H, M} and Y is {G, M} then X --> Y is

Augmentation Rule
Reflexivity Rule
Union Rule
Pseudotransitivity Rule

5. If X --> YZ then X --> Y and X --> Z is

Composition Rule
Reflexivity Rule
Union Rule
Decomposition Rule

6. Consider F1 and F2 as two sets of functional dependencies. If every functional dependency in F2 can be inferred from the functional dependencies of F1 using inference rules, then F1 is _________ of F2

Cover Set
Closure Set
Minimal Set
None of the above

7. If X --> Y is a functional dependency and X and Y are sets of attributes, what is the relationship between X and Y?

One-to-Many
Many-to-One
One-to-One
Many-to-Many

8. For a functional dependency X --> Y, it is said to be _________ if Y is the subset or equal to X.

Total
Trivial
Non-trivial
Partial

9. To check whether X (a set of one or more attributes) is a candidate key of relation R, we need to find ______ of X.

Canonical Cover
Closure
Minimal Cover
None of the above

10. (a) If every functional dependency in F1 can be inferred from F2 on application of inference rules, and
      (b) removal of any one attribute from any functional dependency of F2 violates (a).   
Then F2 is called ______ for F1.

Minimal Cover
Canonical Cover
Both Minimal and Canonical Cover
None of the above

Score =

Correct answers:

ER Model Quiz 3

DBMS Basics and Entity-Relationship Model - Quiz 3

1. Degree of relational table is

Number of records in the table
Number of attributes in the table
Number of candidate keys in the table
Number of distinct records in the table

2. Cardinality of the relational table is

Number of records in the table
Number of attributes in the table
Number of candidate keys in the table
Number of distinct records in the table

3. Which of the following would be the appropriate term for a key which consists of more than one attribute?

Composite Key
Candidate Key
Primary Key
None of the above

4. Degree of the relationship set is

Number of records in the relational table
Number of attributes in the relationship set
Number of participating entity sets in the relationship set
Number of distinct records in the relationship set

5. Cardinality of an attribute in a relational table is

Number of unique values in the attribute
Number of duplicated values in the attribute
Number of values in the attribute
None of the above

6. A Multivalued attribute in an ER diagram

Must be directly mapped into the base table to which it belongs
Must be mapped into a different table
Must not be mapped into any tables
Must be mapped into the relationship table

7. The set of candidate keys that are not selected as the Primary key is called

Primary Keys
Composite Keys
Alternate Keys
All of the above

8. "CREATE TABLE Emp (Emp_No CHAR(5), EName VARCHAR(25), SALARY NUMBER(8))". This DDL statment will

Create a table named Emp
Create a table named Emp and Update data dictionary
Show error
Not update data dictionary as the table does not have any primary key

9. An attribute or set of attributes of one relation that matches an attribute or set of attributes of other relation is

Primary Key
Candidate Key
Super Key
Foreign Key

10. Which of the following is an Integrity constraint?

INT datatype
NOT NULL
DATE datatype
All of the above

Score =

Correct answers: