Answer:
See explaination
Explanation:
CREATE TABLE CATEGORY
(
cid int NOT NULL,
description varchar2(1000),
PRIMARY KEY (cid)
);
CREATE TABLE PRODUCT
(
pid int NOT NULL,
description varchar2(1000),
cid int,
price int,
p_size varchar2(1),
CONSTRAINT chk_price CHECK (price>0),
CONSTRAINT chk_size CHECK (p_size in ('S','M','L')),
CONSTRAINT fk_cid FOREIGN KEY (cid) REFERENCES CATEGORY(cid)
);
Answer: Provided in the explanation section
Explanation:
The question to this problem says;
Question:
I am sorting data that is stored over a network connection. Based on the properties of that connection, it is extremely expensive to "swap" two elements. But looping over the elements and looking at their values is very inexpensive. I want to minimize swaps above all other factors. Choose the sorting algorithm we studied that will perform the best:
ANSWER
1. Merge Sort
Because merge sort uses additional memory instead of swapping the elements.
2. Merge Sort and Quick Sort both can be used with multi processor.
cheers i hope this helps !!!
Answer:
C
Explanation:
Well, in your inquiry it says
"A presentation software that is used to organize and present pertinent information using graphics, word processing, outlining, drawing, and presentation management tools"
We know it isn't Microsoft Word, because Microsoft Word doesn't have a presentation feature. We know it isn't Excel because Excel is only meant for spreadsheet and analytics data.
However, on PowerPoint all these points make sense, PowerPoint is a tool that Microsoft created for the capabilities such as to present information, you can also put information inside of graphics as well, you can also draw, and outline too.
Answer:
The earliest age of technology. It can be defined as the time between 3000 B.C. and 1450 A.D. When humans first started communicating, they would try to use language to make simple pictures – petroglyphs to tell a story, map their terrain, or keep accounts such as how many animals one owned, etc.
<h2>Please mark me as brainliest</h2>
