Start learning →

Computer Science — Tanzania Relational Databases — practice questions

Explore 30 free Relational Databases questions in Computer Science — Tanzania Computer Science. Open each question or exercise to read its content, reference answers and available explanation.

Practise Relational Databases with Quill →

Relational Databases questions and exercises with answers

Showing questions 1–30 of 30.

A system storing related data elements in row-based tables is called an:Read the answer and worked solution →The relational model of data was first proposed at IBM Research in 1970 by:Read the answer and worked solution →In that model, a relation is a mathematical concept based on the idea of:Read the answer and worked solution →A minimal group of attributes that uniquely identifies each row is a:Read the answer and worked solution →For a car table, the licence plate plus the state can serve as a:Read the answer and worked solution →The candidate key chosen as the unique identifier for each record becomes the:Read the answer and worked solution →A primary key exists to guarantee that every record in a table is:Read the answer and worked solution →The same piece of data held in two separate places in a database creates:Read the answer and worked solution →Changing the storage device without changing the conceptual design is possible due to physical data:Read the answer and worked solution →A DBMS organising data into a treelike model is described as:Read the answer and worked solution →A DBMS storing documents, graphs and key-value data is described as:Read the answer and worked solution →A rigid schema makes a relational system a poor fit for data that is:Read the answer and worked solution →A single logical unit of work that reads and may modify a database is a:Read the answer and worked solution →Properties ensuring stored data stay reliable and accurate are known by the acronym:Read the answer and worked solution →The declarative language used to manage and query a relational database is:Read the answer and worked solution →SQL implements sublanguages numbering:Read the answer and worked solution →The theory of operators on relations used to retrieve tuples is called relational:Read the answer and worked solution →Union, Intersection, Difference and Product are all classed as:Read the answer and worked solution →An operator returning tuples belonging to both relations is:Read the answer and worked solution →Because operand order matters, the Difference operator is described as:Read the answer and worked solution →An operator returning a subset of rows meeting a condition is:Read the answer and worked solution →Applying the Project operator to a relation returns a subset that is:Read the answer and worked solution →Catch the database wordsRead the answer and worked solution →Pop the SQL sublanguagesRead the answer and worked solution →Run the database gatesRead the answer and worked solution →Slice the database wordsRead the answer and worked solution →Relational or NoSQLRead the answer and worked solution →Sort the database wordsRead the answer and worked solution →Type the numberRead the answer and worked solution →Database bingoRead the answer and worked solution →

Worked practice questions

A system storing related data elements in row-based tables is called an:

  1. RDBMS
  2. RSVPS
  3. RFIDS
  4. RTOSS
Show answer and solution

Correct answer: A. RDBMS

1. The data sits in tables made of rows and columns. 2. A management system controls those tables. 3. That system is an RDBMS. _Source: OpenStax Introduction to Computer Science, Chapter 8, Data Management._

Open this question →

The relational model of data was first proposed at IBM Research in 1970 by:

  1. Craik
  2. Codd
  3. Cobol
  4. Cabot
Show answer and solution

Correct answer: B. Codd

1. The model rests on the mathematics of sets. 2. One researcher set it out formally. 3. That researcher was Edgar F. Codd. _Source: OpenStax Introduction to Computer Science, Chapter 8, Data Management._

Open this question →

In that model, a relation is a mathematical concept based on the idea of:

  1. Sets
  2. Sums
  3. Signs
  4. Slots
Show answer and solution

Correct answer: A. Sets

1. A table has no inherent row order. 2. Its rows behave like members of a collection. 3. So a relation is based on sets. _Source: OpenStax Introduction to Computer Science, Chapter 8, Data Management._

Open this question →

How to practise

  1. Choose a Relational Databases question and try to work out your answer.
  2. Open the question to check the correct answer and read its worked solution.
  3. Continue in the app for bite-sized lessons, explanations and review with Quill. You can start without creating an account.

More Computer Science topics

Computer ScienceDatabase ManagementDatabasesInformation SystemsSQL