In RDBMS, Data is presented as a collection of ............ A) Table B) Attributes C) Relations D) Entities

In RDBMS, Data is presented as a collection of ............
A) Table
B) Attributes
C) Relations
D) Entities
by

1 Answer

Answer :

C) Relations
by

Related questions

Which of the following statements is FALSE about weak entity set ? (A) Weak entities can be deleted automatically when their strong entity is deleted. (B) Weak entity set avoids the data duplication and consequent possible inconsistencies caused by duplicating the key of the strong entity. (C) A weak entity set has no primary keys unless attributes of the strong entity set on which it depends are included. (D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Description : Which of the following statements is FALSE about weak entity set ? (A) Weak entities can be deleted automatically when their strong entity is deleted. (B) Weak entity set avoids the data ... weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Last Answer : (D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

A ………………. Does not have a distinguishing attribute if its own and mostly are dependent entities, which are part of some another entity. A) Weak entity B) Strong entity C) Non attributes entity D) Dependent entity

Description : A ………………. Does not have a distinguishing attribute if its own and mostly are dependent entities, which are part of some another entity. A) Weak entity B) Strong entity C) Non attributes entity D) Dependent entity

Last Answer : A) Weak entity

Let E1 and E2 be two entities in E-R diagram with simple single valued attributes. R1 and R2 are two relationships between E1 and E2 where R1 is one-many and R2 is many-many. R1 and R2 do not have any attributes of their own. How many minimum number of tables are required to represent this situation in the Relational Model? (A) 4 (B) 3 (C) 2 (D) 1

Description : Let E1 and E2 be two entities in E-R diagram with simple single valued attributes. R1 and R2 are two relationships between E1 and E2 where R1 is one-many and R2 is many-many. R1 and R2 do not have any ... are required to represent this situation in the Relational Model? (A) 4 (B) 3 (C) 2 (D) 1

Last Answer : (B) 3 

Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationship between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to represent M, N, R1 and R2 in the relational model are .......... (1) 4 (2) 6 (3) 7 (4) 3

Description : Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationship between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to ... and R2 in the relational model are .......... (1) 4 (2) 6 (3) 7 (4) 3

Last Answer : Answer: 4

In mapping of ERD to DFD a) entities in ERD should correspond to an existing entity/store in DFD b) entity in DFD is converted to attributes of an entity in ERD c) relations in ERD has 1 to 1 correspondence to processes in DFD d) relationships in ERD has 1 to 1 correspondence to flows in DFD

Description : In mapping of ERD to DFD a) entities in ERD should correspond to an existing entity/store in DFD b) entity in DFD is converted to attributes of an entity in ERD c) relations in ERD has 1 to 1 correspondence to processes in DFD d) relationships in ERD has 1 to 1 correspondence to flows in DFD

Last Answer : a) entities in ERD should correspond to an existing entity/store in DFD

In a relational model, relations are termed as (A) Tuples. (B) Attributes (C) Tables. (D) Rows.

Description : In a relational model, relations are termed as (A) Tuples. (B) Attributes (C) Tables. (D) Rows.

Last Answer : (C) Tables

The one guideline to be followed while designing the database is A) A database design may be ambiguous. B) Unrelated data should be in the same table so that updating the data will be easy. C) It should avoid/reduce the redundancy. D) An entity should not have attributes.

Description : The one guideline to be followed while designing the database is A) A database design may be ambiguous. B) Unrelated data should be in the same table so that updating the data will be easy. C) It should avoid/reduce the redundancy. D) An entity should not have attributes.

Last Answer : C) It should avoid/reduce the redundancy.

External Entities may be a A) Source of input data only B) Source of input data or destination of results C) Destination of results only D) Repository of data

Description : External Entities may be a A) Source of input data only B) Source of input data or destination of results C) Destination of results only D) Repository of data

Last Answer : B) Source of input data or destination of results

The RDBMS terminology for a row is (A) tuple. (B) relation. (C) attribute. (D) degree.

Description : The RDBMS terminology for a row is (A) tuple. (B) relation. (C) attribute. (D) degree.

Last Answer : (A) tuple

In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as: (A) Referential integrity (B) Multi-valued dependency (C) Entity Integrity (D) Functional dependency

Description : In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as: (A) Referential integrity (B) Multi-valued dependency (C) Entity Integrity (D) Functional dependency

Last Answer : (C) Entity Integrity

Which one is correct w.r.t. RDBMS? (1) primary key ⊆ super key ⊆ candidate key (2) primary key ⊆ candidate key ⊆ super key (3) super key ⊆ candidate key ⊆ primary key (4) super key ⊆ primary key ⊆ candidate key

Description : Which one is correct w.r.t. RDBMS? (1) primary key ⊆ super key ⊆ candidate key (2) primary key ⊆ candidate key ⊆ super key (3) super key ⊆ candidate key ⊆ primary key (4) super key ⊆ primary key ⊆ candidate key

Last Answer : Answer: 2

Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: Image I: {B} II: {B, C} III: {A, D} IV: {C, D} If different symbols stand for different values in the table (e.g., d1 is definitely not equal to d2), then which of the above could not be the candidate key for the database table? (A) I and III only (B) III and IV only (C) II only (D) I only

Description : Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: I: {B} II: {B, C} III: {A, D} IV: {C, D} If ... the database table? (A) I and III only (B) III and IV only (C) II only (D) I only

Last Answer : (C) II only

Consider a database table R with attributes A and B. Which of the following SQL queries is illegal ? (A) SELECT A FROM R; (B) SELECT A, COUNT(*) FROM R; (C) SELECT A, COUNT(*) FROM R GROUP BY A; (D) SELECT A, B, COUNT(*) FROM R GROUP BY A, B;

Description : Consider a database table R with attributes A and B. Which of the following SQL queries is illegal ? (A) SELECT A FROM R; (B) SELECT A, COUNT(*) FROM R; (C) SELECT A, COUNT(*) FROM R GROUP BY A; (D) SELECT A, B, COUNT(*) FROM R GROUP BY A, B;

Last Answer : (B) SELECT A, COUNT(*) FROM R;

Data is stored in RDBMS in the form of (a) table (b) query -Technology

Description : Data is stored in RDBMS in the form of (a) table (b) query -Technology

Last Answer : (a) Relational Database Management System stores data in the form of relation. As we know, relations are known as table.

Consider the relations R(A,B) and S(B,C) and the following four relational algebra queries over R and S: I. πA,B(R⋈S) II. R⋈πB(S) III. R∩(πA(R) Χ πB(S)) IV. πA,R.B(R Χ S) where R.B refers to the column B in table R. One can determine that: (A) I, III and IV are the same query. (B) II, III and IV are the same query. (C) I, II and IV are the same query. (D) I, III and III are the same query.

Description : Consider the relations R(A,B) and S(B,C) and the following four relational algebra queries over R and S: I. πA,B(R⋈S) II. R⋈πB(S) III. R∩(πA(R) Χ πB(S)) IV. πA,R.B(R Χ S) where R.B refers to ... IV are the same query. (C) I, II and IV are the same query. (D) I, III and III are the same query.

Last Answer : (D) I, III and III are the same query.

In a DFD external entities are represented by a A) Rectangle B) Ellipse C) Diamond shaped box D) Circle

Description : In a DFD external entities are represented by a A) Rectangle B) Ellipse C) Diamond shaped box D) Circle

Last Answer : A) Rectangle

What is a relationship called when it is maintained between two entities? (A) Unary (B) Binary (C) Ternary (D) Quaternary

Description : What is a relationship called when it is maintained between two entities? (A) Unary (B) Binary (C) Ternary (D) Quaternary

Last Answer : (B) Binary

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 above

Description : 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 above

Last Answer : D) All of the above

An ER Model includes I. 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 ER diagram. (A) I, II, III & IV (B) I&IV (C) I, II & IV (D) I & III

Description : An ER Model includes I. 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 ... ; IV (B) I&IV (C) I, II & IV (D) I & III

Last Answer : (A) I, II, III & IV

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n

Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n

Last Answer : (A) less than 1

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than ................... (1) 1 (2) 1/n (3) 1/m (4) n/m

Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than ................... (1) 1 (2) 1/n (3) 1/m (4) n/m

Last Answer : Answer: 1

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

Description : 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

Last Answer : C) Relations

…………… can be defined as data that has been processed into a form that is meaningful to the recipient and is of real or perceived value in current or prospective decisions. A) Information B) Data collection C) Internal data D) Sample data

Description : …………… can be defined as data that has been processed into a form that is meaningful to the recipient and is of real or perceived value in current or prospective decisions. A) Information B) Data collection C) Internal data D) Sample data

Last Answer : A) Information

Images tend to be very large collection of data. The size of memory required for a 1024 by 1024 image in which the colour of each pixel is represented by a n-bit number, (in an 8 bit machines) is (A) n × 8 MB (B) n / 8 MB (C) (1024 × 1024) / 8 MB (D) 1024 MB

Description : Images tend to be very large collection of data. The size of memory required for a 1024 by 1024 image in which the colour of each pixel is represented by a n-bit number, (in an 8 bit machines) is (A) n × 8 MB (B) n / 8 MB (C) (1024 × 1024) / 8 MB (D) 1024 MB

Last Answer : (B) n / 8 MB

Superficially the term “object-oriented”, means that, we organize software as a (A) collection of continuous objects that incorporates both data structure and behaviour. (B) collection of discrete objects that incorporates both discrete structure and behaviour. (C) collection of discrete objects that incorporates both data structure and behaviour. (D) collection of objects that incorporates both discrete data structure and behaviour.

Description : Superficially the term object-oriented , means that, we organize software as a (A) collection of continuous objects that incorporates both data structure and behaviour. (B) collection of ... and behaviour. (D) collection of objects that incorporates both discrete data structure and behaviour.

Last Answer : (C) collection of discrete objects that incorporates both data structure and behaviour.

Given the following statements: (a) Strategic value of data mining is time stamping (b) Information collection is an expensive process in building an expert system. Which of the following options is correct ? (A) Both (a) and (b) are false (B) Both (a) and (b) are true (C) (a) is true, (b) is false (D) (a) is false, (b) is true

Description : Given the following statements: (a) Strategic value of data mining is time stamping (b) Information collection is an expensive process in building an expert system. Which of the following options is correct ? (A) Both (a) and (b) ... true (C) (a) is true, (b) is false (D) (a) is false, (b) is true

Last Answer :  (B) Both (a) and (b) are true

................. is subject oriented, integrated, time variant, non-volatile collection of data in support of management decisions. (A) Data mining (B) Web mining (C) Data warehouse (D) Database Management System

Description : ................. is subject oriented, integrated, time variant, non-volatile collection of data in support of management decisions. (A) Data mining (B) Web mining (C) Data warehouse (D) Database Management System

Last Answer : (C) Data warehouse

Which of the following commands is used to display the directory attributes rather than its contents? A. ls -l -d B. ls -l C. ls -x D. ls -F E. None of the above

Description : Which of the following commands is used to display the directory attributes rather than its contents? A. ls -l -d B. ls -l C. ls -x D. ls -F E. None of the above

Last Answer : A. ls -l -d

………………….. operator is basically a join followed by a project on the attributes of first relation. A) Join B) Semi-Join C) Full Join D) Inner Join

Description : ………………….. operator is basically a join followed by a project on the attributes of first relation. A) Join B) Semi-Join C) Full Join D) Inner Join

Last Answer : B) Semi-Join

Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Description : Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Last Answer : C) i-False, ii-True

............. is a combination of two of more attributes used as a primary key A) Composite Key B) Alternate Key C) Candidate Key D) Foreign Key

Description : ............. is a combination of two of more attributes used as a primary key A) Composite Key B) Alternate Key C) Candidate Key D) Foreign Key

Last Answer : A) Composite Key

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

Description : 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

Last Answer : C) Third

In the ........... normal form, a composite attribute is converted to individual attributes. A) First B) Second C) Third D) Fourth

Description : In the ........... normal form, a composite attribute is converted to individual attributes. A) First B) Second C) Third D) Fourth

Last Answer : A) First

The number of attributes in relation is called as its ..................... A) Cardinality B) Degree C) Tuples D) Entity

Description : The number of attributes in relation is called as its ..................... A) Cardinality B) Degree C) Tuples D) Entity

Last Answer : B) Degree

The main task carried out in the …………… is to remove repeating attributes to separate tables. A) First Normal Form B) Second Normal Form C) Third Normal Form D) Fourth Normal Form

Description : The main task carried out in the …………… is to remove repeating attributes to separate tables. A) First Normal Form B) Second Normal Form C) Third Normal Form D) Fourth Normal Form

Last Answer : D) Fourth Normal Form

The number of tuples in a relation is called its …………. While the number of attributes in a relation is called it’s ……………….. A) Degree, Cardinality B) Cardinality, Degree C) Rows, Columns

Description : The number of tuples in a relation is called its …………. While the number of attributes in a relation is called it’s ……………….. A) Degree, Cardinality B) Cardinality, Degree C) Rows, Columns

Last Answer : B) Cardinality, Degree

_____ produces the relation that has attributes of R1 and R2 (A) Cartesian product (B) Difference (C) Intersection (D) Product

Description : _____ produces the relation that has attributes of R1 and R2 (A) Cartesian product (B) Difference (C) Intersection (D) Product

Last Answer : A) Cartesian product

In the relational modes, cardinality is termed as: (A) Number of tuples. (B) Number of attributes. (C) Number of tables. (D) Number of constraints

Description : In the relational modes, cardinality is termed as: (A) Number of tuples. (B) Number of attributes. (C) Number of tables. (D) Number of constraints

Last Answer : (A) Number of tuples

Which one of the following set of attributes should not be encompassed by effective software metrics ? (A) Simple and computable (B) Consistent and objective (C) Consistent in the use of units and dimensions (D) Programming language dependent

Description : Which one of the following set of attributes should not be encompassed by effective software metrics ? (A) Simple and computable (B) Consistent and objective (C) Consistent in the use of units and dimensions (D) Programming language dependent

Last Answer : (D) Programming language dependent

What kind of mechanism is to be taken into account for converting a weak entity set into strong entity set in entity-relationship diagram ? (A) Generalization (B) Aggregation (C) Specialization (D) Adding suitable attributes

Description : What kind of mechanism is to be taken into account for converting a weak entity set into strong entity set in entity-relationship diagram ? (A) Generalization (B) Aggregation (C) Specialization (D) Adding suitable attributes

Last Answer : (D) Adding suitable attributes

Select the ‘False’ statement from the following statements about Normal Forms: (A) Lossless preserving decomposition into 3NF is always possible (B) Lossless preserving decomposition into BCNF is always possible (C) Any relation with two attributes is in BCNF (D) BCNF is stronger than 3NF

Description : Select the ‘False’ statement from the following statements about Normal Forms: (A) Lossless preserving decomposition into 3NF is always possible (B) Lossless preserving decomposition into BCNF is always possible (C) Any relation with two attributes is in BCNF (D) BCNF is stronger than 3NF

Last Answer : (B) Lossless preserving decomposition into BCNF is always possible

Which one of the following non-functional quality attributes is not highly affected by the architecture of the software ? (A) Performance (B) Reliability (C) Usability (D) Portability

Description : Which one of the following non-functional quality attributes is not highly affected by the architecture of the software ? (A) Performance (B) Reliability (C) Usability (D) Portability

Last Answer : (C) Usability

Semi-join strategies are techniques for query processing in distributed database system. Which of the following is a semi-join technique? (A) Only the joining attributes are sent from one site to another and then all of the rows are returned. (B) All of the attributes are sent from one site to another and then only the required rows are returned. (C) Only the joining attributes are sent from one site to another and then only the required rows are returned. (D) All of the attributes are sent from one site to another and then only the required rows are returned.

Description : Semi-join strategies are techniques for query processing in distributed database system. Which of the following is a semi-join technique? (A) Only the joining attributes are sent from one site to ... the attributes are sent from one site to another and then only the required rows are returned.

Last Answer : (C) Only the joining attributes are sent from one site to another and then only the required rows are returned.

RDBMS provides relational operators to manipulate the data. Here, RDBMS refers to (a) Record Database Management System -Technology

Description : RDBMS provides relational operators to manipulate the data. Here, RDBMS refers to (a) Record Database Management System -Technology

Last Answer : (b) RDBMS stands for Relational Database Management System, which provides the operator to manipulate the data stored in the database table.

RDBMS means: a) Relational Data Base Management System b) Reliable Data Base Management System c) Relational Document Base Management System d) None of These

Description : RDBMS means: a) Relational Data Base Management System b) Reliable Data Base Management System c) Relational Document Base Management System d) None of These

Last Answer : a) Relational Data Base Management System

RDBMS means: a) Relational Data Base Management System b) Reliable Data Base Management System c) Relational Document Base Management System d) None of These

Description : RDBMS means: a) Relational Data Base Management System b) Reliable Data Base Management System c) Relational Document Base Management System d) None of These

Last Answer : a) Relational Data Base Management System

Which part of the RDBMS takes care of the data dictionary?

Description : Which part of the RDBMS takes care of the data dictionary?

Last Answer : Data dictionary is a set of tables and database objects that is stored in a special area of the database and maintained exclusively by the kernel.

. ………………… is a special type of integrity constraint that relates two relations & maintains consistency across the relations. A) Entity Integrity Constraints B) Referential Integrity Constraints

Description : . ………………… is a special type of integrity constraint that relates two relations & maintains consistency across the relations. A) Entity Integrity Constraints B) Referential Integrity Constraints

Last Answer : B) Referential Integrity

The ............ operator preserves unmatched rows of the relations being joined. A) Inner join B) Outer join C) Union D) Union join

Description : The ............ operator preserves unmatched rows of the relations being joined. A) Inner join B) Outer join C) Union D) Union join

Last Answer : B) Outer join

In a relational schema, each tuple is divided into fields called A) Relations B) Domains C) Queries D) All of the above

Description : In a relational schema, each tuple is divided into fields called A) Relations B) Domains C) Queries D) All of the above

Last Answer : B) Domains