Exam 8: Data Structures and Caatts for Data Extraction

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

Which statement is true about a hashing structure?

(Multiple Choice)
4.9/5
(83)

In a relational database

(Multiple Choice)
4.9/5
(80)

Give two limitations of the hierarchical database model?

(Essay)
4.8/5
(66)

In the relational database model

(Multiple Choice)
4.7/5
(82)

Which of the following statements is not true?

(Multiple Choice)
4.9/5
(83)

What are the key control implications of the absence of database normalization?

(Essay)
4.9/5
(83)

View modeling begins by identifying the primary entities of the business function in question.

(True/False)
4.8/5
(71)

A transitive dependency

(Multiple Choice)
4.9/5
(80)

Cardinality describes the number of possible occurrences in one table that are associated with a single occurrence in a related table.

(True/False)
4.8/5
(75)

What is the update anomaly?

(Essay)
4.7/5
(79)

The deletion anomaly in unnormalized databases

(Multiple Choice)
4.9/5
(93)

Pointers can be used for all of the following except

(Multiple Choice)
4.9/5
(88)

What is view integration?

(Short Answer)
4.9/5
(80)

The database approach to data management is sometimes called the flat file approach.

(True/False)
4.9/5
(87)

Give an example of the insertion anomaly.

(Essay)
4.8/5
(86)

A user view

(Multiple Choice)
4.9/5
(74)

The two fundamental components of data structures are organization and access method.

(True/False)
4.8/5
(85)

Explain the following three types of pointers: physical address pointer, relative address pointer, and logical key pointer.

(Essay)
5.0/5
(86)

Outline some of the key advantages of GAS.

(Essay)
5.0/5
(86)

Contrast embedded audit modules with generalized audit software.

(Essay)
4.9/5
(81)
Showing 41 - 60 of 81
close modal

Filters

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