Exam 19: Data Structures for Database Processing

arrow
  • Select Tags
search iconSearch Question
flashcardsStudy Flashcards
  • Select Tags

An index is a table that cross-references record addresses with some attribute value.

(True/False)
4.7/5
(25)

Simple networks can be represented by using:

(Multiple Choice)
4.9/5
(43)

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

(True/False)
5.0/5
(30)

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

(True/False)
4.9/5
(37)

A two-way linked list has links in both directions.

(True/False)
4.8/5
(29)

To represent a tree structure using indexes,store each 1:N relationship as an index.

(True/False)
4.8/5
(37)

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

(True/False)
4.8/5
(43)

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

(True/False)
4.9/5
(30)

What is a B-tree?

(Essay)
4.8/5
(29)

What is a linked list?

(Essay)
4.9/5
(31)

A ________ is a file that has no repeating groups.

(Multiple Choice)
4.8/5
(35)

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

(True/False)
4.7/5
(33)

Each physical record is addressed by its:

(Multiple Choice)
4.9/5
(27)

In a linked list,the sequence field holds the address of the next record in the logical sequence.

(True/False)
4.9/5
(39)

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

(Multiple Choice)
4.9/5
(42)
Showing 21 - 35 of 35
close modal

Filters

  • Essay(0)
  • Multiple Choice(0)
  • Short Answer(0)
  • True False(0)
  • Matching(0)