0% found this document useful (0 votes)
16 views

FDBMS Reg 3rd Edited

The document is a 4 page exam paper for a database management systems course. It contains instructions, 4 parts with multiple choice, fill in the blank, and short answer questions on topics like functional dependencies, normalization, entity relationship diagrams, and relational algebra operations.

Uploaded by

Dawit Sebhat
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views

FDBMS Reg 3rd Edited

The document is a 4 page exam paper for a database management systems course. It contains instructions, 4 parts with multiple choice, fill in the blank, and short answer questions on topics like functional dependencies, normalization, entity relationship diagrams, and relational algebra operations.

Uploaded by

Dawit Sebhat
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

ALLIANCE COLLEGE

COLLEGE OF UG
FINAL EXAM

FDBMS Info Exam


Course Title Facility E. Year 2014 Program REG -------
Date
Course Code Department IT A. Year Semester Max.
-------- 2016 1 Weight 50 %
Instructor C. Year Section Time
Name Seada 3 A Allowed 1:00

Name _____________________________ ID. No ______________________


Section ___________________________ Department _________________

INSTRUCTION
 Make sure the exam paper contains 4 pages including the cover page.
 Make sure the exam paper contains the appropriate number of question in appropriate
parts.
 Answer the question according to the instructions given for each part.
 Write your answer neatly on the space provided.
 Mobile phone should be switched off.
 Cheating in any form will result punishment without prior notice.

PART I: True or False [ Pts.]


1. Functional dependency plays a vital role to find the difference between good and bad database design.
2. A transitive dependency can occur in a relation of one or two attributes.
3. Primary key attribute is an attribute that is not part of any candidate key.
4. Project operator in relational algebra is similar to the Where clause in SQL.
5. The EER model includes all the modelling concept of the ER model.
6. Deleting super class implies that automatically deleted all the subclasses to which it belongs.
7. Theta join can only perform if there is at least one common attribute exists between relations.
8. Normalization may reduce system performance since the data will be cross referenced from many tables.
9. A total specialization constraint specifies that every entity in the superclass must be a member of at most
one subclass in the specialization.
PART II: Choose the best answer from the given alternative [ pts.]
1.
1. Which of the following is an example of composite attributes?
A. Address B. Age C. Salary D. Phone Number
2. It is attribute, or set of attributes, within one relation that matches the candidate key of some relation is
called
A. Super Key B. Primary Key C. Foreign Key D. None
3. In which of the following is a single-entity instance of one type related to many entity instances of
another type?
A. One to Many B. One to One C. Many to Many D. None
4. Properties that describe the characteristics of entity are called
A. Entities B. Attributes C. Relationship D. None
5. In case of entity integrity, the primary key may be
A. Not Null B. Null C. both Null & not Null D. any value
6. Which of the following is NOT a basic element of all versions of the E-R model.
A. Entities B. Attributes C. Relationship D. Primary Key

ALLIANCE COLLEGE Page 1


ALLIANCE COLLEGE
COLLEGE OF UG
FINAL EXAM

7. In an E-R diagram an entity set is represent by a


A. Rectangle B. Ellipse C. Diamond box D. Circle.
8. In an E-R diagram, attributes are represented by
A. Rectangle B. Square C. Ellipse D. Triangle
9. The number of entity sets that participate in a relationship set is known as __________________.
A. Cardinality B. Degree C. Participate D. None
10. The attribute name could be structured as an attribute consisting of first name, middle name and last
name. This type of attribute is called.
A. Simple attribute C. Composite attribute
B. Multivalued attribute D. Derived attribute
11. If B is and attribute and A → B, then B is said to be ________________________ by A.
A. Logically implied C. Functionally implied
B. Functionally determined D. Logically determined
12. Which one of the following dependency helps us normalizing the database in 3rd Normal Form?
A. Transitive functional dependency C. Trivial functional dependency
B. Non-trivial functional dependency D. None of the above
13. The normalization form which is based on the transitive dependency is classified as
A. 3rd Normal form B. 2nd Normal Form D. 1st Normal Form D. None
14. The normal form, which only includes indivisible values or single atomic values, is classified as.
A. 3rd Normal form B. 2nd Normal Form D. 1st Normal Form D. None
15. If E1 and E2 are relational algebra expression, then which of the following is NOT relational algebra
expression?
A. E1 U E2 B. E1 / E2 C. E1 - E2 D. E1 X E2
16. Cartesian product in relational algebra is
A. a Unary operator B. a Binary operator C. a Ternary operator D None
17. Using Relational Algebra the query that finds customers, who have a balance of over 1000 is
A. Π Customer_name(σ balance >1000(Deposit))
B. σ Customer_name(Π balance >1000(Deposit))
C. Π Customer_name(σ balance >1000(Borrow))
D. σ Customer_name(Π balance >1000(Borrow))
18. A data manipulation commands the combines the records from one or more tables is called
A. Select B. Project C. Join D. Product
19. _____ operator takes the result of two queries and returns only rows that appear in both result sets.
A. Union B. Set difference C. Select D. Intersection
20. Which of the following anomalies result from a transitive dependency?
A. Insertion B. Deletion C. Modification D. All
21. In 2NF, which form of dependency is removed?
A. Transitive B. Partial C. Functional D. Associative
22. A functional dependency is a relationship between/among ___________
A. Rows B. Tables C. Attributes D. Entities
23. Which one is a Unary operation?
A. Union B. Projection C. Set difference D. Join
24. Which one is a join condition that contains an equality operator?
A. Natural join B. Left join C. Equijoin D. Right join
25. To remove a relation from an SQL database, we use the _________ command.
A. Delete table B. Purge table C. Remove table D. Drop table
ALLIANCE COLLEGE Page 2
ALLIANCE COLLEGE
COLLEGE OF UG
FINAL EXAM

PART III: Fill in the blank space (each loads 2pts.)

1. ____________is a conceptual model that gives the graphical representation of the logical structure of the
database.
2. ____________ is a process of analysing the relation schemas based on their different functional
dependencies and primary key.
3. A relation is said to be in first normal form (INF) if and only if all underlying domains contain
____________ values only.
4. ______________ operation is sequence of CARTESIAN PRODUCT followed by SELECT operation.
5. ______________ is the process of defining a set of subclass of an entity type or super class.
6. ______________ is procedural query language, which takes instances of relations as input and yields
instances of relations as output.
PART IV: Answer the following questions accordingly
1. List and discuss the three types of anomalies that occur when the database is not normalized. [3 pt.]
2. List and describe the types of functional dependency. [3 pt]
3. Based on this table, show the result of left outer joins and right outer join. [4 pt]
Left table Right table

X Y Z A

10 Hawa 11 DB

11 Jone 13 Java

12 Heran 14 PHP

ALLIANCE COLLEGE Page 3


ALLIANCE COLLEGE
COLLEGE OF UG
FINAL EXAM

Answer Sheet

FDBMS Info Exam


Course Title Facility E. Year 2014 Program REG -------
Date
Course Code Department IT A. Year Semester Max.
-------- 2016 1 Weight 50 %
Instructor C. Year Section Time
Name Seada 3 A Allowed 1:00

Name _____________________________ ID. No ______________________

Section ___________________________ Department _________________

PART - I
1. ______________ 4. ______________ 7. ______________
2. ______________ 5. ______________ 8. ______________
3. ______________ 6. ______________ 9. ______________
PART - II
1. ______________ 10. ______________ 19. ______________
2. ______________ 11. ______________ 20. ______________
3. ______________ 12. ______________ 21. ______________
4. ______________ 13. ______________ 22. ______________
5. ______________ 14. ______________ 23. ______________
6. ______________ 15. ______________ 24. ______________
7. ______________ 16. ______________ 25. _____________
8. ______________ 17. ______________
9. ______________ 18. ______________
PART III: Fill in the blank space
1. ________________ 4. ________________
2. ________________ 5. ________________
3. ________________ 6. ________________
PART IV
1.

2.

3.

ALLIANCE COLLEGE Page 4

GOOD LUCK

You might also like