Scribd
Upload
51 views3 pages

Mandalay Technological University Department of Computer Engineering and Information Technology

Uploaded by

Hana hana

1. The document contains a practice exam for a database management systems course. It has 30 multiple choice questions testing concepts like domains, relations, tuples, keys, constraints, and database operations. 2. Key concepts covered include the definition of domains as sets of indivisible values, relations as sets of tuples, and tuples as ordered lists of attribute values. Constraints involve domains, keys, entities, and referential integrity. 3. Common database operations like insertion, deletion, and modification are listed along with ways they can violate constraints. Questions also cover topics like superkeys, foreign keys, and NULL values.

Copyright:

© All Rights Reserved
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt

Mandalay Technological University Department of Computer Engineering and Information Technology

Uploaded by

Hana hana
51 views3 pages
1. The document contains a practice exam for a database management systems course. It has 30 multiple choice questions testing concepts like domains, relations, tuples, keys, constraints, and database operations. 2. Key concepts covered include the definition of domains as sets of indivisible values, relations as sets of tuples, and tuples as ordered lists of attribute values. Constraints involve domains, keys, entities, and referential integrity. 3. Common database operations like insertion, deletion, and modification are listed along with ways they can violate constraints. Questions also cover topics like superkeys, foreign keys, and NULL values.

Original Title

Database

Copyright

© © All Rights Reserved

Available Formats

DOCX, PDF, TXT or read online from Scribd

Did you find this document useful?

Is this content inappropriate?

1. The document contains a practice exam for a database management systems course. It has 30 multiple choice questions testing concepts like domains, relations, tuples, keys, constraints, and database operations. 2. Key concepts covered include the definition of domains as sets of indivisible values, relations as sets of tuples, and tuples as ordered lists of attribute values. Constraints involve domains, keys, entities, and referential integrity. 3. Common database operations like insertion, deletion, and modification are listed along with ways they can violate constraints. Questions also cover topics like superkeys, foreign keys, and NULL values.

Copyright:

© All Rights Reserved
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
51 views3 pages

Mandalay Technological University Department of Computer Engineering and Information Technology

Uploaded by

Hana hana
1. The document contains a practice exam for a database management systems course. It has 30 multiple choice questions testing concepts like domains, relations, tuples, keys, constraints, and database operations. 2. Key concepts covered include the definition of domains as sets of indivisible values, relations as sets of tuples, and tuples as ordered lists of attribute values. Constraints involve domains, keys, entities, and referential integrity. 3. Common database operations like insertion, deletion, and modification are listed along with ways they can violate constraints. Questions also cover topics like superkeys, foreign keys, and NULL values.

Copyright:

© All Rights Reserved
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1/ 3

Mandalay Technological University

Department of Computer Engineering and Information Technology


IT- 31035 Database Management System I
Tutorial – II
Date : 13.2.2020 Time allowed 1 hour
Attempt All Question
I. Choose the correct answer for each question. (30 Marks)
1. In formal relational model, set of indivisible values is called
A. range C. relation
B. domain * D. tuple

2. In relational model terminology, table is considered as


A. range C. relation*
B. domain D. tuple

3. A row of table in relational model terminology is classified as


A. range C. relation
B. domain D. tuple*

4. Ordered list of all n-values is classified as


A. n-tuple C. v-tuple
B. l-tuple D. all of above*

5. State in which database follows all integrity constraints is classified as


A. valid state* C. parallel state
B. candidate state D. invalid state

6. Column header of table in relational model terminology is classified as


A. entity domain C. attribute*
B. table ender D. table starter

7. Cardinality in relational data model is considered as


A. limited number of values C. two numbers from set
B. total number of values * D. three numbers from set

8. Values which cannot be divided further are classified as


A. formatted values C. diatomic values
B. bi-atomic model D. atomic values*

9. In a relation schema, each key of schema having more than one key is classified as
A. candidate key* C. simple key
B. super key D. composite key

10. In relational databases, the key which are considered as type of reference attribute is classified as
A. composite keys C. primary key
B. candidate key D. foreign key*
11. Model in which multi-valued and composite attributes is considered as
A. reverse relational model C. parallel relational model
B. flat relational model* D. circular relational model

12. When primary key is null of new tuple then constraint violated is


A. null integrity constraint C. secondary integrity constraint
B. primary integrity constraint D. entity integrity constraint *

13. In data model schemas, constraints that are can not be expressed directly are classified as
A. application based constraints C. business rules
B. semantic constraints D. all of above*

14. Constraint violated when given value of attribute is not included in corresponding domain is
A. domain constraint* C. key constraint
B. attribute constraint D. state constraint

15. In data model, inherent constraints are classified as


A. flat constraints C. explicit constraints
B. parallel constraints D. implicit constraints*

16. Constraints which deals with state changes in database are classified as
A. assertion constraints C. transition constraints*
B. trigger constraints D. specified constraints

 17. In data model schemas, constraints that are expressed directly are classified as
A. implicit constraints C. flat constraints
B. explicit constraints* D. parallel constraints

18. Constraint violated when key value in tuple already exists in some other relation's tuple is called
A. domain constraint C. key constraint*
B. attribute constraint D. primary key constraint

19. Type of constraint in which value of each attribute (X) must be an indivisible value from domain
(X) is classified as
A. explicit constraint C. domain constraint*
B. implicit constraint D. state constraint

20. When foreign key refers to a tuple which does not exists in subjected relation then constraint
violated is
A. modify integrity C. inferential integrity
B. referential integrity* D. insert integrity

21. Type of constraint which states that not even a single value with primary key can be a null value
is classified as
A. null integrity constraint C. secondary integrity constraint
B. primary integrity constraint D. entity integrity constraint*

22. If two or more constraints are violated by using insert operation then by default the
A. insert is accepted C. insertion permanently blocked
B. insert is rejected* D. none of above

23. Basic operations that can be performed on relations are


A. deletion C. modification
B. insertion D. all of above*

24. A composite primary key consists of a primary key and a foreign key.
A. True
B. False*

25. NULL values may mean value unknown, value exists but is not available, attribute does not
apply to this tuple (value undefined).
A. True*
B. False

26. The INSERT operation can violate domain constraints, key constraints, entity integrity, or
referential integrity.
A. True*
B. False

27.The DELETE operation can violate referential integrity.


A. True*
B. False

28. What is a foreign key?


A. A foreign key is a primary key of a relation which is an attribute in another relation
B. A foreign key is a superkey of a relation which is an attribute in more than one other relations
C. A foreign key is an attribute of a relation that is a primary key of another relation*
D. A foreign key is the primary key of a relation that does not occur anywhere else in the
schema

29. Choose the correct statement regarding superkeys


A. Every superkey is a candidate key
B. A superkey is a tuple or a set of multiple tuples that can uniquely identify an attribute
C. A superkey is an attribute or a group of multiple attributes that can uniquely identify a tuple*
D. A superkey is an attribute or a set of attributes that distinguish the relation from other
relations

30. Statement 1: A tuple is a row in a relation


Statement 2: Existence of multiple foreign keys in a same relation is possible
A. Both the statements are true*
B. Statement 1 is correct but Statement 2 is false
C. Statement 1 is false but Statement 2 is correct
D. Both the statements are false

------------- End of Question & Solution ---------------

You might also like