All categories

3 years ago

How is it possible to find encyclopedias and reference texts on the internet

Computers and Technology

2 answers:

egoroff_w [7]3 years ago

8 1

Answer:Dont know dont care

Explanation: since you answered my question for points im using yours for points.

mariarad [96]3 years ago

3 1

Answer:

just look up encyclopedias

Explanation:

You might be interested in

Which activity does not allow a person to perform any work while at the shop

polet [3.4K]

Is it apprenticeship???:D

5 0

2 years ago

Write a copy constructor for carcounter that assigns origcarcounter.carcount to the constructed object's carcount. sample output

Drupady [299]

#include <iostream>

using namespace std;

class CarCounter {

public:

CarCounter();

CarCounter(const CarCounter& origCarCounter);

void SetCarCount(const int count) {

carCount = count;

}

int GetCarCount() const {

return carCount;

}

private:

int carCount;

};

CarCounter::CarCounter() {

carCount = 0;

return;

}

CarCounter::CarCounter(const CarCounter &p){

carCount = p.carCount;

}

void CountPrinter(CarCounter carCntr) {

cout << "Cars counted: " << carCntr.GetCarCount();

return;

}

int main() {

CarCounter parkingLot;

parkingLot.SetCarCount(5);

CountPrinter(parkingLot);

return 0;

}

Sample output:

Cars Counted: 5

8 0

3 years ago

Read 2 more answers

Patient letters created from __________ use structured data and do not require a large amount of typing from the medical assista

umka2103 [35]

Templates I think. not sure

3 0

2 years ago

[1] Please find all the candidate keys and the primary key (or composite primary key) Candidate Key: _______________________ Pri

AVprozaik [17]

Answer:

Check the explanation

Explanation:

1. The atomic attributes can't be a primary key because the values in the respective attributes should be unique.

So, the size of the primary key should be more than one.

In order to find the candidate key, let the functional dependencies be obtained.

The functional dependencies are :

Emp_ID -> Name, DeptID, Marketing, Salary

Name -> Emp_ID

DeptID -> Emp_ID

Marketing -> Emp_ID

Course_ID -> Course Name

Course_Name -> Course_ID

Date_Completed -> Course_Name

Closure of attribute { Emp_ID, Date_Completed } is { Emp_ID, Date_Completed , Name, DeptID, Marketing, Salary, Course_Name, Course_ID}

Closure of attribute { Name , Date_Completed } is { Name, Date_Completed , Emp_ID , DeptID, Marketing, Salary, Course_Name, Course_ID}

Closure of attribute { DeptID, Date_Completed } is { DeptID, Date_Completed , Emp_ID,, Name, , Marketing, Salary, Course_Name, Course_ID}

Closure of attribute { Marketing, Date_Completed } is { Marketing, Date_Completed , Emp_ID,, Name, DeptID , Salary, Course_Name, Course_ID}.

So, the candidate keys are :

{ Emp_ID, Date_Completed }

{ Name , Date_Completed }

{ DeptID, Date_Completed }

{ Marketing, Date_Completed }

Only one candidate key can be a primary key.

So, the primary key chosen be { Emp_ID, Date_Completed }..

The functional dependencies are :

Emp_ID -> Name, DeptID, Marketing, Salary

Name -> Emp_ID

DeptID -> Emp_ID

Marketing -> Emp_ID

Course_ID -> Course Name

Course_Name -> Course_ID

Date_Completed -> Course_Name

For a relation to be in 2NF, there should be no partial dependencies in the set of functional dependencies.

The first F.D. is

Emp_ID -> Name, DeptID, Marketing, Salary

Here, Emp_ID -> Salary ( decomposition rule ). So, a prime key determining a non-prime key is a partial dependency.

So, a separate table should be made for Emp_ID -> Salary.

The tables are R1(Emp_ID, Name, DeptID, Marketing, Course_ID, Course_Name, Date_Completed)

and R2( Emp_ID , Salary)

The following dependencies violate partial dependency as a prime attribute -> prime attribute :

Name -> Emp_ID

DeptID -> Emp_ID

Marketing -> Emp_ID

The following dependencies violate partial dependency as a non-prime attribute -> non-prime attribute :

Course_ID -> Course Name

Course_Name -> Course_ID

So, no separate tables should be made.

The functional dependency Date_Completed -> Course_Name has a partial dependency as a prime attribute determines a non-prime attribute.

So, a separate table is made.

The final relational schemas that follows 2NF are :

R1(Emp_ID, Name, DeptID, Marketing, Course_ID, Course_Name, Date_Completed)

R2( Emp_ID , Salary)

R3 (Date_Completed, Course_Name, Course_ID)

For a relation to be in 3NF, the functional dependencies should not have any transitive dependencies.

The functional dependencies in R1(Emp_ID, Name, DeptID, Marketing, Date_Completed) is :

Emp_ID -> Name, DeptID, Marketing

This violates the transitive property. So, no table is created.

The functional dependencies in R2 ( Emp_ID , Salary) is :

Emp_ID -> Salary

The functional dependencies in R3 (Date_Completed, Course_Name, Course_ID) are :

Date_Completed -> Course_Name

Course_Name -> Course_ID

Here there is a transitive dependency as a non- prime attribute ( Course_Name ) is determining a non-attribute ( Course_ID ).

So, a separate table is made with the concerned attributes.

The relational schemas which support 3NF re :

R1(Emp_ID, Name, DeptID, Course_ID, Marketing, Date_Completed) with candidate key as Emp_ID.

R2 ( Emp_ID , Salary) with candidate key Emp_ID.

R3 (Date_Completed, Course_Name ) with candidate key Date_Completed.

R4 ( Course_Name, Course_ID ). with candidate keys Course_Name and Course_ID.

6 0

3 years ago

computer has a 32-bit instruction word broken into fields as follows: opcode, six bits; two register file address fields, five b

lina2011 [118]

Answer:

a. 2^6, or 64 opcodes.

b. 2^5, or 32 registers.

c. 2^16, or 0 to 65536.

d. -32768 to 32768.

Explanation:

a. Following that the opcode is 6 bits, it is generally known that the maximum number of opcodes should be 2^6, or 64 opcodes.

b. Now, since the size of the register field is 5 bits, we know that 2^5 registers can be accessed, or 32 registers.

c. Unsigned immediate operand applies to the plus/minus sign of the number. Since unsigned numbers are always positive, the range is from 0 to 2^16, or 0 to 65536.

d. Considering that the signed operands can be negative, they need a 16'th bit for the sign and 15 bits for the number. This means there are 2 * (2^15) numbers, or 2^16. However, the numbers range from -32768 to 32768.

6 0

3 years ago