1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Delvig [45]
4 years ago
10

Which is NOT a component of a relationaldatabase?

Computers and Technology
1 answer:
MaRussiya [10]4 years ago
5 0

Answer: 4) Hierarchy

Explanation:

The main components of the relational database are table, entity and attributes. As, relational data base is the method of arranging and maintaining the data and each table in the database contain data in the entity and the attributes. Hierarchy is not the component of the database as it is included in the type oh hierarchical database not in relational database.

You might be interested in
The objective is to write the program that can help you process the database. Your program should be able to (1) display the dat
miskamm [114]

Answer:

;;;;iiiiihhhhhhhhhhhhhhhhhkmbjhv hibv

Explanation:

7 0
4 years ago
What are the two basic steps in communication
Andrei [34K]

The sender forms an idea.The sender encodes the idea in a message.

4 0
4 years ago
What is jcl language on the mainframe?
Pavel [41]
Job Control Language on the mainframe is the name for scripting language used on IBM mainframe operating system to instruct how to start a subsystem.
5 0
4 years ago
You wish to lift a 12,000 lb stone by a vertical distance of 15 ft. Unfortunately, you can only generate a maximum pushing force
miss Akunina [59]

Answer:

Full question?

Explanation:

Sorry for asking this but where's what you want answered?

8 0
3 years ago
) Suppose algorithm A takes 10 seconds to handle a data set of 1000 records. Suppose the algorithm A is of complexity O(n2). Ans
Mice21 [21]

Answer:

i) The time taken for 1500 records = 15 seconds.

ii) The time taken for 1500 records = 50 seconds.

Explanation:

A is an O(n) algorithm.

An algorithm with O(n) efficiency is described as a linearly increasing algorithm, this mean that the rate at which the input increases is linear to the time needed to compute that algorithm with n inputs.

From the question, it is given that for 1000 records, the time required is: 10 seconds.

Algorithm time taken is O(n)

Hence,

1) For 1,500 records

=> 10/1000 = x/1500

=> 10x1500/1000 = x

x = 15 seconds

Thus, the time taken for 1500 records = 15 seconds.

2) For 5,000 records

=> 10/1000 = x/5000

=> 10x5000/1000 = x

x = 50 seconds

Thus, the time taken for 1500 records = 50 seconds.

8 0
3 years ago
Other questions:
  • With ________, website programmers can import data from other sources to create new functions and features that we associate wit
    14·1 answer
  • The hotspot created by MiFi is password protected and can be used to connect Wi-Fi devices located within ____ feet of the MiFi
    9·1 answer
  • Write down the pseudo code of a program that calculates the Body Mass Index (BMI) of
    9·1 answer
  • 2.24 Write the relevant Python expression or statement, involving a list of numbers lst and using list operators and methods for
    11·1 answer
  • Order the following list of functions by the big-Oh notation. Group together those functions that are big θ of one another.6nlog
    5·1 answer
  • Although you are not a full administrator, you are asked to manage a protected document, allowing customized access to any inter
    7·1 answer
  • A small group of travelers is meeting inside an ancient building, and the travelers need access to the Internet using their mobi
    11·1 answer
  • Create two functions to calculate the area and circumference of the circle using pointer.
    12·1 answer
  • # input a mark in a subject of a student and
    9·1 answer
  • What is a key differentiator of Conversational Artificial Intelligence (AI)
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!