This is an example of what type of relationship question 13 options ternary binary unary weak


1. Which of the subsequent relational algebra operations do not require the choices participating tables to be union-like minded? A. Union B. Intersection C. Difference D. Join

2) Relational Algebra does not have A. Selection operator B. Projection operator C. Aggregation operator D. Division operator

three) Tree structures are used to shop facts in A. Network model B. Relational model C. Hierarchical version D. File-based gadget

4) The rule that a value of a foreign key need to appear as a value of a few precise desk is called a A. Referential constraint B. Index C. Integrity constraint D. Functional

five) It is an abstraction via which relationships are treated as higher-stage entities. A. Generalization B. Specialization C. Aggregation D. Inheritance

6) The operation which is not considered a primary operation of relational algebra is A. Join B. Selection C. Union D. Cross product

7) In SQL the assertion pick*from R,S is equivalent to A. Select * from R herbal be part of S B. Select * from R cross be part of S C. Select * from R union be part of S D. Select * from R internal be a part of S

8) When an E-R diagram is mapped to tables, the representation is redundant for A. Weak entity units B. vulnerable courting units C. Strong entity sets D. robust dating sets

nine) If relations R and S are joined, then the choices non-matching tuples of both R and S are neglected in A. left outer be part of B. right outer be a part of C. full outer join D. internal be a part of

10) Relational Algebra is A. Data Definition Language B. Meta Language C. Procedural query Language D. None of the above

eleven) If an entity can belong to handiest one decrease stage entity then the choices constraint is A. disjoint B. partial C. overlapping D. unmarried

12) The commonplace column is eliminated in A. theta join B. outer be a part of C. natural join D. composed be part of

thirteen) In E-R diagram overall participation is represented with the aid of A. double strains B. Dashed strains C. single line D. Triangle

14) Relationships amongst relationships may be represented in an E-R model the usage of A. Aggregation B. Association C. Weak entity sets D. Weak courting units

15) Which of the subsequent constitutes a primary set of operations for manipulating relational records? A. Predicate calculus B. Relational calculus C. Relational algebra D. SQL

sixteen) Relational calculus is a A. Procedural language B. Non-Procedural language C. Data definition language D. High stage language

17) Cartesian product in relational algebra is A. a Unary operator B. a Binary operator C. a Ternary operator D. not defined

18) In an E-R diagram attributes are represented by way of A. rectangle B. square C. ellipse D. triangle

19) In an E-R diagram, an entity set is represented through a A. rectangle B. ellipse C. diamond field D. circle

20) E-R model uses this image to represent the choices susceptible entity set? A. Dotted rectangle B. Diamond C. Doubly mentioned rectangle D. None of these

1) D.Join 2) C. Aggregation operator 3) C. Hierarchical version 4) A. Referential constraint 5) C. Aggregation 6) A. Join 7) B. Select * from R pass be part of S eight) B. weak relationship sets nine) D. inner be part of 10) C. Procedural question Language eleven) B. partial 12) C. herbal join 13) A. double traces 14) A. Aggregation 15) C. Relational algebra 16) B. Non-Procedural language 17) B. a Binary operator 18) C. ellipse 19) A. rectangle 20) C. Doubly mentioned rectangle

Shuseel Baral is an internet programmer and the founding father of InfoTechSite has over eight years of enjoy in software improvement, net, search engine optimization, blogging and marketing virtual services and products is enthusiastic about exceeding your expectancies.

Objective Questions on SQL and Embedded SQL set-4