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
Degger [83]
3 years ago
11

PLZZ HELP

Computers and Technology
1 answer:
kap26 [50]3 years ago
4 0

Answer:

Explanation:

Keep in mind a lossy algorithm will lose information while a lossless algorithm maintains all your original information.

Therefore:

A. False, a lossy algorithm will not allow perfect reconstruction.

B. True, if you don't care about keeping all your information it's easier to compress.

C. False, you can use a lossless algorithm for anything.

D. False, the point of lossless is that you keep all information.

You might be interested in
A business letter should always include the address of the sender.<br> True<br> False
8090 [49]

Answer:

true

Explanation:it is true because like that they could send that letter were it go's so like that they don't have trouble looking for the person's letter

please mark me as brainlist

3 0
3 years ago
Read 2 more answers
Will technology be the destruction or salvation of human-kind
Delicious77 [7]

MARK ME As BRAINLIEST

Answer is salvation
5 0
3 years ago
Read 2 more answers
How is peace circulated?​
Agata [3.3K]

Answer:

Peace is when people are able to resolve their conflicts without violence and can work together to improve the quality of their lives. 

6 0
3 years ago
Read 2 more answers
The type of cover letter written in response to a posted job opening
amm1812

Answer:

C

Explanation:

I don't have one but I hope you get an A.

I hope this helped

                     

4 0
3 years ago
Consider a system consisting of m resources of the same type, being shared by n processes. Resources can be requested and releas
Mama L [17]

Answer:

Explanation:

The system will be deadlock free if the below two conditions holds :

Proof below:

Suppose N = Summation of all Need(i), A = Addition of all Allocation(i), M = Addition of all Max(i). Use contradiction to prove.

Suppose this system isn't deadlock free. If a deadlock state exists, then A = m due to the fact that there's only one kind of resource and resources can be requested and released only one at a time.

Condition B, N + A equals M < m + n. Equals N + m < m + n. And we get N < n. It means that at least one process i that Need(i) = 0.

Condition A, Pi can let out at least 1 resource. So there will be n-1 processes sharing m resources now, Condition a and b still hold. In respect to the argument, No process will wait forever or permanently, so there's no deadlock.

5 0
3 years ago
Other questions:
  • Achieving a degree in computer forensics, information technology, or even information systems can provide a strong foundation in
    11·1 answer
  • Which of the following information security technology is used for avoiding browser-based hacking?
    11·2 answers
  • How to copy single slide to powerpoint
    15·1 answer
  • How can you tell if a website is secure
    13·1 answer
  • A hard drive cannot be partitioned until the device _________ is set.
    15·1 answer
  • A user reports his or her computer is slow to boot. You check the boot order and determine that the computer is checking the C d
    12·1 answer
  • What should be used to clean LCD monitors? Liquid window cleaner Ammonia wipes Windshield washer liquid Antistatic monitor wipes
    15·1 answer
  • Jim wants to buy a car, but he’ll probably only need it for a couple of years. He has a short commute to work, so he won’t be pu
    10·1 answer
  • “identify the skill in the following scenario” :
    6·2 answers
  • LAB: Convert to binary - methods
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!