SET 2 DBMS MCQ

1. Which of the following gives a logical structure of the database graphically?

a) Entity-relationship diagram
b) Entity diagram
c) Database diagram
d) Architectural representation

2. The entity relationship set is represented in E-R diagram as

a) Double diamonds
b) Undivided rectangles
c) Dashed lines
d) Diamond

3. The Rectangles divided into two parts represents

a) Entity set
b) Relationship set
c) Attributes of a relationship set
d) Primary key

4. Consider a directed line(->) from the relationship set advisor to both entity sets
instructor and student. This indicates _________ cardinality
a) One to many
b) One to one
c) Many to many
d) Many to one

5. We indicate roles in E-R diagrams by labeling the lines that connect

___________ to __________
a) Diamond , diamond
b) Rectangle, diamond
c) Rectangle, rectangle
d) Diamond, rectangle

6. An entity set that does not have sufficient attributes to form a primary key is
termed a __________
a) Strong entity set
b) Variant set
c) Weak entity set
d) Variable set
7. For a weak entity set to be meaningful, it must be associated with another entity
set, called the
a) Identifying set
b) Owner set
c) Neighbour set
d) Strong entity set

8. Weak entity set is represented as

a) Underline
b) Double line
c) Double diamond
d) Double rectangle

9. If you were collecting and storing information about your music collection, an
album would be considered a(n) _____
a) Relation
b) Entity
c) Instance
d) Attribute

10. What term is used to refer to a specific record in your music database; for
instance; information stored about a specific album?
a) Relation
b) Instance
c) Table
d) Column

11. Which of the following symbols represent entity sets in an ER diagram?

a) Divided rectangles
b) Diamonds
c) Lines
d) Undivided rectangles

12. Which of the following symbols represent relationship sets in an ER diagram

a) Divided rectangles
b) Diamonds
c) Lines
d) Undivided rectangles
13. What do double diamonds represent in an ER diagram
a) They link entity sets to relationship sets
b) Total participation of an entity in a relationship set
c) Relationship sets linked to weak entity sets
d) None of the mentioned

14. What does a directed line ( → ) from a relationship set to two entity sets mean?
a) One-one
b) Many-one
c) Many-many
d) One-many

15. How are roles specified in an ER diagram

a) By labelling the rectangles
b) By labelling the diamonds
c) Roles cannot be specified in an ER diagram
d) By labelling the lines

16. How is the discriminator of a weak entity set specified?

a) Using a solid line
b) Circling it
c) Using a dashed line
d) Drawing a square around it

17. An entity set that has a primary key is called as ___________

a) Strong entity set
b) Weak entity set
c) Complete entity set
d) None of the mentioned

18. The relationship associating the weak entity sets with the identifying entity set
is called as ________
a) Identifying relationship
b) Connecting relationship
c) Completing relationship
d) Unique relationship
19. State true or false: Every weak entity set must be associated with an identifying
entity
a) True
b) False

20. State true or false: A weak entity can participate in all the relationships.
a) True
b) False

21. Let us consider phone_number ,which can take single or several values .
Treating phone_numberas an _________ permits instructors to have several phone
numbers (including zero) associated with them.
a) Entity
b) Attribute
c) Relation
d) Value

22. The total participation by entities is represented in E-R diagram as

a) Dashed line
b) Double line
c) Double rectangle
d) Circle

23. Given the basic ER and relational models, which of the following is
INCORRECT?
a) An attribute of an entity can have more than one value
b) An attribute of an entity can be composite
c) In a row of a relational table, an attribute can have more than one value
d) In a row of a relational table, an attribute can have exactly one value or a NULL
value

24. Which of the following indicates the maximum number of entities that can be
involved in a relationship?
a) Minimum cardinality
b) Maximum cardinality
c) ERD
d) Greater Entity Count

25. In E-R diagram generalization is represented by

a) Ellipse
b) Dashed ellipse
c) Rectangle
d) Triangle

26. What is a relationship called when it is maintained between two entities?

a) Unary
b) Binary
c) Ternary
d) Quaternary

27. Which of the following is a low level operator?

a) Insert
b) Update
c) Delete
d) Directory

28. Key to represent relationship between tables is called

a) Primary key
b) Secondary Key
c) Foreign Key
d) None of the mentioned

29. A window into a portion of a database is

a) Schema
b) View
c) Query
d) Data dictionary

30. A primary key is combined with a foreign key creates

a) Parent-Child relation ship between the tables that connect them
b) Many to many relationship between the tables that connect them
c) Network model between the tables that connect them
d) None of the mentioned

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

a) Rectangle
b) Ellipse
c) Diamond box
d) Circle
32. A relational database developer refers to a record as
a) A criteria
b) A relation
c) A tuple
d) An attribute

33. The relational model feature is that there

a) is no need for primary key data
b) is much more data independence than some other database models
c) are explicit relationships among records
d) are tables with many dimensions

34. E-R model uses this symbol to represent weak entity set ?
a) Dotted rectangle
b) Diamond
c) Doubly outlined rectangle
d) None of the Mentioned

35. Which of the following is record based logical model?

a) Network Model
b) Object oriented model
c) E-R Model
d) None of the Mentioned

36. A ___________ normal form normalization will be needed where all attributes
in a relation tuple are not functionally dependent only on the key attribute.
a) First
b) Second
c) Third
d) Fourth

37. Identify the criteria for designing database from the point of view of user
a) No redundancy
b) No inapplicable attributes
c) Uniformity in naming & definitions of the data items
d) All of the Mentioned

38. The relational model is based on the concept that data is organized and stored
in two-dimensional tables called _____________
a) Fields
b) Records
c) Relations
d) Keys

39. An aggregation association is drawn using which symbol:

a) a line which loops back onto the same table
b) small closed diamond at the end of a line connecting two tables
c) small open diamond at the end of a line connecting two tables
d) small triangle at the end of a line connecting the aggregated item and multiple
component items

40. An n-array relationship is drawn using which symbol:

a) A diamond
b) A line with arrows showing direction
c) A line without arrows showing direction
d) A rectangle

41. Find the ID, name, dept name, salary for instructors whose salary is greater
than $80,000 .
a) {t | t ε instructor ∧ t[salary] > 80000}
b) Э t ∈ r (Q(t))
c) {t | Э s ε instructor (t[ID] = s[ID]∧ s[salary] > 80000)}
d) None of the mentioned

42. A query in the tuple relational calculus is expressed as:

a) {t | P() | t}
b) {P(t) | t }
c) {t | P(t)}
d) All of the mentioned

43.{t | Э s ε instructor (t[name] = s[name]

∧ Э u ε department (u[dept name] = s[dept name]
∧ u[building] = “Watson”))}
Which of the following best describes the query?
a) Finds the names of all instructors whose department is in the Watson building
b) Finds the names of all department is in the Watson building
c) Finds the name of the dapartment whose instructor and building is Watson
d) Returns the building name of all the departments
44. Which of the following symbol is used in the place of except?
a) ^
b) V
c) ¬
d) ~

45. “Find all students who have taken all courses offered in the Biology
department.” The expressions that matches this sentence is :
a) Э t ε r (Q(t))
b) ∀ t ε r (Q(t))
c) ¬ t ε r (Q(t))
d) ~ t ε r (Q(t))

46. Which of the following is the comparison operator in tuple relational calculus
a) ⇒
b) =
c) ε
d) All of the mentioned

47. An expression in the domain relational calculus is of the form

a) {P(x1, x2, . . . , xn) | < x1, x2, . . . , xn > }
b) {x1, x2, . . . , xn | < x1, x2, . . . , xn > }
c) { x1, x2, . . . , xn | x1, x2, . . . , xn}
d) {< x1, x2, . . . , xn > | P(x1, x2, . . . , xn)}

48. Find the names of all instructors in the Physics department together with the
course id of all courses they teach:
a){< c > | Э s (< c, a, s, y, b, r, t >ε section
∧ s = “Fall” ∧ y = “2009”
∨ Эu (< c, a, s, y, b, r, t >ε section
∧ s = “Spring” ∧ y = “2010”
b) {< n, c > | Э i, a (< i, c, a, s, y > ε teaches
∧ Э d, s (< i, n, d, s > ε instructor ∧ d = “Physics”))}
c) {< n > | Э i, d, s (< i, n, d, s > ε instructor ∧ s > 80000)}
d) {< i, n, d, s > | < i, n, d, s > ε instructor ∧ s > 80000}
49. In domain relaional calculus “there exist” can be expressed as
a) (P1(x))
b) (P1(x)) Э x
c) V x (P1(x))
d) Э x (P1(x))

50. A set of possible data values is called

a) Attribute
b) Degree
c) Tuple
d) Domain