Question 1
Six files F1, F2, F3, F4, F5 and F6 have 100, 200, 50, 80, 120, 150 records respectively. In what order should they be stored so as to optimize act. Assume each file is accessed with the same frequency
F3, F4, F1, F5, F6, F2
F2, F6, F5, F1, F4, F3
F1, F2, F3, F4, F5, F6
Ordering is immaterial as all files are accessed with the same frequency.
Question 2
Every time the attribute A appears, it is matched with the same value of attribute B but not the same value of attribute C. Which of the following is true?
A-> (B,C)
A ->B, A->>C
A->B, C->>A
A->>B, B->C
Question 3
Consider the following schema :
Sailors (sid, sname, rating, age)
Boats (bid, bname, colour)
Reserves (sid, bid, day)
Two boats can have the same name but the colour differentiates them. The two relations
ρ (Tempsids, (Ⲡ sid, bid Reserves)/(Ⲡ bid ( σ bname ='Ganga' Boats))),
Ⲡ sname (Tempsids ⋈ Sailors)
If / is division operation, the above set of relations represents the query
Names of sailors who have reserved all boats called Ganga
Names of sailors who have not reserved any Gangaboat
Names of sailors who have reserved at least one Gangaboat
Names of sailors who have reserved at most one Ganga boat
Question 4
Which symbol denote derived attributes in ER Model?
Double ellipse
Dashed ellipse
Squared ellipse
Ellipse with attribute name underlined
Question 5
Consider the join of a relation R , with a relation S . If R has m number of tuples and S has n number of tuples then the maximum and minimum sizes of the join respectively are:
m + n & 0
mn & 0
m + n & | m - n |
mn & m + n
Question 6
Let R(a, b, c) and S(d, e, f) be two relations in which d is the foreign key of S that refers to the primary key of R. Consider the following four operations R and S. I. Insert into R II. Insert into S III. Delete from R IV. Delete from S Which of the following can cause violation of the referential integrity constraint above?
Both I and IV
Both II and III
All of these
None of these
Question 7
Goals for the design of the logical scheme include
avoiding data inconsistency
being able to construct query easily
being able to access data efficiently
All of the above
Question 8
Consider the following Relationship Entity Diagram(ERD)
Which of the following possible relations will not hold if the above ERD is mapped into a relation model?
Person (NID, Name)
Qualification (NID, ExamID, QualifiedDate)
Exam (ExamID, NID, ExamName)
Exam (ExamID, ExamName)
Question 9
If D1, D2...Dn are domains in a relational model, then the relation is a table, which is a subset of
D1⊕D2⊕...⊕Dn
D1xD2x...xDn
D1∪D2∪...∪Dn
D1∩D2∩...∩Dn
Question 10
An aggregation association is drawn using which symbol?
A line which loops back on to the same table
A small open diamond at the end of a line connecting two tables
A small closed diamond at the end of a line connecting two tables
A small closed triangle at the end of a line connecting two tables
There are 58 questions to complete.