Objective Questions on Relational Algebra with Answer set-1


1. Which of the following relational algebra operations do not require the participating tables to be union-compatible?

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


3) Tree structures are used to store data in

A. Network model

B. Relational model

C. Hierarchical model

D. File based system


4) The rule that a value of a foreign key must appear as a value of some specific table is called a

A. Referential constraint

B. Index

C. Integrity constraint

D. Functional dependency


5) It is an abstraction through which relationships are treated as higher level entities.

A. Generalization

B. Specialization

C. Aggregation

D. Inheritance


6) The operation which is not considered a basic operation of relational algebra is

A. Join

B. Selection

C. Union

D. Cross product


7) In SQL the statement select*from R,S is equivalent to

A. Select * from R natural join S

B. Select * from R cross join S

C. Select * from R union join S

D. Select * from R inner join S


8) When an E-R diagram is mapped to tables, the representation is redundant for

A. Weak entity sets

B. weak relationship sets

C. Strong entity sets

D. strong relationship sets


9) If two relations R and S are joined, then the non matching ruples of both R and S are ignored in

A. left outer join

B. right outer join

C. full outer join

D. inner join


10) Relational Algebra is

A. Data Definition Language

B. Meta Language

C. Procedural query Language

D. None of the above



11) If an entity can belong to only one lower level entity then the constraint is

A. disjoint

B. partial

C. overlapping

D. single


12) The common column is eliminated in

A. theta join

B. outer join

C. natural join

D. composed join


13) In E-R diagram total participation is represented by

A. double lines

B. Dashed lines

C. single line

D. Triangle


14) Relationships among relationships can be represented in an E-R model using

A. Aggregation

B. Association

C. Weak entity sets

D. Weak relationship sets


15) Which of the following constitutes a basic set of operations for manipulating relational data?

A. Predicate calculus

B. Relational calculus

C. Relational algebra

D. SQL


16) Relational calculus is a

A. Procedural language

B. Non-Procedural language

C. Data definition language

D. High level 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

A. rectangle

B. square

C. ellipse

D. triangle



19) In an E-R diagram an entity set is represent by a

A. rectangle

B. ellipse

C. diamond box

D. circle



20) E-R model uses this symbol to represent weak entity set?

A. Dotted rectangle

B. Diamond

C. Doubly outlined rectangle

D. None of these


Answers:

1) D.Join

2) C. Aggregation operator

3) C. Hierarchical model

4) A. Referential constraint

5) C. Aggregation

6) A. Join

7) B. Select * from R cross join S

8) B. weak relationship sets

9) D. inner join

10) C. Procedural query Language

11) B. partial

12) C. natural join

13) A. double lines

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 outlined rectangle


Related Posts:


For More Database Management System(DBMS) MCQs: Click Here

Popular posts from this blog

MCQ of Structured Query Language(SQL) With Answer Set -2

1. Which of the following query is correct for using comparison operators in SQL ? A) SELECT sname, coursename FROM studentinfo WHERE age>50 and <80; B) SELECT sname, coursename FROM studentinfo WHERE age>50 and age <80; C) SELECT sname, coursename FROM studentinfo WHERE age>50 and WHERE age<80; D) None of the above 2.How to select all data from studentinfo table starting the name from letter 'r'? A) SELECT * FROM studentinfo WHERE sname LIKE 'r%'; B) SELECT * FROM studentinfo WHERE sname LIKE '%r%'; C) SELECT * FROM studentinfo WHERE sname LIKE '%r'; D) SELECT * FROM studentinfo WHERE sname LIKE '_r%'; 3. Which of the following SQL query is correct for selecting the name of staffs from 'tblstaff' table where salary is 15,000 or 25,000? A) SELECT sname from tblstaff WHERE salary IN (15000, 25000); B) SELECT sname from tblstaff WHERE salary BETWEEN 15000 AND 25000; C) Both A and B D) None of the above 4. The SELECT
Read more

Easy Methods to Increase Your Website Speed

Website speed is the most important factor for SEO. It also affects the popularity of your site, about every 25% of the visitors of the site left that even if it is useful for them for slow loading sites. Google also decided to include website loading speed for website ranking.  You can increase your website by performing testing or analyzing your site by using different such tools and performing the actions suggested by them. The main tasks to be performed to achieve such goals are setting an expiry date or maximum age in the HTTP headers, minimizing the HTTP redirects, minimizing the amount of JavaScript need while loading the page, minimizing unnecessary JavaScript, CSS Scripts and HTML, Optimizing images and long running scripts etc.  Why Website Speed is Most Important For SEO?  Only the fast loading websites can achieve better user experience and can have the minimum exit ratio. They can only achieve their goals in their online business and marketing. Search engine crawlers also
Read more

Solved MCQ on Stack and Queue in Data Structure set-1

1) ......... form of access is used to add and remove nodes from a queue. A. LIFO, Last In First Out B. FIFO, First In First Out C. Both a and b D. None of these 2) In liked representation of stack ....... holds the elements of the stack. A. INFO fields B. TOP fields C. LINK fields D. NULL fields 3) ........ form of access is used to add remove nodes from a stack. A. LIFO B. FIFO C. Both A and B D. None of these 4) In the linked representation of the stack ......... behaves as the top pointer variable of stack. A. Stop pointer B. Begin pointer C. Start pointer D. Avail pointer 5) New nodes are added to the ......... of the queue. A. Front B. Back C. Middle D. Both A and B 6) In linked representation of stack the null pointer of the last node in the list signals .......... A. Beginning of the stack B. Bottom of the stack C. Middle of the stack D. In between some value 7) What happens when you push a new node onto a stack? A. The new node is placed at the front of the linked list B. The
Read more