Bachelor Of Computer Science

Database Management System Quizzes

Database Management System CS MCQs - Complete

Conceptual Database Design Quiz Questions and Answers p. 88

Conceptual Database Design quiz questions and answers, conceptual database design MCQs with answers PDF 88 to practice Database Management System CS mock tests for online college programs. Practice "Database Design Methodology and UML Diagrams" quiz questions with answers, conceptual database design Multiple Choice Questions (MCQ) for online college degrees. Free conceptual database design MCQs, ordered records, safe expressions, database approach characteristics, external sorting algorithms, conceptual database design test prep for CS major.

"The strategy in which the schema with basic abstractions are added into the other abstractions is classified as", conceptual database design Multiple Choice Questions (MCQ) with choices bottom up strategy, top down strategy, inside out strategy, and mixed strategy for online computer science engineering. Learn database design methodology and uml diagrams questions and answers to improve problem solving skills for online college classes.

Quiz on Conceptual Database Design

1.

The strategy in which the schema with basic abstractions are added into the other abstractions is classified as

top down strategy
bottom up strategy
inside out strategy
mixed strategy

2.

The files from which algorithms are selected for records are called

scan files
spanned files
non dense files
indexed files

3.

The application of database management system in air flight seat booking in a way that one seat is accessed by only one clerk for customer reservation is classified as

online transaction processing
offline transaction processing
online logical representation
offline modeling representation

4.

In relational calculus, the expression which guarantees finite number of tuples is classified as

declarative expression
stable expression
unsafe expression
safe expression

5.

The record searching technique in which the searching of records is done by block by block is classified as

heap search
non linear search
linear search
relative search