Question 1

How does a DBMS store data on its direct access files?

Accepted Answer

Usually the DBMS creates large

Question 2

A tree structure cannot be represented using indexes.

Accepted Answer

A) True 
 B)False

Question 3

Simple networks can be represented by using ________.

Accepted Answer

A) indexes or linked lists 
B) linked lists or sequential lists 
C) sequential lists or indexes 
D) complex networks 
A) indexes or linked lists 
B) linked lists or sequential lists 
C) sequential lists or indexes 
D) complex networks

Question 4

What is a set?

Accepted Answer

A key is a field that identifies a recor

Question 5

A collection of records and the N:M relationships between them is a ________.

Accepted Answer

A) simple network 
B) complex network 
C) compound network 
D) logical network 
A) simple network 
B) complex network 
C) compound network 
D) logical network

Question 6

The primary work key is a field or fields whose value uniquely identifies a record.

Accepted Answer

A) True 
 B)False

Question 7

Keys may include all of the following except ________.

Accepted Answer

A) primary keys 
B) unique secondary keys 
C) nonunique secondary keys 
D) nonunique primary keys 
A) primary keys 
B) unique secondary keys 
C) nonunique secondary keys 
D) nonunique primary keys

Question 8

Complex networks can be represented by reducing them to simple networks,and then representing the simple networks using ________.

Accepted Answer

A) indexes or linked lists 
B) linked lists or sequential lists 
C) sequential lists or indexes 
D) trees 
A) indexes or linked lists 
B) linked lists or sequential lists 
C) sequential lists or indexes 
D) trees

Question 9

A simple network can be represented using linked lists and indexes.

Accepted Answer

A) True 
 B)False

Question 10

Each physical record is addressed by its sequential record number (SRN).

Accepted Answer

A) True 
 B)False

Question 11

A complex network cannot be decomposed into trees or simple networks.

Accepted Answer

A) True 
 B)False

Question 12

A simple network is a collection of records and the 1:N relationships between them.

Accepted Answer

A) True 
 B)False

Question 13

An important property of B-Trees is that they are balanced to maintain efficient and predictable performance."Balanced" here means that ________.

Accepted Answer

A) every pointers allows access to the same number of data records 
B) the numbers at every level of the B-Tree have the same average value 
C) the key field values are the same at every level 
D) every data record is the same distance from the top entry of the B-Tree 
A) every pointers allows access to the same number of data records 
B) the numbers at every level of the B-Tree have the same average value 
C) the key field values are the same at every level 
D) every data record is the same distance from the top entry of the B-Tree

Question 14

What is a B-tree?

Accepted Answer

A B-tree is a multilevel index that allo

Question 15

Each of the following is an example of a data structure except ________.

Accepted Answer

A) binary relationship 
B) sequential list 
C) linked list 
D) index 
A) binary relationship 
B) sequential list 
C) linked list 
D) index

Question 16

The DBMS creates ________,also called blocks,on its direct access fields.

Accepted Answer

A) psuedo records 
B) physical records 
C) secondary file records 
D) key file records 
A) psuedo records 
B) physical records 
C) secondary file records 
D) key file records

Question 17

A ________ is a file that has no repeating groups.

Accepted Answer

A) flat file 
B) stacked file 
C) record file 
D) key file 
A) flat file 
B) stacked file 
C) record file 
D) key file

Question 18

The word key indicates a field or fields whose value uniquely or nonuniquely identifies a record or set of records.

Accepted Answer

A) True 
 B)False

Question 19

A collection of records and the 1:N relationships between them is a ________.

Accepted Answer

A) simple network 
B) complex network 
C) compound network 
D) logical network 
A) simple network 
B) complex network 
C) compound network 
D) logical network

Exam 21: Data Structures for Database Processing

How does a DBMS store data on its direct access files?

A tree structure cannot be represented using indexes.

Simple networks can be represented by using ________.

What is a set?

A collection of records and the N:M relationships between them is a ________.

The primary work key is a field or fields whose value uniquely identifies a record.

Keys may include all of the following except ________.

Complex networks can be represented by reducing them to simple networks,and then representing the simple networks using ________.

A simple network can be represented using linked lists and indexes.

Each physical record is addressed by its sequential record number (SRN).

A complex network cannot be decomposed into trees or simple networks.

A simple network is a collection of records and the 1:N relationships between them.

An important property of B-Trees is that they are balanced to maintain efficient and predictable performance."Balanced" here means that ________.

What is a B-tree?

Each of the following is an example of a data structure except ________.

The DBMS creates ________,also called blocks,on its direct access fields.

A ________ is a file that has no repeating groups.

The word key indicates a field or fields whose value uniquely or nonuniquely identifies a record or set of records.

A collection of records and the 1:N relationships between them is a ________.

Introduction

Introduction to Structured Query Language

The Relational Model and Normalization

Database Design Using Normalization

Data Modeling With the Entity-Relationship Model

Transforming Data Models Into Database Designs

SQL for Database Construction and Application Processing

Database Redesign

Managing Multiuser Databases

Managing Databases With SQL Server 2014

Managing Databases With Oracle Database

Managing Databases With Mysql 5.6

The Web Server Environment

Big Data, Data-Warehouses, and Business Intelligence Systems

Getting Started With Microsoft Access 2013

Getting Started With Systems Analysis and Design

E-R Diagrams and the IDEF1X Standard

E-R Diagrams and the UML Standard

Getting Started With Mysql Workbench Data Modeling Tools

Getting Started With Microsoft Visio 2013

the Semantic Object Model

Getting Started With Web Servers, PHP, and the Netbeans IDE

Business Intelligence Systems

Big Data

Filters