Test
Chapter 2
Crea una cuenta gratis para terminar este test
Guarda tu progreso y consulta tu resultado final.
¿Ya tienes cuenta? Inicia sesión
Preguntas del test (38)
1The classical/elementary types of file organization include:
- APartitioned organization
- BSequential organization
- CStrandard organization
- DIndexed-sequential organization
- ERelative organization
2In relational model for database:
- ADefining the links is made logically, by attributes declared keys
- BThe domain is the line in a table and has no name
- CConnectives are tuple-oriented operators from relational calculus
- DThere is minus restriction
- EMakes the transition to the third generation of database
3When organizing data in external memory, the corresponding concepts are:
- AField-value
- BFeature-field
- CFeature-record
- DField-record
- ECollection of data-file
4In the database hierarchical model:
- AThere is an operator that helps transitioning from one record to another in a table
- BThere is the addition operator
- CThere is the notion of tree type
- DThere is the concept of status domain
- EA child node can have multiple parents
5When discussing about the evolution of organizing data in external memory, the following aspects are considered:
- AThe organization mode of the application
- BThe program structures
- CThe calculation procedures
- DThe transmission of data
- EThe redundancy of programs
- FNone
6The set of concepts and tools necessary to achieve the conceptual data schema form the:
- APhysical data structure
- BProgram design
- CDBMS
- DPhysical model
- EData model
- FNone
7In the network model of the database:
- ADefining objects is done by a tree type
- BA node can have any number of superiors
- CA node can have any number of subordinates
- DThere is the notion of set type
- EOnly the link 1:M can be represented
- FNone
8In the relational model of the database:
- AThere is the notion of record type
- BAttributes that have a role in creating links between tables are called composite keys
- CLinks between tables are described using the DML
- DThere is the concept of table schema
- EProjection, negation and existence are relational algebra operators
9In the network model of the database:
- AThere are concepts of owner node and member node
- BThere are operators for updating a set
- CThere is a locating operator of a tree
- DA record can not be a member of two instances of the same set type
- EUpdating data is difficult to be made
10The way the records are placed, according to the rules, represents for a file:
- AThe access mode
- BThe retrival mode
- CThe organization mode
- DThe calculation mode
- EThe programming mode
11In the hierarchical model of the database:
- ADefining the objects is made through objects: classes
- BThe admitted links are 1: 1, 1: M, M: N
- CThere are hierarchical sequences of realizations
- DThere is the update operator for trees
- EA realization child is always associated with a single parent realization
12In the object-oriented model for the database:
- AThe object has an identifier and properties
- BThe object has interface and implementation
- CThere are fundamental characteristics of objects: succession and encapsulation
- DThere is the restriction integrity: any class follows the rules imposed by the object to which it belongs
- EOperations (operators) are based on methods
13When organizing data in files, the reference levels are:
- AGlobal
- BConceptual
- CLogical
- DOverview
- EPhysical
14In the network model of the database:
- AThere is only one record type root
- BA subordinate can be reached in several ways
- CThere is an operator that allows locating a record based on the value of a field
- DA record may belong to several set types
- EImplementation of the model is a logical level
15When organizing data in files, the following aspects are taken into account:
- AThe programming language
- BUpdating data
- CThe type and frequency of record operations
- DThe volume of data
- EThe size of the hard disk
16When oraganizing data in external memory, the corresponding concepts are:
- AFile-family characteristics
- BFile-value
- CRecord-characteristic
- DRecord-domain of values
- EField-data collection
- FNone
17The data model for the database is a set composed of:
- AConcepts
- BThe structure of the program
- CThe data structure
- DInternal schema
- EFunctional structure
18In the relational model of the database:
- AUnion and projection are relational calculus operators
- BIn a table two tuples cannot have the same value for the composed key assembly
- CThe key composed of several attributes is called primary key
- DThe model implementation is done at a logical level
- EDefining data is made through two-dimensional arrays called relations
19The structure of a file is given by its components:
- AThe program
- BThe identification
- CThe index file structure
- DThe data
- EThe communication
20The file access mode/method can be:
- AIndexed sequential
- BUndetermined
- CDynamic
- DStructured
- EStandard
- FNone
21The elements/components of any model of the database are:
- AIntegrity rules
- BThe rules of behavior
- CThe rules of communication
- DDefining the calculation procedures
- EDefining the objects/entities
22Considering the implemented data model, databases can be:
- AGeneralized
- BSpecial
- CStatistics
- DManagement
- EArchiving
- FNone
23In the hierarchical model of the database:
- AAny access to a node can be done in several ways
- BA parent node can have multiple child nodes
- CThe relationship parent child can be 1: 1, 1: M
- DThe number of possible hierarchies increases combinatorial with the number of records
- EThere is a locating operator for the tree
24The elements/components of any data model of the database are:
- ADefining the entities/objects
- BThe operator acting on the structure of the data
- CArithmetic operators
- DDefining the links between entities/associations
- ECodd's rules
- FNone
25In the relational model of the database:
- ADefining of the objects is made through record types
- BThe tuple is a table's column and has a name
- CThe domain is a subset of Cartesian product of many tables
- DPotentially, any table can link to any table
- EThe quantfiers are domain oriented operators of relational calculus
26In object-oriented model for databases:
- AObject's behaviour is implemented through methods
- BMessages are requests for retrieval
- CAn object derives its data and functionality fron another object
- DThe object properties can be updated
- EThere are four fundamental (basic) chracteristics of objects
27In object-oriented model for databases:
- AThere is the integrity restriction: access to objects is not limited
- BThere is the integrity restriction: the object identifier ensures the integrity of reference to it
- CThere is the operator for updating the properties
- DThere is the operator for updating the classes
- EObjects can respond differently to the same properties
28The manipulation part of a data model for the database is given by:
- ADefining the entities
- BDefining the links
- CDefining the attributes
- DIntegrity rules
- EThe derivation rules
- FNone
29In object-oriented model for databases:
- AThe base concept is the class of tuples
- BThe object has a name and interface
- CThe object has a name and message
- DThere is an operator for the object identifier
- EThere are following characteristics of objects: the message, polymo...
30In the relational model of the database:
- AThe links between tables are described in DDL
- BThe relational operators are implemented in DDL
- CThere is the set type restriction
- DThere is the location operator for records
- EThere is the NULL value
31When organizing data in files, the reference levels are:
- AConceptual
- BProgrammer
- CGlobal
- DNetwork
- EOverall
- FNone
32In the hierarchical model of the database:
- AImplementation of the model is made physically
- BImplementation of the model is made logically
- CIf a record type has no achievements, neither have its descendents
- DThere is an operator for locating a tree
- EThere is an operator for locating a database
33For the evolution of organizing data in external memory, the following aspects are envisaged:
- AData organizing mode
- BLevels of structuring data
- CProcessing data models
- DRedundancy of programs
- ERelated software
34In the relational database model:
- AThere is the entity restriction
- BThere is the concept of inner key
- CThere is the notion of foreign key
- DT(a1:D1,...,an:Dn), where T-table , ai-attribute, Di-domain, is the relational schema
- Ethe order of rows and columns in a table is of great importance for creating the table
35The DB protection, in terms of data security relates to:
- AEncryption
- BConcurrency control
- CViews
- DControl keys
- EBackup
36The DB protection, in terms of data integrity relates to:
- AVision of network administrator
- BManual procedures
- CConcurrent access control
- DData encryption
- EBackup and recovery
37The protection of the database is provided through:
- AData security
- BThe integrity of programs
- CThe security of programs
- DNetwork software
- EDBMS
38Considering the implemented data model, databases can be:
- AHierarchical, local
- BDistributed, generalized
- CRelational, management
- DObject-oriented, specialized
- ENetwork, documentation
- FNone
Información
- Descripción
- Test sobre Chapter 2, creado por Andrei Andrei el 07/02/2017.
- Autor
- Andrei Andrei
- Idioma
- English
- Visitas
- 25
- Historial
- Creado el 7 feb 2017 · actualizado el 7 feb 2017
- Valoración
- Aún sin valoraciones Valora este test