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
uranmaximum [27]
3 years ago
5

I am buying a BluRay drive access time is 180ms and the other is 210ms(BD-ROM) whats does access time mean

Computers and Technology
1 answer:
kkurt [141]3 years ago
6 0
It means how fast it can read the disk so if you want faster data transfer you would go for blurry if you really don't care go for the other one
You might be interested in
Your college has several campuses located across the city. within each campus, the buildings are interconnected with a campus ar
iris [78.8K]

Answer:

Metropolitan Area Network (MAN)

Explanation:

8 0
2 years ago
What are the five parts of computer hardware that can be found in most computer systems?
pashok25 [27]

Answer:

processor, primary storage, secondary storage, input devices and output devices

Explanation:

processor, primary storage, secondary storage, input devices and output devices are the five parts of computer hardware that can be found in most computer systems

8 0
3 years ago
Welcome to Cypres...
Debora [2.8K]

Answer:

<em>sorry</em><em> </em><em>I </em><em>don't</em><em> </em><em>know</em><em> </em><em> </em><em>I </em><em> </em><em>can't</em><em> </em><em>will</em><em> </em><em>your</em><em> </em><em>help</em>

5 0
4 years ago
Define a model or version that is used to test an idea is called a _______.
gulaghasi [49]
The answer is prototype
5 0
3 years ago
"What is the running time of HEAPSORT on an array A of length n thatis already sorted in increasing order?
Harrizon [31]

Answer:

The answer to this question is O(NlogN).

Explanation:

The time complexity of Heap Sort on an array A is O(NLogN) even if the array  is already sorted in increasing order.Since the Heap Sort is implemented by creating the heap from the array and then heapifying and then repeatedly swapping first and last element and deleting the last element.The process will be done for the whole array.So the running time complexity is O(NLogN).

5 0
4 years ago
Other questions:
  • Which of the following best explains why some people invest their saving in the stock market and others put their saving in bank
    5·2 answers
  • Can someone explain to me how to do circuit calculations
    11·1 answer
  • What resources can be shared over a computer network?
    12·2 answers
  • Describe the basic features of the relational data model and discuss their importance to the end user and the designer. Describe
    9·1 answer
  • Being able to express your thoughts in an email is a primary technology skill. true or false.
    9·2 answers
  • Refer to the method f: Public int f( int k, int n ) { if( n == k ) return k; else if( n &gt; k ) return f( k, n - k ); else retu
    8·1 answer
  • me pueden ayudar con mi trabajo sii porfss si me dan la respuesta correcta y les doy la mejor coronita si​
    12·1 answer
  • Laura is filming a scene in which the subject is sitting with a lit fireplace behind him. The only other source of light in the
    15·1 answer
  • ANYONE WANNA FRIEND ME ON DISCORD ゴRose joestarゴ#2088
    9·1 answer
  • TO Cloud
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!