A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

11. An ER Model includes
1. An ER diagram portraying entity types.
II. Attributes for each entity type
III. Relationships among . entity types.
IV. Semantic integrity constraints that reflects the business rules about data not captured in the ERdiagram.
a. I, II, III & IV
b. I & IV
c. I, II & IV
d. I & III
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).I, II, III & IV

12. Based on the cardinality ratio and participation______________associated with a relationship type, choose either the Foreign Key Design, the Cross Referencing Design or Mutual Referencing Design.
a. Entity
b. Constraints
c. Rules
d. Keys
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Constraints

13. Data Integrity control uses _______________
a. Upper and lower limits on numeric data
b. Passwords to prohibit unauthorized access to files
c. Data dictionary to keep the data
d. Data dictionary to find last access of data
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).Data dictionary to find last access of data

14. Consider the following schemas
Branch = (Branch-name, Assets, Branch-city)
Customer = (Customer-name, Bank name, Customer-city)
Borrow = (Branch~name, loannumber, customer account-number)
Deposit = (Branch-name, Accountnumber,
Customer-name, Balance)
Using relational Algebra, the Query that finds customers who have balance more than 10,000 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))
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).πcustomer-name (σbalance > 1000(Deposit))

15. Find the false statement :
a. The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999)
b. A weak relationship occurs when two relationship types are linked by either Event- Precedent sequence or Condition-Precedent sequence
c. Conceptual model is not accurate representation of "Universe of interest"
d. Ternary, Quaternary and Quintary relationships are shown through a series of application scenario's and vignette's
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).A weak relationship occurs when two relationship types are linked by either Event- Precedent sequence or Condition-Precedent sequence

16. Consider the table:

Student (stuid, name, course, marks)
Which one of the following two queries is correct to find the highest marks student in course 5 ?

Q.1. Select S.stuid From student S Where not exists  (select * from student e where e.course = '5' and e.marks ≥s.marks)

Q.2. Select s.stuid From student S Where s.marks >any (select distinct marks from student S where s.course =5)
a. Q.1
b. Q.2
c. Both Q.1 and Q.2
d. Neither Q. 1 nor Q. 2
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).Neither Q. 1 nor Q. 2

17. Armstrong (1974) proposed systematic approach to derive functional dependencies. Match the following w.r.t. functional dependencies:

a.Decomposition Rule (i)   If X →Y and Z →W then {X, Z} → {Y, W}

b. Union Rule (ii)  If X →Y an  {Y,W} → Z then {X, W} → Z

c. Composition Rule (iii) If X →Y and X →Z then X → {Y, Z}
 
d. Pseudo transitivity Rule (iv) If X →{Y,Z} and  {Y,W} → Z then X → Y and  X →Z
a. (a)-(iii),(b)-(ii),(c)-(iv),(d)-(i)
b. (a)-(i),(b)-(iii),(c)-(iv),(d)-(ii)
c. (a)-(ii),(b)-(i),(c)-(iii),(d)-(iv)
d. (a)-(iv),(b)-(iii),(c)-(i),(d)-(ii)
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).(a)-(iv),(b)-(iii),(c)-(i),(d)-(ii)

18. Match the following:
List - I                                         List - II

a. Secondary                          i.    Functional Dependency
Index

b. Nonprocedural                  ii.  B-Tree
Query
Language

c. Closure of                           iii. Relational Algebraic
set of                                                Operation
Attributes

d.  Natural                              iv. Domain Calculus
JOIN
a. (a)-(i),(b)-(ii),(c)-(iv),(d)-(iii)
b. (a)-(ii),(b)-(i),(c)-(iv),(d)-(iii)
c. (a)-(i),(b)-(ii),(c)-(iv),(d)-(iii)
d. (a)-(ii),(b)-(vi),(c)-(iii),(d)-(i)
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).(a)-(ii),(b)-(vi),(c)-(iii),(d)-(i)

19. The best normal form of relation scheme R(A. B, C, D) along with the set of functional dependencies F = {AB → C, AB → D, C → A, D → B} is
a. Boyce-Codd Normal form
b. Third Normal form
c. Second Normal form
d. First Normal form
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Second Normal form

20. Identify the minimal key for relational scheme R(A, B, C, D, E) with functional dependencies F = {A → B, B → C, AC → D}
a. A
b. AE
c. BE
d. CE
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).AE

Page 2 of 23