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
marissa [1.9K]
3 years ago
12

Jameis is researching at his local library when he finds a perfect source to use in his paper. When he goes to check the book ou

t, he learns that he has overdue library fees and therefore can't check out another book. Since he didn't have time to read the entire book and take notes, he decides to photocopy the entire book so he can take the copy home. Is this allowed? A. Yes. Fair use allows someone to make up to 20 copies of entire books. B. No. Fair use doesn't allow someone to copy and entire book or periodical. C. Yes. As long as he doesn't share the copy with anyone else, copying the book is allowed under fair use. D. No. If Jameis copies the book, he needs to leave the copy at the library.
Computers and Technology
2 answers:
aliya0001 [1]3 years ago
5 0

the answer is B. No. Fair use doesn't allow someone to copy and entire book or periodical.


if he has exaused his library rights, he is out of luck.


that would be piracy! which is HIGHLY ileagal. he could go to federal prision.

grin007 [14]3 years ago
4 0

I'm pretty sure it's A or B idk. Read this, it might help https://fairuse.stanford.edu/overview/fair-use/what-is-fair-use/

You might be interested in
1.Which of the serves as the basis for determining whether an object has moved or not?
Harrizon [31]

Answer:

1. b

2. c

3. b

4. d

5. a

(hope this helped)

4 0
2 years ago
Hurry plz
Elanso [62]

Answer: It allows you to locate materials, be aware of your assignments and plan time to get things done.

Hope it helped.

3 0
3 years ago
After adding text to a shape, a user can make the text bold and change its color using options in the
lozanna [386]

Answer:

Top area of Word, the second segment.

Explanation:

To make it bold, press the "B" button and to change the colour press the "A" underlined with a colour (normally red).

6 0
3 years ago
Phoebe has to give a presentation about recycling. Where should she look while presenting?
Naddika [18.5K]
Well, I think that maybe the answer is B or C. She shouldn't only look at her presentation while she is presenting it, that doesn't look professional, and you want to look at the people you are talking to.
6 0
3 years ago
Read 2 more answers
Suppose you have a file of data of approximately 100,000 personnel records (FYI, 213 = 8192 and 214 = 16384) using Social Securi
Natali [406]

Answer:

See explaination

Explanation:

The reasons why indexed sequential search structure is better are:

1. In index sequential search any field of the records can be used as the key. This key field can be numerical or alphanumerical.

2. Since each record has its data block address, searching for a record in larger database is easy and quick. There is no extra effort to search records. But proper primary key has to be selected to make efficient.

3. This method gives flexibility of using any column as key field and index will be generated based on that. In addition to the primary key and its index, we can have index generated for other fields too. Hence searching becomes more efficient, if there is search based on columns other than primary key.

The reasons why 5 B-tree is better:

1.The B-tree Provides support for range of queries in an efficient manner and You can iterate over an ordered list of elements.

2. B-Tree algorithms are good for accessing pages (or blocks) of stored information which are then copied into main memory for processing. In the worst case, they are designed to do dynamic set operations in O(lg n) time because of their high "branching factor" (think hundreds or thousands of keys off of any node). It is this branching factor that makes B-Trees so efficient for block storage/retrieval, since a large branching factor greatly reduces the height of the tree and thus the number of disk accesses needed to find any key.

3. It is a generalization of a BST in that a node can have more than two children. These are self-balancing and hence the average and worst complexities is logarithmic. We opt for these when the data is too huge to fit in main memory. These structures are used in database indexing and help in faster operations on disk

the additional informations is we should first decide to choose which structure is suiatable for which algoritm in terms of space and time and then use the appropriate search algorithm.

8 0
3 years ago
Other questions:
  • What is a Limited Purpose credit card
    11·2 answers
  • Look at the following form. Which input method is the form using to receive the user's favorite activity? What is your favorite
    12·2 answers
  • Identify the false statement.
    8·1 answer
  • What was one of the first inventions that made it possible to communicate almost instantly?
    11·1 answer
  • A company currently uses Microsoft Active Directory as its identity provider. The company recently purchased Oracle Cloud Infras
    13·1 answer
  • Write a C++ program to find if a given array of integers is sorted in a descending order. The program should print "SORTED" if t
    14·1 answer
  • A blue NFiPA label indicates: A) Health Hazard B) Special information C) Flammability D) Reactivity
    6·2 answers
  • True / False<br> An instruction’s opcode generally indicates the number and type of its operands.
    5·1 answer
  • What does “human-like” mean when we are talking about a machine?
    7·1 answer
  • Which example best demonstrates an impact of computers on the economy?
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!