A top-to-bottom relationship among the items in a database is established by a A) Hierarchical schema B) Network schema C) Relational Schema D) All of the above

A top-to-bottom relationship among the items in a database is established by a  A) Hierarchical schema
B) Network schema
C) Relational Schema
D) All of the above
by

1 Answer

Answer :

A) Hierarchical schema
by

Related questions

Which of the following is not a type of Database Management System? (A) Hierarchical (B) Network (C) Relational (D) Sequential

Description : Which of the following is not a type of Database Management System? (A) Hierarchical (B) Network (C) Relational (D) Sequential 

Last Answer : (D) Sequential

Relational database schema normalization is NOT for: (A) reducing the number of joins required to satisfy a query. (B) eliminating uncontrolled redundancy of data stored in the database. (C) eliminating number of anomalies that could otherwise occur with inserts and deletes. (D) ensuring that functional dependencies are enforced.

Description : Relational database schema normalization is NOT for: (A) reducing the number of joins required to satisfy a query. (B) eliminating uncontrolled redundancy of data stored in the database. (C) ... could otherwise occur with inserts and deletes. (D) ensuring that functional dependencies are enforced. 

Last Answer : reducing the number of joins required to satisfy a query.

A Network Schema (A) restricts to one to many relationship (B) permits many to many relationship (C) stores Data in a Database (D) stores Data in a Relation

Description : A Network Schema (A) restricts to one to many relationship (B) permits many to many relationship (C) stores Data in a Database (D) stores Data in a Relation

Last Answer : (B) permits many to many relationship

The database in which records are organised in a tree-like structure is (1) Network database (2) Hierarchical database (3) Relational database (4) Object-oriented database

Description : The database in which records are organised in a tree-like structure is (1) Network database (2) Hierarchical database (3) Relational database (4) Object-oriented database

Last Answer : Hierarchical database

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

Which of the following is not a logical database structure? A) Chain B) Network C) Tree D) Relational

Description : Which of the following is not a logical database structure? A) Chain B) Network C) Tree D) Relational

Last Answer : A) Chain

Anything that affects the database schema is a part of A) DML B) DCL C) DDL D) All of the above

Description : Anything that affects the database schema is a part of A) DML B) DCL C) DDL D) All of the above

Last Answer : D) All of the above

A logical schema A) is the entire database B) is a standard way of organizing information into accessible parts. C) Describes how data is actually stored on disk. D) All of the above

Description : A logical schema A) is the entire database B) is a standard way of organizing information into accessible parts. C) Describes how data is actually stored on disk. D) All of the above

Last Answer : B) is a standard way of organizing information into accessible parts.

The database schema is written in (A) HLL (B) DML (C) DDL (D) DCL

Description : The database schema is written in (A) HLL (B) DML (C) DDL (D) DCL

Last Answer : (C) DDL

Consider the following two commands C1 and C2 on the relation R from an SQL database: C1: drop table R; C2: delete from R; Which of the following statements is TRUE? I. Both C1 and C2 delete the schema for R. II. C2 retains relation R, but deletes all tuples in R. III. C1 deletes not only all tuples of R, but also the schema for R. (A) I only (B) I and II only (C) II and III only (D) I, II and III

Description : Consider the following two commands C1 and C2 on the relation R from an SQL database:  C1: drop table R; C2: delete from R; Which of the following statements is TRUE? I. Both C1 and C2 delete the schema for R. II. C2 ... R. (A) I only (B) I and II only (C) II and III only (D) I, II and III

Last Answer : (C) II and III only

DBMS provides the facility of accessing data from a database through (A) DDL (B) DML (C) DBA (D) Schema

Description : DBMS provides the facility of accessing data from a database through (A) DDL (B) DML (C) DBA (D) Schema 

Last Answer : (B) DML

. A _____ DBMS distributesdata processing tasks between the workstation anda network server. A. Network B. Relational C. Client Server D. Hierarchical E. None of the above

Description : . A _____ DBMS distributesdata processing tasks between the workstation anda network server. A. Network B. Relational C. Client Server D. Hierarchical E. None of the above

Last Answer : Client Server

A relational database developer refers to a record as (A) a criteria. (B) a relation. (C) a tuple. (D) an attribute.

Description : A relational database developer refers to a record as (A) a criteria. (B) a relation. (C) a tuple. (D) an attribute.

Last Answer : C) a tuple

Which of the following statements concerning Object-Oriented databases is FALSE? (A) Objects in an object-oriented database contain not only data but also methods for processing the data. (B) Object-oriented databases store computational instructions in the same place as the data. (C) Object-oriented databases are more adapt at handling structures (analytical) data than relational databases. (D) Object-oriented databases store more types of data than relational databases and access that data faster.

Description : Which of the following statements concerning Object-Oriented databases is FALSE? (A) Objects in an object-oriented database contain not only data but also methods for processing the data. (B ... Object-oriented databases store more types of data than relational databases and access that data faster.

Last Answer : (C) Object-oriented databases are more adapt at handling structures (analytical) data than relational databases.

In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To avoid confusion with actual legitimate data values like 0 (zero) for integer columns and ‘’ (the empty string) for string columns. (C) To leave columns in a tuple marked as “unknown” when the actual value is unknown. (D) To fill a column in a tuple when that column does not really “exist” for that particular tuple.

Description : In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To ... D) To fill a column in a tuple when that column does not really exist for that particular tuple.

Last Answer : (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL.

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

Differentiate between Hierarchical Database model and network database model.

Description : Differentiate between Hierarchical Database model and network database model.

Last Answer : Hierarchical Database Model  Network Model Network Model represents tree like structure with one root. Network Model represents tree like structure with many roots. Reflects 1:N ( ... the use of pointers Record relationship implementation is complex due to the use of pointers

How are relationship between tables expressed in a relational database?

Description : How are relationship between tables expressed in a relational database?

Last Answer : Tables are the basic building blocks of a relationaldatabase.

Which of the following describes a relational database? 1) It provides a relationship between integers 2) It consists of separate tables or related data 3) It retrieves data related to its queries 4) It provides a relationship between floats

Description : Which of the following describes a relational database? 1) It provides a relationship between integers 2) It consists of separate tables or related data 3) It retrieves data related to its queries 4) It provides a relationship between floats

Last Answer : 2) It consists of separate tables or related data

Distinguish between network database model and relational database model.

Description : Distinguish between network database model and relational database model. 

Last Answer : Network database model Relational database model Relationship between records is expressed in the form of pointers or links Relationship between records is represented by a relation that contains a key for ... logically in the form of rows and columns. Example:  Example: 

GO BOTTOM and SKIP-3 commands are given one after another in a database file of 30 records. It shifts the control to (A) 28th record (B) 27th record (C) 3rd record (D) 4th record

Description : GO BOTTOM and SKIP-3 commands are given one after another in a database file of 30 records. It shifts the control to (A) 28th record (B) 27th record (C) 3rd record (D) 4th record

Last Answer : (B) 27th record

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

.......... is a special type of programming language used to provide instructions to the monitor simple batch processing schema. A) Job control language (JCL) B) Processing control language (PCL) C) Batch control language (BCL)

Description : .......... is a special type of programming language used to provide instructions to the monitor simple batch processing schema. A) Job control language (JCL) B) Processing control language (PCL) C) Batch control language (BCL)

Last Answer : A) Job control language (JCL)

……………. Allows definitions and query language statements to be entered; query results are formatted and displayed. A) Schema Processor B) Query Processor C) Terminal Interface D) None of the above

Description : ……………. Allows definitions and query language statements to be entered; query results are formatted and displayed. A) Schema Processor B) Query Processor C) Terminal Interface D) None of the above

Last Answer : C) Terminal Interface

………..defines the structure of a relation which consists of a fixed set of attribute-domain pairs. A) Instance B) Schema c) Program D) Super Key

Description : ………..defines the structure of a relation which consists of a fixed set of attribute-domain pairs. A) Instance B) Schema c) Program D) Super Key

Last Answer : B) Schema

Which of the following statements is TRUE? D1: The decomposition of the schema R(A,B,C) into R1(A,B) and R2(A,C) is always lossless. D2: The decomposition of the schema R(A,B,C,D,E) having AD→B, C→DE, B→AE, AE→C into R1(A,B,D) and R2(A,C,D,E) is lossless. (A) Both D1 and D2 (B) Neither D1 and D2 (C) Only D1 (D) Only D2

Description : Which of the following statements is TRUE? D1: The decomposition of the schema R(A,B,C) into R1(A,B) and R2(A,C) is always lossless. D2: The decomposition of the schema R(A,B,C,D,E) having AD→B, C→DE, B→AE, AE→C ... ,D,E) is lossless. (A) Both D1 and D2 (B) Neither D1 and D2 (C) Only D1 (D) Only D2

Last Answer : (D) Only D2

Consider a schema R(MNPQ) and functional dependencies M→N, P→Q. Then the decomposition of R into R1(MN) and R2(PQ) is ............. (1) Dependency preserving but not lossless join. (2) Dependency preserving and lossless join (3) Lossless join but not dependency preserving (4) Neither dependency preserving nor lossless join.

Description : Consider a schema R(MNPQ) and functional dependencies M→N, P→Q. Then the decomposition of R into R1(MN) and R2(PQ) is ............. (1) Dependency preserving but not lossless ... and lossless join (3) Lossless join but not dependency preserving (4) Neither dependency preserving nor lossless join. 

Last Answer : Answer: 1

In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three layer hierarchy? (A) 10 clusters, 24 regions and 20 routers (B) 12 clusters, 20 regions and 20 routers (C) 16 clusters, 12 regions and 25 routers (D) 15 clusters, 16 regions and 20 routers

Description : In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three layer hierarchy? (A) 10 clusters, 24 regions and 20 routers (B ... (C) 16 clusters, 12 regions and 25 routers (D) 15 clusters, 16 regions and 20 routers

Last Answer : (D) 15 clusters, 16 regions and 20 routers Rooters minimum, then regions minimum, then clusters minimum.

The directory structure used in Unix file system is called (A) Hierarchical directory (B) Tree structured directory (C) Directed acyclic graph (D) Graph structured directory

Description : The directory structure used in Unix file system is called (A) Hierarchical directory (B) Tree structured directory (C) Directed acyclic graph (D) Graph structured directory

Last Answer : (C) Directed acyclic graph

In an ER model, ……………. is described in the database by storing its data. A) Entity B) Attribute C) Relationship D) Notation

Description : In an ER model, ……………. is described in the database by storing its data. A) Entity B) Attribute C) Relationship D) Notation

Last Answer : A) Entity

Can one rename a database user (schema)? (for DBA)

Description : Can one rename a database user (schema)? (for DBA)

Last Answer : No, this is listed as Enhancement Request 158508. Workaround: Do a user-level export of user A create new user B Import system/manager fromuser=A touser=B Drop user A

A logical schema A. is the entire database B. is a standard wayof organizing information into accessible parts C. describes how data is actually stored on disk D. All of theabove E. None of the above

Description : A logical schema A. is the entire database B. is a standard wayof organizing information into accessible parts C. describes how data is actually stored on disk D. All of theabove E. None of the above

Last Answer : is a standard wayof organizing information into accessible parts

How do you collect statistics for a table, schema and Database?

Description : How do you collect statistics for a table, schema and Database?

Last Answer : Using DBMS_STATS package to gather Oracle dictionary statistics.

Define the term Database Schema

Description : Define the term Database Schema

Last Answer : The overall design of the database is called the database schema. A schema diagram displays only names of record types (entities) and names of data items (attributes) and does not show the relationships among the various files. 

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

Which of the following is not a binary operator in relational algebra? A) Join B) Semi-Join C) Assignment D) Project

Description : Which of the following is not a binary operator in relational algebra? A) Join B) Semi-Join C) Assignment D) Project

Last Answer : D) Project

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

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

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

Last Answer : (B) a Binary operator.

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

The “PROJECT” operator of a relational algebra creates a new table that has always (A) More columns than columns in original table (B) More rows than original table (C) Same number of rows as the original table (D) Same number of columns as the original table

Description : The “PROJECT” operator of a relational algebra creates a new table that has always (A) More columns than columns in original table (B) More rows than original table (C) Same number of rows as the original table (D) Same number of columns as the original table

Last Answer : (C) Same number of rows as the original table

If D1, D2,…. Dn are domains in a relational model, then the relation is a table, which is a subset of (A) D1+D2+…. +Dn (B) D1x D2x… xDn (C) D1U D2U….UDn (D) D1- D2-….-Dn

Description : If D1, D2,…. Dn are domains in a relational model, then the relation is a table, which is a subset of (A) D1+D2+…. +Dn (B) D1x D2x… xDn (C) D1U D2U….UDn (D) D1- D2-….-Dn

Last Answer : (B) D1x D2x… xDn

Consider the following schemas: Branch = (Branch-name, Assets, Branch-city) Customer = (Customer-name, Bank-name, Customer-city) Borrow = (Branch-name, loan-number, customer account-number) Deposit = (Branch-name, Account-number, Customer-name, Balance) Using relational Algebra, the query that finds customers who have balance more than 10,000 is ................. (A) πcustomer-name(σbalance> 10000(Deposit)) (B) σcustomer-name(σbalance> 10000(Deposit)) (C) πcustomer-name(σbalance> 10000(Borrow)) (D) σcustomer-name(σbalance> 10000(Borrow))

Description : Consider the following schemas: Branch = (Branch-name, Assets, Branch-city) Customer = (Customer-name, Bank-name, Customer-city) Borrow = (Branch-name, loan-number, customer account-number) Deposit = ... )) (C) πcustomer-name(σbalance> 10000(Borrow)) (D) σcustomer-name(σbalance> 10000(Borrow))

Last Answer : (A) πcustomer-name(σbalance> 10000(Deposit)) 

Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are equivalent. (A) I and II are correct. (B) II and III are correct. (C) Only III is correct. (D) Only I is correct.

Description : Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are ... (B) II and III are correct. (C) Only III is correct. (D) Only I is correct.

Last Answer : (D) Only I is correct.

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 

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.

Which of the following are the network services? A) File service B) Print service C) Database service D) All of the above

Description : Which of the following are the network services? A) File service B) Print service C) Database service D) All of the above

Last Answer : D) All of the above

………………… approach reduces time and effort required for design and lesser risk in database management. A) Single global database B) Top-down approach C) Multiple databases D) None of the above

Description : ………………… approach reduces time and effort required for design and lesser risk in database management. A) Single global database B) Top-down approach C) Multiple databases D) None of the above

Last Answer : C) Multiple databases

Database applications were built directly on top of file system to overcome the following drawbacks of using file-systems (a) Data redundancy and inconsistency (b) Difficulty in accessing Data (c) Data isolation (d) Integrity problems (A) (a) (B) (a) and (d) (C) (a), (b) and (c) (D) (a), (b), (c) and (d)

Description : Database applications were built directly on top of file system to overcome the following drawbacks of using file-systems (a) Data redundancy and inconsistency (b) Difficulty in accessing Data (c) Data isolation (d) Integrity problems (A) (a) (B) ... d) (C) (a), (b) and (c) (D) (a), (b), (c) and (d)

Last Answer : (D) (a), (b), (c) and (d)