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

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

1 Answer

Answer :

(D) Sequential
by

Related questions

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

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

Last Answer : A) Hierarchical schema

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

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

. 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.

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.

………. contains data assisting day to day activities of the organization. A) Control database B) Operational database C) Strategic database D) Sequential database

Description : ………. contains data assisting day to day activities of the organization. A) Control database B) Operational database C) Strategic database D) Sequential database

Last Answer : B) Operational database

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

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.

What is Relational Database Management System ?

Description : What is Relational Database Management System ?

Last Answer : Database databases are organized in different rows, that is, files are considered only in records, but also in tables with list rows and columns. This type of database is called relational database management system.

Which of the following genres does Hadoop produce? a) Distributed file system b) JAX-RS c) Java Message Service d) Relational Database Management System

Description : Which of the following genres does Hadoop produce? a) Distributed file system b) JAX-RS c) Java Message Service d) Relational Database Management System

Last Answer : Distributed file system

n(log n) is referred to A. A measure of the desired maximal complexity of data mining algorithms B. A database containing volatile data used for the daily operation of an organization C. Relational database management system D. None of these

Description : n(log n) is referred to A. A measure of the desired maximal complexity of data mining algorithms B. A database containing volatile data used for the daily operation of an organization C. Relational database management system D. None of these

Last Answer : A. A measure of the desired maximal complexity of data mining algorithms

Expansion of RDBMS is (1) Repairable Database Management System (2) Relational Database Management System (3) Relational Database Memory System (4) Recurring Database Memory System

Description : Expansion of RDBMS is (1) Repairable Database Management System (2) Relational Database Management System (3) Relational Database Memory System (4) Recurring Database Memory System 

Last Answer : Relational Database Management System

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: 

A relational database management (RDBM) package manages datain morethan one file at once. How does itorganizethese file? As A. tables B. relations C. tuple D. both (a)and (b) E. None of the above

Description : A relational database management (RDBM) package manages datain morethan one file at once. How does itorganizethese file? As A. tables B. relations C. tuple D. both (a)and (b) E. None of the above

Last Answer : both (a)and (b)

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 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.

................. 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

A software design is highly modular if : (A) cohesion is functional and coupling is data type. (B) cohesion is coincidental and coupling is data type. (C) cohesion is sequential and coupling is content type. (D) cohesion is functional and coupling is stamp type.

Description : A software design is highly modular if : (A) cohesion is functional and coupling is data type. (B) cohesion is coincidental and coupling is data type. (C) cohesion is sequential and coupling is content type. (D) cohesion is functional and coupling is stamp type.

Last Answer : (A) cohesion is functional and coupling is data type.

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

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.

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

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

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

Which of the following is/are the Database server functions? i) Data management ii) Transaction management iii) Compile queries iv) Query optimization A) i, ii, and iv only B) i, ii and iii only C) ii, iii and iv only D) All i, ii, iii, and iv

Description : Which of the following is/are the Database server functions? i) Data management ii) Transaction management iii) Compile queries iv) Query optimization A) i, ii, and iv only B) i, ii and iii only C) ii, iii and iv only D) All i, ii, iii, and iv

Last Answer : A) i, ii, and iv only

………………… 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

The Hierarchical Model Database:

Description : The Hierarchical Model Database:

Last Answer : The hierarchical model database resembles a tree like structure, such as how Microsoft Windows organizes folders and files. In a hierarchical model database, each upward link is nested in order to keep data ... Within this nested file are all of the sales (same types of data) for the day.

What is the difference between a sequential file and a random file?

Description : What is the difference between a sequential file and a random file?

Last Answer : Ans: Sequential file access is the method employed in tape drives where the files are access in a sequential manner. So if you have to get a file in the end of the tape you have to start ... Disks and Optical drives, wherever the files is placed it will go to that particular place and retrieve it.

Data store in a DFD represents. A) a sequential file B) a disk store C) a repository of data

Description : Data store in a DFD represents. A) a sequential file B) a disk store C) a repository of data

Last Answer : C) a repository of data

The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. A) Lists B) Linked Lists C) Trees D) Queues

Description : The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. A) Lists B) Linked Lists C) Trees D) Queues

Last Answer : B) Linked Lists

The number of comparisons done by sequential search is ……………… A) (N/2)+1 B) (N+1)/2 C) (N-1)/2 D) (N+2)/2

Description : The number of comparisons done by sequential search is ……………… A) (N/2)+1 B) (N+1)/2 C) (N-1)/2 D) (N+2)/2

Last Answer : B) (N+1)/2

In the ………………… mode any record in the file can be accessed at random A) Sequential access B) Random access C) Standard access D) Source access

Description : In the ………………… mode any record in the file can be accessed at random A) Sequential access B) Random access C) Standard access D) Source access

Last Answer : B) Random access

HSAM stands for ………. A) Hierarchic Sequential Access Method B) Hierarchic Standard Access Method C) Hierarchic Sequential and Method D) Hierarchic Standard and Method

Description : HSAM stands for ………. A) Hierarchic Sequential Access Method B) Hierarchic Standard Access Method C) Hierarchic Sequential and Method D) Hierarchic Standard and Method

Last Answer : A) Hierarchic Sequential Access Method

………………… is a full form of SQL. A) Standard query language B) Sequential query language C) Structured query language D) Server side query language

Description : ………………… is a full form of SQL. A) Standard query language B) Sequential query language C) Structured query language D) Server side query language

Last Answer : A) Standard query language

What are the final values of Q1 and Q0 after 4 clock cycles, if initial values are 00 in the sequential circuit shown below: Image (A) 11 (B) 10 (C) 01 (D) 00

Description : What are the final values of Q1 and Q0 after 4 clock cycles, if initial values are 00 in the sequential circuit shown below: (A) 11 (B) 10 (C) 01 (D) 00

Last Answer : (D) 00

The output of a sequential circuit depends on (A) present input only (B) past input only (C) both present and past input (D) past output only

Description : The output of a sequential circuit depends on (A) present input only (B) past input only (C) both present and past input (D) past output only

Last Answer : (C) both present and past input