FU-HCM Introduction To Databases: You Are Here
FU-HCM Introduction To Databases: You Are Here
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
Which of the following laws holds for sets but not for bags?(R, S, T mean relations, v means
union and ^ means intersection)
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:
SELECT w1.empSSN
FROM tblWorksOn w1, tblWorksOn w2
WHERE w1.empSSN=w2.empSSN AND w1.proNum < w2.proNum