answersLogoWhite

0

There are Yotabits, which is equal to 1,000,000,000,000,000,000,000,000 bits, but all the worlds computers memory storage put together don't even equal 1 zetabyte, which is equal to 1,000,000,000,000,000,000,000.

User Avatar

Wiki User

16y ago

Still curious? Ask our experts.

Chat with our AI personalities

DevinDevin
I've poured enough drinks to know that people don't always want advice—they just want to talk.
Chat with Devin
ProfessorProfessor
I will give you the most educated answer.
Chat with Professor
TaigaTaiga
Every great hero faces trials, and you—yes, YOU—are no exception!
Chat with Taiga

Add your answer:

Earn +20 pts
Q: Is there anything faster than a TeraBit at this time?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Computer Science

Why is the access time of 60-NS faster than access of 70-NS?

Access time is the time it takes for the processor to access the device to read or write to / from it. To put it in more human terms: Which is faster, a train that takes 60 minutes to reach its destination, or a train that takes 70 minutes to reach its destination? The first one, obviously. The access time of 60ns will be faster than access time of 70ns


Is ram faster than virtual memory?

Virtual memory is memory taken from your HDD and converted into ram. Ram is the actual memory chips installed in the memory modules on your motherboard that are used for running processes,programs(etc.)


Data transfer will be faster in circuit switching or packet switching?

Data transfer will be faster in packet switching providing the setup time in circuit switching is greater than the time required to send a packet. If not, that is setup time in circuit switching takes less time, then circuit switching is quicker.


Is O(n) better than O(log n) in terms of time complexity?

In terms of time complexity, O(log n) is better than O(n) because it has a faster rate of growth as the input size increases.


How does the time complexity of an algorithm differ when comparing n vs logn?

When comparing the time complexity of an algorithm for n vs logn, the algorithm with a time complexity of logn will generally be more efficient and faster than the one with a time complexity of n. This is because logn grows at a slower rate than n as the input size increases.