0% found this document useful (0 votes)
151 views16 pages

FU-HCM Introduction To Databases: You Are Here

The document is a practice exam for a database course containing 32 multiple choice questions about database concepts. Some of the topics covered in the questions include the entity-relationship model, functional dependencies, relational algebra operations, transactions, isolation levels, and SQL statements. The exam is divided into two pages and requires the student to select one answer for each question.

Uploaded by

minh nguyễn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
151 views16 pages

FU-HCM Introduction To Databases: You Are Here

The document is a practice exam for a database course containing 32 multiple choice questions about database concepts. Some of the topics covered in the questions include the entity-relationship model, functional dependencies, relational algebra operations, transactions, isolation levels, and SQL statements. The exam is divided into two pages and requires the student to select one answer for each question.

Uploaded by

minh nguyễn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 16

FU-HCM » Introduction to Databases

You are here


 FU-HCM
 / » I2DB
 / » Quizzes
 / » Kỳthi: Final Exam - Ngàythi: 08.06.2013
 / » Attempt 1

Kỳthi: Final Exam - Ngàythi: 08.06.2013


JavaScript must be enabled to continue!
Page:  1  2  (Next) 
Question 1
Marks: 1
Choose the right statement about the synthesis algorithm for 3NF schemas
Choose one answer.
a. All of the others
b. The relations of the decomposition are all in 3NF
c. The decomposition has a lossless join
d. The decomposition has the dependency preservation property
Question 2
Marks: 1
Which of the followings is false about weak entity set?
Choose one answer.
a. Do not contruct a relation for any supporting relationship
b. The key for a weak entity set includes the keys for all supporting entity sets
c. Every many - one relationship from a weak entity set need be supporting
d. A weak entity set has one or more relationships to other (supporting) entity sets
Question 3
Marks: 1
Which of the followings is not applied while converting UML diagrams to relations?
Choose one answer.
a. For each aggreation or composition, create a relation
b. For each association, create a relation
c. None of the others
d. For each class, create a relation
Question 4
Marks: 1
In order to assure the durable property of the transactions. The DBMS needs the _________
Choose one answer.
a. logging and recovery manager
b. storage manager
c. transaction manager
d. concurrency-control manager
Question 5
Marks: 1
Select the right answer
Choose one answer.
a. All of the others
b. Virtual views are defined by an expression like a query
c. Virtual views do not exist physically
d. Virtual views can be queried and can even be modified
Question 6
Marks: 1
The result of (UNKNOWN OR FALSE) is
Choose one answer.
a. TRUE
b. FALSE
c. UNKNOWN
Question 7
Marks: 1
Which of the followings is true?
Choose one answer.
a. All of the others
b. The ER model represents the operation on data
c. The Entity Relationship (ER) model represents the structure of data graphically
d. The ER model is a low level database design
Question 8
Marks: 1
Suppose a relation R(A,B,C) where all attributes are numeric and we'd like to create a modifying
view. Which of followings is valid?
Choose one answer.
a. CREATE VIEW RA AS SELECT A FROM R R1, R R2 WHERE R1.B=R2.C
b. All of the others
c. CREATE VIEW RA AS SELECT A FROM R WHERE B=5 AND C=2;
d. CREATE VIEW RA AS SELECT A FROM R R1 WHERE R1.B IN (SELECT R2.C
FROM R R2)
Question 9
Marks: 1
Select incorrect recommemtation:
Choose one answer.
a. Dropping Project relation will drop the view ProjectNo1, too
Question 10
b. Dropping Project relation will make the view ProjectNo1 unusable Marks: 1
c. Dropping Project relation will not effect on ProjectNo1 view Select the valid
query to
d. Dropping ProjectNo1 view will make the relation Project unusable
declare the
foreign key presC# of the relation Studio(name, address, presC#) that references the cert# of the
relation MovieExec(name, address, cert#, netWorth):
Choose one answer.
a.

b.

c.
d. All of the others.
Question 11
Marks: 1
Suppose a relation R(A,B) and S(B,C) are bags. R has 2 tuples (1,3), (2,4) and S has 3 tuples
(1,2), (1,2) and (4,5). The theta join R ⋈R.B>S.B S has __________ tuples
Choose one answer.
a. 3
b. 4
c. 6
d. 2
Question 12
Marks: 1
Which of the following is NOT a standard aggregation operator?
Choose one answer.
a. COUNT
b. SUM
c. AVG
d. GROUP
Question 13
Marks: 1
Consider a relation with schema R(A, B, C, D) and FD's A -> B, A -> C, C -> D. Which of the
following is the {A}+ ?
Choose one answer.
a. {A,B}
b. {A}
c. {A,B,C}
d. {A,B,C,D}
Question 14
Marks: 1
Suppose a relation Employee(SSN, Name, Supervisor). The view Supervisor is defined as
followed:
CREATE VIEW Supervisor AS SELECT SSN, Name FROM Employee WHERE SSN NOT IN
(SELECT Supervisor FROM Employee).
Which of the followings is executable in Supervisor?
Choose one answer.
a. Update exist tuple
b. None of the others
c. Delete exist tuple
d. Insert new tuple
Question 15
Marks: 1
Which of the followings doesn't take the key's condition 'no two tuples agree on all attributes of
key'?
Choose one answer.
a. Foreign key
b. Unique key
c. None of the others
d. Primary key
Question 16
Marks: 1
Any Create command maybe reserved by using a __________ command
Choose one answer.
a. Commit
b. Delete
c. Rollback
d. Drop
Question 17
Marks: 1
The most useful index on a relation is an index on its key. This is because:
Choose one answer.
a. The search operation based on the primary key is commonly used.
b. All of the others
c. The index on non key attribute(s) makes update operations to the relation more complex
and time-consuming
d. The index on non key attribute(s) runs slower
Question 18
Marks: 1
_________ authorizes access to database, coordinate, monitor its use, acquiring software, and
hardware resources, ...
Choose one answer.
a. Database designer
b. All of the others
c. Database enduser
d. Database administrator
Question 19
Marks: 1
An A attribute is called the key of relation R if __________
Choose one answer.
a. There are no two tuples that have the same values on the A component
b. Its closure includes all attributes of relation R
c. It functionally determines all the other attributes of relation R
d. All of the others
Question 20
Marks: 1
The number of entity sets that participate in a relationship is called the _________
Choose one answer.
a. Identifying characteristic
b. Counter
c. Degree
d. Number
Question 21
Marks: 1
Suppose the query ‘SELECT R.* FROM R LEFT OUTER JOIN S ON R.A=S.A’. Which of the
followings returns the same result as this query does?
Choose one answer.
a. SELECT R.* FROM R JOIN S ON R.A=S.A
b. SELECT R.* FROM S RIGHT OUTER JOIN R ON S.A=R.A
c. SELECT R.* FROM R FULL OUTER JOIN S ON R.A=S.A
d. None of the others
Question 22
Marks: 1
Given a relation R(A,B,C,D) with functional dependencies AC -> D , BC -> A , CD -> B. One
key of R is ___________
Choose one answer.
a. {A, B}
b. {A, D}
c. {C, D}
d. {A, B, D}
Question 23
Marks: 1
In SQL language, the command/statement that let you change the schema of a relation is:
Choose one answer.
a. Alter
b. All of the others
c. Create
d. Drop
Question 24
Marks: 1
Choose right answer(s).
Choose one answer.
a. All of the others.
b. Arithmetic operators on NULL values will return a NULL value
c. NULL value is unknown, inapplicable, or withheld
d. Comparisons with NULL values will return UNKNOWN
Question 25
Marks: 1
Which of the following logical expressions is FALSE?
Choose one answer.
a. (UNKNOWN OR TRUE) AND (UNKNOWN OR FALSE)
b. (UNKNOWN OR TRUE) OR (UNKNOWN AND FALSE)
c. (UNKNOWN AND TRUE) OR (UNKNOWN OR FALSE)
d. None of the others
Question 26
Marks: 1
Which of the followings was the first ever used for data model?
Choose one answer.
a. Tree based model
b. Relational model
c. Graph based model
d. File system
Question 27
Marks: 1
Suppose R(A,B,C) is bag, S= σ(A>B) (R). Choose a right answer
Choose one answer.
a. A schema of S is different from a schema of R
b. None of the others
c. S has the same schema as R, and S has more tuples than R has
d. A number of tuples in S is ALWAYS less than a number of tuples in R
Question 28
Marks: 1
Which of following feature is NOT responsibility of Database Management
System
Choose one answer.
a. Allow users to create new databases and specify their schemas
b. Give users the ability to query the data
c. Support the storage of very large amounts of data
d.Manage user accounts of computer on which DBMS is running
Question 29
Marks: 1
Temporary table is _______________
Choose one answer.
a. A kind of relation that is defined by a computation, that is not stored, but is constructed,
in whole or in part
b. None of the other
c. A kind of relation that is constructed by SQL when it performs its job, and is
thrown away and not stored
d. A kind of relation that exists in the database and that can be modified by changing its
tuples
Question 30
Marks: 1
Which of the following relational operations are considerably more efficient if we use the bag
model?
Choose one answer.
a. Production
b. Intersection
c. Difference
d. Union
Page:  1  2  (Next) 
LêTàiNhật Minh
minhltnse60982

You are logged in as Minh LêTàiNhật (Logout)


I2DB Moodle Themeweb hosting

FU-HCM » Introduction to Databases


You are here
 FU-HCM
 / » I2DB
 / » Quizzes
 / » Kỳthi: Final Exam - Ngàythi: 08.06.2013
 / » Attempt 1

Kỳthi: Final Exam - Ngàythi: 08.06.2013


JavaScript must be enabled to continue!
Page:  (Previous)  1  2 
Question 31
Marks: 1
Which of the following isolation levels allows to read the dirty data?
Choose one answer.
a. SET TRANSACTION ISOLATION LEVEL SERIALIZABLE;
b. SET TRANSACTION ISOLATION LEVEL REPEATABLE READ;
c. SET TRANSACTION ISOLATION LEVEL READ COMMITTED;
d. SET TRANSACTION ISOLATION LEVEL READ UNCOMMITED;
Question 32
Marks: 1
Choose an incorrect statement.
Choose one answer.
a. Database is created and maintained by a DMBS
b. None of the others
c. Database is a collection of data that is managed by a DBMS
d. Database is a collection of information that exists over a long period of time
Question 33
Marks: 1

Which of the following laws holds for sets but not for bags?(R, S, T mean relations, v means
union and ^ means intersection)

Choose one answer.


a. (RvS)vT=Rv(SvT)
b. All of the others
c. (R^S)^T=R^(S^T)
d. R^(SvT)=(R^S)v(R^T)
Question 34
Marks: 1
Which of the followings is TRUE about E/R model?
Choose one answer.
a. Attributes are associated to both entity sets and relationship types
b. Attributes are very simple types, e.g. integers or character strings
c. All of the others
d. Attributes cannot have the same name in the same entity set
Question 35
Marks: 1
Suppose a relation R(A,B,C) and a primary key constraint on an A attribute. Which of followings
may violate this constraint?
Choose at least one answer.
a. Insert a new tuple to the relation R
b. Delete an exist tuple
c. Update an exist tuple on A component
d. All of the others
Question 36
Marks: 1
View is __________
Choose one answer.
a. None of the others
b. A kind of relation that exists in the database and that can be modified by changing its
tuples
c. A kind of relation that is constructed by SQL when it performs its job, and is
thrown away and not stored
d. A kind of relation that is defined by a computation, that is not stored, but is constructed,
in whole or in part
Question 37
Marks: 1
Given three relations: R(A,B,C), S(D,E) and T(F,G). There are two referential integrity
constraints:
D of S references to A of R,
E of S references to F of T.
Which of following actions may violate these two constraints?
Choose one answer.
a. update existing tuples in S
b. insert a new tuple into S
c. delete existing tuples from
R
d. all of the answers
Question 38
Marks: 1

Suppose a relation R(A,B,C) with three numeric attributes, RC(A,B) is an updatable view
associated to R where C=1. Evaluate the following statement:

INSERT INTO RC(A,B) VALUES (1,2)

Choose one answer.


a. None of the others
b. The query cannot be executed
c. The query is executed but nothing happened on R neither on S
d. The query is executed, there is new tuple (1,2) on RC, and new tuple (1,2,1) on R
Question 39
Marks: 1
To integrate information from many databases, we often __________
Choose one answer.
a. Use a special software package/system to synchronize all particular databases into one
central database
b. Implement a middleware (such as data mining), where information from many
databases are copied periodically
c. Create a datawarehouses, that support an integrated model of data of these databases
d. None of the others
Question 40
Marks: 1
A constraint between two attribute sets in a relation is called __________
Choose one answer.
a. Functional dependency
b. Functional relation
c. Attribute dependency
d. Functional relation constraint
Question 41
Marks: 1
Entity Relationship Model ____________
Choose one answer.
a. Represents the structure of data without operations on data
b. Represents the structure of data with operations on data
c. Represents the operations on data without structure of data
d. Represents the operations on data with structure of data
Question 42
Marks: 1
Suppose a relation R with two instances R1, R2. Suppose A, B are key and nonkey components
of R, respectively. Which of the followings refers to key constraints?

Choose one answer.


a. Choice b
b. Choice c
c. Choice a
d. Choice d
Question 43
Marks: 1
Which of the followings is correct to indexes?
Choose at least one answer.
a. No index contain more than one attribute
b. Increase the cost of implementation
c. Provides rapid random and sequential access to base-table data
Question 44
Marks: 1

Given the relation tblWorksOn(empSSN,proNum) in which empSSN is the employee ID and


proNum is number of projects which the employee has joined. Evaluate the following statement:

SELECT w1.empSSN
FROM tblWorksOn w1, tblWorksOn w2
WHERE w1.empSSN=w2.empSSN AND w1.proNum < w2.proNum

Choose one answer.


a. None of the others
b. The query can be executed and returns all those empSSN, who have worked for exactly
two projects
c. The query can be executed and returns all those empSSN, who have worked for more
than one projects
d. The query cannot be executed
Question 45
Marks: 1
Suppose that R(A,B,C) and S(B,C) are bags. R has three tuples (1,1,4), (3,4,2), (2,2,3). S has two
tuples (1,4), (2,3). Which of the following is a result of a expression: δ(γA, SUM(B)->SUMB(δ(R*S)))
(Note that: the notation * denotes for the natural join)
Choose one answer.
a. one tuples
b. two tuples
c. the expression is invalid
d. three tuples
Question 46
Marks: 1
Suppose that an ER diagram has the R relationship connecting between E and F, and R is many-
one from E to F. When you converts this ER diagram to relations, the result is
Choose one answer.
a. Three relations RE, RF and RR corresponding to entity E, enttity F and relationship R
b. One relation named RF corresponding to entity F. One relation named RE corresponding
to entity E and relationship R. The relation RE includes the key of F
c. One relation named RE corresponding to entity E. One relation named RF corresponding
to entity F and relationship R. The relation RF includes the key of E
d. None of the others
Question 47
Marks: 1
Which of following is the most commonly used data model
Choose one answer.
a. Relational model
b. Object-relational model
c. Graph-based model
d. Object oriented model
e. Hierarchical model
f. Tree-based model
Question 48
Marks: 1
The result of ((20<NULL) OR FALSE) AND (UNKNOWN OR FALSE) is
Choose one answer.
a. NULL
b. FALSE
c. UNKNOWN
d. TRUE
Question 49
Marks: 1
The relation R(ABCD) has following FDs:AB -> C ;ABD -> C ;ABC -> D ;AC -> D
What is true about R?
Choose one answer.
a. None of the others
b. R is not in 3NF
c. R is in 3NF
d. R is in BCNF
Question 50
Marks: 1
Suppose the relation Employee(SSN,Name,Salary,Department). Which of the followings returns
all those employees with salary exceeds salary of all employees from department 1?
Choose one answer.
a. All of the others
b. SELECT * FROM Employee WHERE Salary >=ANY (SELECT MAX(Salary) FROM
Employee WHERE Department=1)
c. SELECT * FROM Employee WHERE Salary >= ALL (SELECT Salary FROM
Employee WHERE Department=1)
d. SELECT * FROM Employee WHERE Salary >= (SELECT MAX(Salary) FROM
Employee WHERE Department=1)
Question 51
Marks: 1
Given the relation Movies(title, year, length, genre, studioName). Select the right query to create
a View with the titles and studio names of all movies that were produced in 1980
Choose one answer.
a. CREATE VIEW OldMovies SELECT title, year FROM Movies WHERE year=1980
b. None of the others
c. CREATE VIEW OldMovies AS SELECT title, studioName FROM Movies WHERE
year=1980
d. CREATE VIEW OldMovies SELECT title, studioName FROM Movies WHERE
year=1980
Question 52
Marks: 1
Data model is a notation for describing data or information. The description consists of
__________
Choose at least one answer.
a. Operations on the data
b. Structure of the data
c. Privilege on the data
d. Constraints on the data
e. Users on the data
Question 53
Marks: 1
Suppose R(A,B) and S(B,C) are bags. R has two tuples (1,1), (1,1), (1,2) and (1,2). S has three
tuples (1,2), (2,1), (2,2). Choose two right statements from the R\S operation.
Choose at least one answer.
a. This operation is valid and the result has two tuples
b. This operation is valid and the (1,2) tuple appears once in the result
c. This operation is invalid because the attribute names of two relations are not the same
d. This operation is valid and the result has three tuples
Question 54
Marks: 1
In referential integrity constraint, the referenced attribute(s) must be __________ or _________
Choose one answer.
a. Primary key, Foreign key
b. None of the others
c. Primary key, Unique key
d. Unique key, Foreign key
Question 55
Marks: 1
Select the right statement
Choose one answer.
a. A foreign key in one table points to a PRIMARY KEY in another table
b. Referential integrity constraint is also called foreign key constraint
c. All of the answers
d. A foreign key constraint can be added or deleted using the 'Alter Table' command
Question 56
Marks: 1
Suppose that we define an attribute A as unique key of the relation R. Which of the followings is
true?
Choose one answer.
a. Tuples cannot have the same value on the A component
b. There is no more unique key in the relation R
c. None of the others
d. Null values are unavailable on A component
Question 57
Marks: 1
Suppose a relation R(A,B) and S(B,C) a constraint says that in a value appear in A of R must be
appear on B of S. How can we implement this constraint?
Choose one answer.
a. We create a referential integrity constraint from B to A
b. We create a referential integrity constraint from A to B
c. We create a tuple-based CHECK constraint
d. We create an attribute-based CHECK constraint
Question 58
Marks: 1
Suppose two relations Movies(title, year, length, genre, studioName, producerC#) and
MovieExec (name, address, cert#).
Evaluate the following SQL statement:
SELECT me.name,m.title, m.year
FROM MovieExec me LEFT OUTER JOIN Movies m ON (me.cert#=m.producerC#);
Choose one answer.
a. It gives the details of movies irrecpective of whether they had a movie executive or not
b. It gives the details of movie executives irrecpective of whether they produced movies or
not
c. It gives the details of movie executives who didnot produce any movie yet
d. It gives the details of movie executives who produced at least one movie
Question 59
Marks: 1
When we define an attribute A as PRIMARY KEY of relation R, then __________
Choose one answer.
a. Tuples must be null on the A component
b. There are no two tuples that have the same values on the A component
c. We may define more primary keys on the relation R
d. None of the others
Question 60
Marks: 1
Choose the false statement about the decomposition into 3NF?
Choose one answer.
a. The relations of the decomposition are all in 3NF.
b. The decomposition has the dependency preservation property.
c. The decomposition eliminates all anomalies.
d. The decomposition has a lossless join.
Page:  (Previous)  1  2 
LêTàiNhật Minh
minhltnse60982

You are logged in as Minh LêTàiNhật (Logout)


I2DB Moodle Themeweb hosting

You might also like